./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:20:18,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:20:18,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:20:18,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:20:18,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:20:18,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:20:18,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:20:18,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:20:18,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:20:18,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:20:18,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:20:18,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:20:18,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:20:18,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:20:18,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:20:18,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:20:18,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:20:18,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:20:18,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:20:18,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:20:18,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:20:18,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:20:18,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:20:18,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:20:18,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:20:18,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:20:18,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:20:18,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:20:18,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:20:18,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:20:18,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:20:18,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:20:18,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:20:18,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:20:18,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:20:18,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:20:18,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:20:18,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:20:18,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:20:18,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:20:18,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:20:18,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:20:18,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:20:18,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:20:18,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:20:18,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:20:18,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:20:18,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:20:18,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:20:18,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:20:18,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:20:18,398 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:20:18,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:20:18,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:20:18,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:20:18,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:20:18,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:20:18,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:20:18,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:20:18,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:20:18,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:20:18,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:18,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:20:18,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:20:18,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:20:18,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:20:18,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:20:18,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:20:18,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:20:18,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:20:18,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2022-07-13 19:20:18,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:20:18,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:20:18,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:20:18,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:20:18,576 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:20:18,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-13 19:20:18,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735a6f3b4/dc0bc9a022c44498b5352403e0f52615/FLAGe85643ed8 [2022-07-13 19:20:19,071 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:20:19,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-13 19:20:19,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735a6f3b4/dc0bc9a022c44498b5352403e0f52615/FLAGe85643ed8 [2022-07-13 19:20:19,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735a6f3b4/dc0bc9a022c44498b5352403e0f52615 [2022-07-13 19:20:19,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:20:19,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:20:19,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:19,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:20:19,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:20:19,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4cf222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19, skipping insertion in model container [2022-07-13 19:20:19,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:20:19,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:20:19,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-13 19:20:19,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:19,445 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:20:19,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-13 19:20:19,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:19,542 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:20:19,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19 WrapperNode [2022-07-13 19:20:19,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:19,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:19,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:20:19,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:20:19,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,595 INFO L137 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2022-07-13 19:20:19,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:19,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:20:19,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:20:19,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:20:19,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:20:19,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:20:19,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:20:19,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:20:19,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (1/1) ... [2022-07-13 19:20:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:19,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:20:19,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:20:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:20:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:20:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:20:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:20:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:20:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:19,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:20:19,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:20:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:20:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:20:19,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:20:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:19,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:20:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:20:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:20:19,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:20:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:20:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:19,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:20:19,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:20:19,892 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:20:19,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:20:20,201 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-13 19:20:20,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:20,860 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:20:20,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:20:20,866 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:20:20,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:20:20 BoogieIcfgContainer [2022-07-13 19:20:20,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:20:20,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:20:20,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:20:20,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:20:20,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:20:19" (1/3) ... [2022-07-13 19:20:20,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf4305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:20:20, skipping insertion in model container [2022-07-13 19:20:20,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:19" (2/3) ... [2022-07-13 19:20:20,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf4305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:20:20, skipping insertion in model container [2022-07-13 19:20:20,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:20:20" (3/3) ... [2022-07-13 19:20:20,878 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-13 19:20:20,888 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:20:20,888 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:20:20,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:20:20,929 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b80d52f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@105a72f [2022-07-13 19:20:20,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:20:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 19:20:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 19:20:20,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:20,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:20,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-13 19:20:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:20,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013448340] [2022-07-13 19:20:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:20:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:21,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013448340] [2022-07-13 19:20:21,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013448340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:21,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:20:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145265782] [2022-07-13 19:20:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:21,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:20:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:20:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:20:21,311 INFO L87 Difference]: Start difference. First operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:21,408 INFO L93 Difference]: Finished difference Result 331 states and 539 transitions. [2022-07-13 19:20:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:20:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 19:20:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:21,430 INFO L225 Difference]: With dead ends: 331 [2022-07-13 19:20:21,430 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 19:20:21,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:20:21,441 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:21,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 464 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:20:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 19:20:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-13 19:20:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 19:20:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-13 19:20:21,490 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-13 19:20:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:21,491 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-13 19:20:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-13 19:20:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 19:20:21,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:21,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:21,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:20:21,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-13 19:20:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:21,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150872526] [2022-07-13 19:20:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:20:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150872526] [2022-07-13 19:20:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150872526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:21,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:20:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584512925] [2022-07-13 19:20:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:20:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:20:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:20:21,587 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:21,612 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-13 19:20:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:20:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 19:20:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:21,619 INFO L225 Difference]: With dead ends: 321 [2022-07-13 19:20:21,620 INFO L226 Difference]: Without dead ends: 163 [2022-07-13 19:20:21,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:20:21,622 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:21,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:20:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-13 19:20:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-13 19:20:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 118 states have internal predecessors, (161), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 19:20:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-13 19:20:21,647 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-13 19:20:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:21,647 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-13 19:20:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-13 19:20:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 19:20:21,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:21,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:21,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:20:21,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-13 19:20:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:21,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702424967] [2022-07-13 19:20:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:20:21,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:21,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702424967] [2022-07-13 19:20:21,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702424967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:20:21,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004780252] [2022-07-13 19:20:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:21,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:21,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:20:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 19:20:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:22,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:20:22,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:20:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:20:22,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:20:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:20:22,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004780252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:20:22,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:20:22,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 19:20:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436692838] [2022-07-13 19:20:22,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:20:22,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:20:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:20:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:22,159 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:22,211 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-13 19:20:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 19:20:22,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-13 19:20:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:22,213 INFO L225 Difference]: With dead ends: 327 [2022-07-13 19:20:22,215 INFO L226 Difference]: Without dead ends: 168 [2022-07-13 19:20:22,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:22,218 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 6 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:22,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 687 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:20:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-13 19:20:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-13 19:20:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 19:20:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-13 19:20:22,229 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-13 19:20:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:22,230 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-13 19:20:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-13 19:20:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 19:20:22,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:22,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:22,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 19:20:22,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:22,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-13 19:20:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:22,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174378948] [2022-07-13 19:20:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 19:20:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174378948] [2022-07-13 19:20:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174378948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:20:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741067729] [2022-07-13 19:20:22,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:20:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:22,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:20:22,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 19:20:22,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:20:22,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:20:22,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:20:22,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:20:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 19:20:22,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:20:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741067729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:22,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:20:22,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 19:20:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004639300] [2022-07-13 19:20:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:22,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:20:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:20:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:20:22,995 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:23,025 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2022-07-13 19:20:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:20:23,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-13 19:20:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:23,029 INFO L225 Difference]: With dead ends: 318 [2022-07-13 19:20:23,030 INFO L226 Difference]: Without dead ends: 292 [2022-07-13 19:20:23,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:23,032 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 190 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:23,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 807 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:20:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-13 19:20:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-07-13 19:20:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 205 states have (on average 1.395121951219512) internal successors, (286), 205 states have internal predecessors, (286), 73 states have call successors, (73), 12 states have call predecessors, (73), 12 states have return successors, (82), 73 states have call predecessors, (82), 73 states have call successors, (82) [2022-07-13 19:20:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2022-07-13 19:20:23,057 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 46 [2022-07-13 19:20:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:23,057 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2022-07-13 19:20:23,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:20:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2022-07-13 19:20:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 19:20:23,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:23,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:23,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 19:20:23,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 19:20:23,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -413357882, now seen corresponding path program 1 times [2022-07-13 19:20:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:23,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10963049] [2022-07-13 19:20:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:20:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:20:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:20:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:20:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 19:20:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10963049] [2022-07-13 19:20:23,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10963049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:20:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128787557] [2022-07-13 19:20:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:23,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:23,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:20:23,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 19:20:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:23,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:20:23,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:20:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 19:20:23,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:20:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 19:20:23,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128787557] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:20:23,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:20:23,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-07-13 19:20:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438742001] [2022-07-13 19:20:23,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:20:23,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 19:20:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 19:20:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 19:20:23,949 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 19:20:25,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:26,546 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2022-07-13 19:20:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 19:20:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2022-07-13 19:20:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:26,552 INFO L225 Difference]: With dead ends: 589 [2022-07-13 19:20:26,553 INFO L226 Difference]: Without dead ends: 313 [2022-07-13 19:20:26,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 19:20:26,556 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 79 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 114 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:26,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 762 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 304 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 19:20:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-13 19:20:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2022-07-13 19:20:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 221 states have internal predecessors, (301), 73 states have call successors, (73), 12 states have call predecessors, (73), 14 states have return successors, (88), 73 states have call predecessors, (88), 73 states have call successors, (88) [2022-07-13 19:20:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 462 transitions. [2022-07-13 19:20:26,586 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 462 transitions. Word has length 91 [2022-07-13 19:20:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:26,587 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 462 transitions. [2022-07-13 19:20:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 19:20:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 462 transitions. [2022-07-13 19:20:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 19:20:26,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:26,597 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:26,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 19:20:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:26,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1310826886, now seen corresponding path program 2 times [2022-07-13 19:20:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199374308] [2022-07-13 19:20:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:20:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:20:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:20:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:20:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 19:20:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199374308] [2022-07-13 19:20:27,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199374308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:27,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:27,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 19:20:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069284542] [2022-07-13 19:20:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:27,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:20:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:20:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:27,088 INFO L87 Difference]: Start difference. First operand 307 states and 462 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:29,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:29,730 INFO L93 Difference]: Finished difference Result 634 states and 980 transitions. [2022-07-13 19:20:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 19:20:29,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-13 19:20:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:29,734 INFO L225 Difference]: With dead ends: 634 [2022-07-13 19:20:29,734 INFO L226 Difference]: Without dead ends: 608 [2022-07-13 19:20:29,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:20:29,735 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 331 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 205 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:29,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 762 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 19:20:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-13 19:20:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 567. [2022-07-13 19:20:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 390 states have (on average 1.4076923076923078) internal successors, (549), 397 states have internal predecessors, (549), 145 states have call successors, (145), 24 states have call predecessors, (145), 31 states have return successors, (201), 145 states have call predecessors, (201), 145 states have call successors, (201) [2022-07-13 19:20:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2022-07-13 19:20:29,761 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 103 [2022-07-13 19:20:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:29,761 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2022-07-13 19:20:29,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2022-07-13 19:20:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 19:20:29,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:29,764 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:29,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 19:20:29,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:29,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851120, now seen corresponding path program 1 times [2022-07-13 19:20:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:29,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547405916] [2022-07-13 19:20:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:20:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:20:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:20:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:20:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 19:20:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547405916] [2022-07-13 19:20:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547405916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:29,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:29,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 19:20:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012570970] [2022-07-13 19:20:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:29,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:20:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:20:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:29,971 INFO L87 Difference]: Start difference. First operand 567 states and 895 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:32,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:34,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:36,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:37,082 INFO L93 Difference]: Finished difference Result 1105 states and 1722 transitions. [2022-07-13 19:20:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 19:20:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-13 19:20:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:37,086 INFO L225 Difference]: With dead ends: 1105 [2022-07-13 19:20:37,086 INFO L226 Difference]: Without dead ends: 608 [2022-07-13 19:20:37,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:20:37,088 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 366 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 265 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:37,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 762 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 471 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2022-07-13 19:20:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-13 19:20:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-07-13 19:20:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 392 states have (on average 1.405612244897959) internal successors, (551), 400 states have internal predecessors, (551), 145 states have call successors, (145), 24 states have call predecessors, (145), 32 states have return successors, (198), 145 states have call predecessors, (198), 145 states have call successors, (198) [2022-07-13 19:20:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 894 transitions. [2022-07-13 19:20:37,128 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 894 transitions. Word has length 103 [2022-07-13 19:20:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:37,128 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 894 transitions. [2022-07-13 19:20:37,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 894 transitions. [2022-07-13 19:20:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 19:20:37,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:37,134 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:37,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 19:20:37,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347046, now seen corresponding path program 1 times [2022-07-13 19:20:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870185817] [2022-07-13 19:20:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:20:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:20:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:20:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:20:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 19:20:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870185817] [2022-07-13 19:20:37,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870185817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:37,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:37,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 19:20:37,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028657781] [2022-07-13 19:20:37,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:37,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:20:37,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:20:37,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:37,415 INFO L87 Difference]: Start difference. First operand 570 states and 894 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:39,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:40,244 INFO L93 Difference]: Finished difference Result 1128 states and 1755 transitions. [2022-07-13 19:20:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 19:20:40,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-13 19:20:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:40,248 INFO L225 Difference]: With dead ends: 1128 [2022-07-13 19:20:40,248 INFO L226 Difference]: Without dead ends: 565 [2022-07-13 19:20:40,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:20:40,251 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 302 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:40,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 836 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 632 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 19:20:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-13 19:20:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 527. [2022-07-13 19:20:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 370 states have (on average 1.3837837837837839) internal successors, (512), 375 states have internal predecessors, (512), 125 states have call successors, (125), 23 states have call predecessors, (125), 31 states have return successors, (166), 128 states have call predecessors, (166), 125 states have call successors, (166) [2022-07-13 19:20:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 803 transitions. [2022-07-13 19:20:40,270 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 803 transitions. Word has length 103 [2022-07-13 19:20:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:40,270 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 803 transitions. [2022-07-13 19:20:40,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 803 transitions. [2022-07-13 19:20:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 19:20:40,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:40,273 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 19:20:40,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash 544197250, now seen corresponding path program 1 times [2022-07-13 19:20:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:40,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120412495] [2022-07-13 19:20:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:20:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:20:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:20:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:20:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 19:20:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:40,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120412495] [2022-07-13 19:20:40,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120412495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:40,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:40,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 19:20:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374341540] [2022-07-13 19:20:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:40,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:20:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:20:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:20:40,508 INFO L87 Difference]: Start difference. First operand 527 states and 803 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:41,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:43,516 INFO L93 Difference]: Finished difference Result 897 states and 1333 transitions. [2022-07-13 19:20:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 19:20:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-13 19:20:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:43,521 INFO L225 Difference]: With dead ends: 897 [2022-07-13 19:20:43,521 INFO L226 Difference]: Without dead ends: 533 [2022-07-13 19:20:43,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:20:43,524 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:43,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 936 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 19:20:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-13 19:20:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 489. [2022-07-13 19:20:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 347 states have (on average 1.3688760806916427) internal successors, (475), 354 states have internal predecessors, (475), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-07-13 19:20:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2022-07-13 19:20:43,545 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 103 [2022-07-13 19:20:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:43,546 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2022-07-13 19:20:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 19:20:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2022-07-13 19:20:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 19:20:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:43,549 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:43,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 19:20:43,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -689449485, now seen corresponding path program 1 times [2022-07-13 19:20:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:43,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730588415] [2022-07-13 19:20:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:20:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:20:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:20:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:20:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:20:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:20:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 19:20:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730588415] [2022-07-13 19:20:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730588415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:45,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:45,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 19:20:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652007453] [2022-07-13 19:20:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 19:20:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 19:20:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:20:45,320 INFO L87 Difference]: Start difference. First operand 489 states and 734 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:20:47,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:49,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:50,707 INFO L93 Difference]: Finished difference Result 891 states and 1293 transitions. [2022-07-13 19:20:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 19:20:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-07-13 19:20:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:50,711 INFO L225 Difference]: With dead ends: 891 [2022-07-13 19:20:50,711 INFO L226 Difference]: Without dead ends: 627 [2022-07-13 19:20:50,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-13 19:20:50,713 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 308 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 229 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:50,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 804 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 548 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-07-13 19:20:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-07-13 19:20:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 593. [2022-07-13 19:20:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 423 states have (on average 1.3546099290780143) internal successors, (573), 433 states have internal predecessors, (573), 126 states have call successors, (126), 31 states have call predecessors, (126), 43 states have return successors, (181), 128 states have call predecessors, (181), 126 states have call successors, (181) [2022-07-13 19:20:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 880 transitions. [2022-07-13 19:20:50,738 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 880 transitions. Word has length 117 [2022-07-13 19:20:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:50,739 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 880 transitions. [2022-07-13 19:20:50,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:20:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 880 transitions. [2022-07-13 19:20:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 19:20:50,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:50,741 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:50,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 19:20:50,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash 994793373, now seen corresponding path program 1 times [2022-07-13 19:20:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:50,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600868924] [2022-07-13 19:20:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:20:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:20:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:20:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:20:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:20:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:20:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 19:20:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:51,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600868924] [2022-07-13 19:20:51,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600868924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:51,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:20:51,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 19:20:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495024853] [2022-07-13 19:20:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:51,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 19:20:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 19:20:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:20:51,914 INFO L87 Difference]: Start difference. First operand 593 states and 880 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:20:54,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:20:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:54,632 INFO L93 Difference]: Finished difference Result 932 states and 1345 transitions. [2022-07-13 19:20:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 19:20:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-07-13 19:20:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:54,636 INFO L225 Difference]: With dead ends: 932 [2022-07-13 19:20:54,637 INFO L226 Difference]: Without dead ends: 604 [2022-07-13 19:20:54,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-13 19:20:54,638 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 40 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:54,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 984 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 678 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 19:20:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-07-13 19:20:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 595. [2022-07-13 19:20:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 425 states have (on average 1.3529411764705883) internal successors, (575), 435 states have internal predecessors, (575), 126 states have call successors, (126), 31 states have call predecessors, (126), 43 states have return successors, (181), 128 states have call predecessors, (181), 126 states have call successors, (181) [2022-07-13 19:20:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 882 transitions. [2022-07-13 19:20:54,670 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 882 transitions. Word has length 117 [2022-07-13 19:20:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:54,670 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 882 transitions. [2022-07-13 19:20:54,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:20:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 882 transitions. [2022-07-13 19:20:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 19:20:54,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:54,674 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:54,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 19:20:54,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2044010433, now seen corresponding path program 1 times [2022-07-13 19:20:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:54,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85134690] [2022-07-13 19:20:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:20:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:20:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:20:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:20:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:20:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:20:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:20:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:20:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:20:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-13 19:20:55,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:55,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85134690] [2022-07-13 19:20:55,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85134690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:20:55,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007677610] [2022-07-13 19:20:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:55,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:20:55,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 19:20:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:55,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 19:20:55,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:20:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-13 19:20:55,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:20:55,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007677610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:20:55,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:20:55,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-07-13 19:20:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720114748] [2022-07-13 19:20:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:20:55,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:20:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:20:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:20:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-13 19:20:55,717 INFO L87 Difference]: Start difference. First operand 595 states and 882 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 19:20:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:20:56,119 INFO L93 Difference]: Finished difference Result 1375 states and 2153 transitions. [2022-07-13 19:20:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 19:20:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-07-13 19:20:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:20:56,124 INFO L225 Difference]: With dead ends: 1375 [2022-07-13 19:20:56,124 INFO L226 Difference]: Without dead ends: 810 [2022-07-13 19:20:56,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-13 19:20:56,128 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 386 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:20:56,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 563 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 19:20:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-13 19:20:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 753. [2022-07-13 19:20:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 560 states have (on average 1.2464285714285714) internal successors, (698), 509 states have internal predecessors, (698), 134 states have call successors, (134), 31 states have call predecessors, (134), 58 states have return successors, (297), 212 states have call predecessors, (297), 134 states have call successors, (297) [2022-07-13 19:20:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1129 transitions. [2022-07-13 19:20:56,159 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1129 transitions. Word has length 135 [2022-07-13 19:20:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:20:56,159 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1129 transitions. [2022-07-13 19:20:56,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 19:20:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1129 transitions. [2022-07-13 19:20:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 19:20:56,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:20:56,162 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:20:56,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 19:20:56,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:56,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:20:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:20:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash 741933792, now seen corresponding path program 1 times [2022-07-13 19:20:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:20:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546323522] [2022-07-13 19:20:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:20:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:20:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:20:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:20:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:20:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:20:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:20:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:20:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:20:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:20:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-13 19:20:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:20:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546323522] [2022-07-13 19:20:57,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546323522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:20:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964166546] [2022-07-13 19:20:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:20:57,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:20:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:57,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:20:57,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 19:20:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:20:58,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-13 19:20:58,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:20:58,724 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-13 19:20:58,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-13 19:20:58,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:58,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:58,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-07-13 19:20:59,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 19:20:59,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:20:59,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:20:59,811 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-13 19:20:59,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 478 [2022-07-13 19:20:59,839 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:20:59,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:20:59,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:21:00,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:21:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 19:21:00,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:00,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|)) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-13 19:21:00,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7102 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7102 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7102 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7096 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7095 (Array Int Int)) (v_ArrVal_7094 (Array Int Int)) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7096 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7095) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-13 19:21:00,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7093 (Array Int Int)) (v_ArrVal_7092 (Array Int Int)) (v_ArrVal_7095 (Array Int Int)) (v_ArrVal_7094 (Array Int Int)) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7096 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7093) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7095) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7091 (Array Int Int)) (v_ArrVal_7090 (Array Int Int)) (v_ArrVal_7093 (Array Int Int)) (v_ArrVal_7092 (Array Int Int)) (v_ArrVal_7095 (Array Int Int)) (v_ArrVal_7094 (Array Int Int)) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7130 (Array Int Int)) (v_ArrVal_7096 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7131 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7090) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7091) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7093) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7095) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7112) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7123))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7130) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7131) |c_~#__CS_thread_status~0.base| v_ArrVal_7127) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 78 not checked. [2022-07-13 19:21:00,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964166546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:00,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-13 19:21:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870085815] [2022-07-13 19:21:00,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 19:21:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 19:21:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=424, Unknown=11, NotChecked=572, Total=1122 [2022-07-13 19:21:00,974 INFO L87 Difference]: Start difference. First operand 753 states and 1129 transitions. Second operand has 34 states, 34 states have (on average 5.382352941176471) internal successors, (183), 30 states have internal predecessors, (183), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-13 19:21:03,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:05,052 INFO L93 Difference]: Finished difference Result 1535 states and 2212 transitions. [2022-07-13 19:21:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 19:21:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.382352941176471) internal successors, (183), 30 states have internal predecessors, (183), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 136 [2022-07-13 19:21:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:05,060 INFO L225 Difference]: With dead ends: 1535 [2022-07-13 19:21:05,060 INFO L226 Difference]: Without dead ends: 1097 [2022-07-13 19:21:05,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 284 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1339, Unknown=11, NotChecked=968, Total=2652 [2022-07-13 19:21:05,063 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 638 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 433 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 7050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4763 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:05,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1460 Invalid, 7050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1853 Invalid, 1 Unknown, 4763 Unchecked, 3.4s Time] [2022-07-13 19:21:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-07-13 19:21:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1020. [2022-07-13 19:21:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 762 states have (on average 1.2230971128608923) internal successors, (932), 695 states have internal predecessors, (932), 176 states have call successors, (176), 43 states have call predecessors, (176), 81 states have return successors, (408), 281 states have call predecessors, (408), 176 states have call successors, (408) [2022-07-13 19:21:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1516 transitions. [2022-07-13 19:21:05,138 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1516 transitions. Word has length 136 [2022-07-13 19:21:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1516 transitions. [2022-07-13 19:21:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.382352941176471) internal successors, (183), 30 states have internal predecessors, (183), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-13 19:21:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1516 transitions. [2022-07-13 19:21:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 19:21:05,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:05,142 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 19:21:05,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 924945984, now seen corresponding path program 1 times [2022-07-13 19:21:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331665583] [2022-07-13 19:21:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:21:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-13 19:21:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331665583] [2022-07-13 19:21:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331665583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:06,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305566261] [2022-07-13 19:21:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:06,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:06,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:06,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 19:21:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-13 19:21:07,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:07,260 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-13 19:21:07,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-13 19:21:07,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:07,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:07,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:07,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:07,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:08,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:08,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:08,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:08,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-13 19:21:08,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 19:21:08,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:08,381 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-13 19:21:08,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2496 treesize of output 894 [2022-07-13 19:21:08,413 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:21:08,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:21:08,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:21:08,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:21:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 19:21:08,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:08,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8065 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256)))) is different from false [2022-07-13 19:21:08,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8065 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|)) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (v_ArrVal_8048 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8047 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_8047) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8048) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8045 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (v_ArrVal_8048 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8046 (Array Int Int)) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8047 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int)) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8045) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8046) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_8047) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8048) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8044 (Array Int Int)) (v_ArrVal_8045 (Array Int Int)) (v_ArrVal_8043 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (v_ArrVal_8048 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8046 (Array Int Int)) (v_ArrVal_8047 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8057 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8043) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8045) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8046) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_8047) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8048) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8041 (Array Int Int)) (v_ArrVal_8044 (Array Int Int)) (v_ArrVal_8045 (Array Int Int)) (v_ArrVal_8042 (Array Int Int)) (v_ArrVal_8043 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (v_ArrVal_8048 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8046 (Array Int Int)) (v_ArrVal_8047 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8057 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8043) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8045) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8046) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_8047) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8048) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8040 (Array Int Int)) (v_ArrVal_8041 (Array Int Int)) (v_ArrVal_8044 (Array Int Int)) (v_ArrVal_8045 (Array Int Int)) (v_ArrVal_8042 (Array Int Int)) (v_ArrVal_8043 (Array Int Int)) (v_ArrVal_8065 (Array Int Int)) (v_ArrVal_8048 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_8049 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_8046 (Array Int Int)) (v_ArrVal_8047 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (|~#mutex~0.offset| Int) (v_ArrVal_8070 (Array Int Int)) (v_ArrVal_8051 (Array Int Int)) (v_ArrVal_8052 (Array Int Int)) (v_ArrVal_8074 (Array Int Int)) (v_ArrVal_8071 (Array Int Int)) (v_ArrVal_8050 (Array Int Int)) (v_ArrVal_8055 (Array Int Int)) (v_ArrVal_8077 (Array Int Int)) (v_ArrVal_8056 (Array Int Int)) (v_ArrVal_8053 (Array Int Int)) (v_ArrVal_8054 (Array Int Int)) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8039 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8043) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8045) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8046) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_8047) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8048) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8049) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8051) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8054) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_8055) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_8056))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_8057) |c_~#__CS_thread_status~0.base| v_ArrVal_8065) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_8077))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_8074) |c_~#__CS_thread_born_round~0.base| v_ArrVal_8070) |c_~#__CS_thread_status~0.base| v_ArrVal_8071) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 78 not checked. [2022-07-13 19:21:09,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305566261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:09,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:09,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-13 19:21:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560369085] [2022-07-13 19:21:09,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:09,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 19:21:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:09,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 19:21:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=423, Unknown=12, NotChecked=572, Total=1122 [2022-07-13 19:21:09,582 INFO L87 Difference]: Start difference. First operand 1020 states and 1516 transitions. Second operand has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 30 states have internal predecessors, (179), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-13 19:21:11,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:14,182 INFO L93 Difference]: Finished difference Result 1902 states and 2669 transitions. [2022-07-13 19:21:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 19:21:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 30 states have internal predecessors, (179), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 136 [2022-07-13 19:21:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:14,188 INFO L225 Difference]: With dead ends: 1902 [2022-07-13 19:21:14,188 INFO L226 Difference]: Without dead ends: 1076 [2022-07-13 19:21:14,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=1338, Unknown=12, NotChecked=968, Total=2652 [2022-07-13 19:21:14,193 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 502 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 360 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 7665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 5000 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:14,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1770 Invalid, 7665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2304 Invalid, 1 Unknown, 5000 Unchecked, 3.8s Time] [2022-07-13 19:21:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-07-13 19:21:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 994. [2022-07-13 19:21:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 743 states have (on average 1.2166890982503364) internal successors, (904), 681 states have internal predecessors, (904), 173 states have call successors, (173), 43 states have call predecessors, (173), 77 states have return successors, (392), 269 states have call predecessors, (392), 173 states have call successors, (392) [2022-07-13 19:21:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1469 transitions. [2022-07-13 19:21:14,244 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1469 transitions. Word has length 136 [2022-07-13 19:21:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:14,244 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1469 transitions. [2022-07-13 19:21:14,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 30 states have internal predecessors, (179), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-13 19:21:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1469 transitions. [2022-07-13 19:21:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 19:21:14,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:14,248 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:14,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:14,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:14,462 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -510625488, now seen corresponding path program 1 times [2022-07-13 19:21:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876606287] [2022-07-13 19:21:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:21:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-13 19:21:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:16,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876606287] [2022-07-13 19:21:16,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876606287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:16,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050529003] [2022-07-13 19:21:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:16,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:16,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:16,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 19:21:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-13 19:21:17,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:17,155 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-13 19:21:17,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-13 19:21:17,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:17,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:18,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-07-13 19:21:18,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 19:21:18,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:18,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:18,261 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-13 19:21:18,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 478 [2022-07-13 19:21:18,280 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:21:18,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:21:18,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:21:18,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:21:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 61 proven. 20 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 19:21:18,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:18,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9058 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-13 19:21:18,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9058 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9044 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:18,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|)) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:18,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:18,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:18,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:18,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9031 (Array Int Int)) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9032 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9032) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9031) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:19,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_9030 (Array Int Int)) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9031 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9032 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9029 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9030) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9032) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9031) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:19,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_9030 (Array Int Int)) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9031 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9032 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9027 (Array Int Int)) (v_ArrVal_9028 (Array Int Int)) (v_ArrVal_9029 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9028) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9030) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9032) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9031) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:19,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_9030 (Array Int Int)) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9031 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9032 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9027 (Array Int Int)) (v_ArrVal_9028 (Array Int Int)) (v_ArrVal_9025 (Array Int Int)) (v_ArrVal_9026 (Array Int Int)) (v_ArrVal_9029 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9028) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9030) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9032) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9031) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:19,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_9030 (Array Int Int)) (v_ArrVal_9052 (Array Int Int)) (v_ArrVal_9031 (Array Int Int)) (v_ArrVal_9050 (Array Int Int)) (v_ArrVal_9034 (Array Int Int)) (v_ArrVal_9035 (Array Int Int)) (v_ArrVal_9032 (Array Int Int)) (v_ArrVal_9033 (Array Int Int)) (v_ArrVal_9038 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_9036 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_9058 (Array Int Int)) (v_ArrVal_9037 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_9059 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_9064 (Array Int Int)) (v_ArrVal_9023 (Array Int Int)) (v_ArrVal_9045 (Array Int Int)) (v_ArrVal_9024 (Array Int Int)) (v_ArrVal_9043 (Array Int Int)) (v_ArrVal_9044 (Array Int Int)) (v_ArrVal_9027 (Array Int Int)) (v_ArrVal_9028 (Array Int Int)) (v_ArrVal_9025 (Array Int Int)) (v_ArrVal_9026 (Array Int Int)) (v_ArrVal_9029 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9023) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9028) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9030) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9032) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9031) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9033) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9037))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_9043) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_9045) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_9044) |c_~#__CS_thread_status~0.base| v_ArrVal_9058) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_9064))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_9052) |c_~#__CS_thread_born_round~0.base| v_ArrVal_9050) |c_~#__CS_thread_status~0.base| v_ArrVal_9059) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:21:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 78 not checked. [2022-07-13 19:21:19,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050529003] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:19,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:19,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-13 19:21:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067008969] [2022-07-13 19:21:19,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:19,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 19:21:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 19:21:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=424, Unknown=11, NotChecked=572, Total=1122 [2022-07-13 19:21:19,269 INFO L87 Difference]: Start difference. First operand 994 states and 1469 transitions. Second operand has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 30 states have internal predecessors, (194), 8 states have call successors, (30), 9 states have call predecessors, (30), 6 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2022-07-13 19:21:21,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:23,494 INFO L93 Difference]: Finished difference Result 1196 states and 1699 transitions. [2022-07-13 19:21:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 19:21:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 30 states have internal predecessors, (194), 8 states have call successors, (30), 9 states have call predecessors, (30), 6 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 146 [2022-07-13 19:21:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:23,498 INFO L225 Difference]: With dead ends: 1196 [2022-07-13 19:21:23,498 INFO L226 Difference]: Without dead ends: 972 [2022-07-13 19:21:23,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 305 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1339, Unknown=11, NotChecked=968, Total=2652 [2022-07-13 19:21:23,502 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 451 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 7016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4781 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1576 Invalid, 7016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1923 Invalid, 1 Unknown, 4781 Unchecked, 3.6s Time] [2022-07-13 19:21:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-07-13 19:21:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 914. [2022-07-13 19:21:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 681 states have (on average 1.223201174743025) internal successors, (833), 621 states have internal predecessors, (833), 163 states have call successors, (163), 39 states have call predecessors, (163), 69 states have return successors, (363), 253 states have call predecessors, (363), 163 states have call successors, (363) [2022-07-13 19:21:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1359 transitions. [2022-07-13 19:21:23,552 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1359 transitions. Word has length 146 [2022-07-13 19:21:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:23,552 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1359 transitions. [2022-07-13 19:21:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 30 states have internal predecessors, (194), 8 states have call successors, (30), 9 states have call predecessors, (30), 6 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2022-07-13 19:21:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1359 transitions. [2022-07-13 19:21:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 19:21:23,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:23,556 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:23,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:23,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:23,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 945379520, now seen corresponding path program 1 times [2022-07-13 19:21:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:23,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901797525] [2022-07-13 19:21:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:21:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-13 19:21:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:25,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901797525] [2022-07-13 19:21:25,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901797525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:25,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062633784] [2022-07-13 19:21:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:25,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:25,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:25,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:25,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 19:21:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-13 19:21:26,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:26,191 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-13 19:21:26,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-13 19:21:26,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:26,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:27,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:21:27,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,189 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-13 19:21:27,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2496 treesize of output 897 [2022-07-13 19:21:27,213 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:21:27,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:21:27,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:21:27,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:21:27,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 19:21:27,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:21:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 19:21:27,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:27,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10023 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_10023) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-13 19:21:27,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062633784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:27,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:21:27,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-13 19:21:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427642843] [2022-07-13 19:21:27,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:27,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 19:21:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 19:21:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-13 19:21:27,625 INFO L87 Difference]: Start difference. First operand 914 states and 1359 transitions. Second operand has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-13 19:21:29,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:31,023 INFO L93 Difference]: Finished difference Result 1164 states and 1665 transitions. [2022-07-13 19:21:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 19:21:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-07-13 19:21:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:31,028 INFO L225 Difference]: With dead ends: 1164 [2022-07-13 19:21:31,028 INFO L226 Difference]: Without dead ends: 884 [2022-07-13 19:21:31,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-07-13 19:21:31,030 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 345 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 243 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:31,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1254 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1614 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 19:21:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-07-13 19:21:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 861. [2022-07-13 19:21:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 639 states have (on average 1.2253521126760563) internal successors, (783), 580 states have internal predecessors, (783), 158 states have call successors, (158), 35 states have call predecessors, (158), 63 states have return successors, (347), 245 states have call predecessors, (347), 158 states have call successors, (347) [2022-07-13 19:21:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1288 transitions. [2022-07-13 19:21:31,075 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1288 transitions. Word has length 136 [2022-07-13 19:21:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:31,075 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1288 transitions. [2022-07-13 19:21:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-13 19:21:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1288 transitions. [2022-07-13 19:21:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 19:21:31,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:31,078 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:31,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 19:21:31,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1694805552, now seen corresponding path program 1 times [2022-07-13 19:21:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213526080] [2022-07-13 19:21:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:21:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-13 19:21:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:32,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213526080] [2022-07-13 19:21:32,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213526080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:32,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208431281] [2022-07-13 19:21:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:32,318 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:32,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 19:21:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:32,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 19:21:32,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-13 19:21:33,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:33,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208431281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:33,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:33,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-13 19:21:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050808220] [2022-07-13 19:21:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:33,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:21:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:21:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-13 19:21:33,073 INFO L87 Difference]: Start difference. First operand 861 states and 1288 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 19:21:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:33,665 INFO L93 Difference]: Finished difference Result 1838 states and 2819 transitions. [2022-07-13 19:21:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 19:21:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 146 [2022-07-13 19:21:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:33,670 INFO L225 Difference]: With dead ends: 1838 [2022-07-13 19:21:33,670 INFO L226 Difference]: Without dead ends: 1129 [2022-07-13 19:21:33,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-07-13 19:21:33,673 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 366 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:33,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1143 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 19:21:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-13 19:21:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 959. [2022-07-13 19:21:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 704 states have (on average 1.1392045454545454) internal successors, (802), 641 states have internal predecessors, (802), 182 states have call successors, (182), 40 states have call predecessors, (182), 72 states have return successors, (422), 277 states have call predecessors, (422), 182 states have call successors, (422) [2022-07-13 19:21:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1406 transitions. [2022-07-13 19:21:33,772 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1406 transitions. Word has length 146 [2022-07-13 19:21:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:33,772 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1406 transitions. [2022-07-13 19:21:33,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 19:21:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1406 transitions. [2022-07-13 19:21:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 19:21:33,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:33,775 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:33,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 19:21:33,991 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1167717052, now seen corresponding path program 1 times [2022-07-13 19:21:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:33,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568577776] [2022-07-13 19:21:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 19:21:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 19:21:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:35,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568577776] [2022-07-13 19:21:35,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568577776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:35,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:35,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 19:21:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329508054] [2022-07-13 19:21:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:35,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 19:21:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 19:21:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:21:35,322 INFO L87 Difference]: Start difference. First operand 959 states and 1406 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:21:37,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:38,180 INFO L93 Difference]: Finished difference Result 1209 states and 1724 transitions. [2022-07-13 19:21:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 19:21:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-07-13 19:21:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:38,185 INFO L225 Difference]: With dead ends: 1209 [2022-07-13 19:21:38,185 INFO L226 Difference]: Without dead ends: 990 [2022-07-13 19:21:38,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-07-13 19:21:38,188 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 479 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 213 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:38,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 882 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 788 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 19:21:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-13 19:21:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 939. [2022-07-13 19:21:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 687 states have (on average 1.1382823871906842) internal successors, (782), 628 states have internal predecessors, (782), 180 states have call successors, (180), 39 states have call predecessors, (180), 71 states have return successors, (414), 271 states have call predecessors, (414), 180 states have call successors, (414) [2022-07-13 19:21:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1376 transitions. [2022-07-13 19:21:38,237 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1376 transitions. Word has length 118 [2022-07-13 19:21:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:38,237 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1376 transitions. [2022-07-13 19:21:38,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:21:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1376 transitions. [2022-07-13 19:21:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 19:21:38,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:38,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:38,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 19:21:38,242 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1474702243, now seen corresponding path program 1 times [2022-07-13 19:21:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081992073] [2022-07-13 19:21:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 19:21:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-13 19:21:38,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:38,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081992073] [2022-07-13 19:21:38,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081992073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:38,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99151124] [2022-07-13 19:21:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:38,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:38,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:38,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 19:21:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 19:21:39,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:39,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-13 19:21:39,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 19:21:39,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:21:39,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 19:21:39,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 19:21:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 19:21:39,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:39,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-13 19:21:40,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99151124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:40,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:21:40,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2022-07-13 19:21:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025254861] [2022-07-13 19:21:40,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:40,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 19:21:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 19:21:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-13 19:21:40,030 INFO L87 Difference]: Start difference. First operand 939 states and 1376 transitions. Second operand has 19 states, 18 states have (on average 6.944444444444445) internal successors, (125), 15 states have internal predecessors, (125), 10 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-13 19:21:42,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:44,902 INFO L93 Difference]: Finished difference Result 2074 states and 3122 transitions. [2022-07-13 19:21:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 19:21:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.944444444444445) internal successors, (125), 15 states have internal predecessors, (125), 10 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Word has length 147 [2022-07-13 19:21:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:44,908 INFO L225 Difference]: With dead ends: 2074 [2022-07-13 19:21:44,908 INFO L226 Difference]: Without dead ends: 1180 [2022-07-13 19:21:44,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=547, Invalid=2315, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 19:21:44,912 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 1059 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 843 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2215 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 2116 Invalid, 1 Unknown, 298 Unchecked, 3.6s Time] [2022-07-13 19:21:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-07-13 19:21:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1096. [2022-07-13 19:21:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 786 states have (on average 1.1348600508905853) internal successors, (892), 698 states have internal predecessors, (892), 232 states have call successors, (232), 41 states have call predecessors, (232), 77 states have return successors, (559), 356 states have call predecessors, (559), 232 states have call successors, (559) [2022-07-13 19:21:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1683 transitions. [2022-07-13 19:21:44,983 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1683 transitions. Word has length 147 [2022-07-13 19:21:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:44,983 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 1683 transitions. [2022-07-13 19:21:44,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.944444444444445) internal successors, (125), 15 states have internal predecessors, (125), 10 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-13 19:21:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1683 transitions. [2022-07-13 19:21:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 19:21:44,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:44,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:45,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:45,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:45,209 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1732460611, now seen corresponding path program 1 times [2022-07-13 19:21:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435857983] [2022-07-13 19:21:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:45,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:21:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-13 19:21:45,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435857983] [2022-07-13 19:21:45,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435857983] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020849099] [2022-07-13 19:21:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:45,646 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:45,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 19:21:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:46,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 19:21:46,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:46,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-13 19:21:46,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 19:21:46,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:21:46,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 19:21:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 19:21:46,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:46,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-13 19:21:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020849099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:46,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:21:46,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-07-13 19:21:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321697257] [2022-07-13 19:21:46,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:46,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 19:21:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 19:21:46,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-13 19:21:46,795 INFO L87 Difference]: Start difference. First operand 1096 states and 1683 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-13 19:21:48,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:51,399 INFO L93 Difference]: Finished difference Result 1979 states and 2910 transitions. [2022-07-13 19:21:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 19:21:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 147 [2022-07-13 19:21:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:51,408 INFO L225 Difference]: With dead ends: 1979 [2022-07-13 19:21:51,408 INFO L226 Difference]: Without dead ends: 1272 [2022-07-13 19:21:51,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=554, Invalid=2098, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 19:21:51,412 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 986 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 815 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:51,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1852 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 1806 Invalid, 1 Unknown, 322 Unchecked, 3.5s Time] [2022-07-13 19:21:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2022-07-13 19:21:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1154. [2022-07-13 19:21:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 838 states have (on average 1.1455847255369929) internal successors, (960), 759 states have internal predecessors, (960), 224 states have call successors, (224), 50 states have call predecessors, (224), 91 states have return successors, (539), 344 states have call predecessors, (539), 224 states have call successors, (539) [2022-07-13 19:21:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1723 transitions. [2022-07-13 19:21:51,483 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1723 transitions. Word has length 147 [2022-07-13 19:21:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:51,484 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1723 transitions. [2022-07-13 19:21:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-13 19:21:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1723 transitions. [2022-07-13 19:21:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 19:21:51,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:51,488 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:51,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:51,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:51,706 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2098606569, now seen corresponding path program 1 times [2022-07-13 19:21:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:51,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151467469] [2022-07-13 19:21:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:21:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:21:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:21:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 19:21:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 19:21:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-13 19:21:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:51,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151467469] [2022-07-13 19:21:51,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151467469] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:51,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895301744] [2022-07-13 19:21:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:51,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:51,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 19:21:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:52,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 19:21:52,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-13 19:21:52,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 19:21:53,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895301744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:53,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:53,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 21 [2022-07-13 19:21:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174031970] [2022-07-13 19:21:53,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:53,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 19:21:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 19:21:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-13 19:21:53,283 INFO L87 Difference]: Start difference. First operand 1154 states and 1723 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-13 19:21:56,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:57,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:22:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:00,979 INFO L93 Difference]: Finished difference Result 3207 states and 4924 transitions. [2022-07-13 19:22:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 19:22:00,980 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) Word has length 146 [2022-07-13 19:22:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:00,989 INFO L225 Difference]: With dead ends: 3207 [2022-07-13 19:22:00,989 INFO L226 Difference]: Without dead ends: 2107 [2022-07-13 19:22:00,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=535, Invalid=2221, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 19:22:00,995 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 1427 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 1051 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1051 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:00,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 2648 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1051 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-13 19:22:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2022-07-13 19:22:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1984. [2022-07-13 19:22:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1443 states have (on average 1.1365211365211365) internal successors, (1640), 1314 states have internal predecessors, (1640), 372 states have call successors, (372), 89 states have call predecessors, (372), 168 states have return successors, (1016), 580 states have call predecessors, (1016), 372 states have call successors, (1016) [2022-07-13 19:22:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 3028 transitions. [2022-07-13 19:22:01,109 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 3028 transitions. Word has length 146 [2022-07-13 19:22:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:01,109 INFO L495 AbstractCegarLoop]: Abstraction has 1984 states and 3028 transitions. [2022-07-13 19:22:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-13 19:22:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 3028 transitions. [2022-07-13 19:22:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 19:22:01,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:01,114 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:01,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 19:22:01,331 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1887788041, now seen corresponding path program 1 times [2022-07-13 19:22:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992580774] [2022-07-13 19:22:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:22:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:22:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:22:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:22:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:22:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:22:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:22:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 19:22:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 19:22:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 19:22:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:04,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992580774] [2022-07-13 19:22:04,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992580774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:04,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172575524] [2022-07-13 19:22:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:04,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:04,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:04,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 19:22:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:05,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-13 19:22:05,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:05,884 INFO L356 Elim1Store]: treesize reduction 338, result has 14.0 percent of original size [2022-07-13 19:22:05,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 79 [2022-07-13 19:22:07,993 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-13 19:22:07,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 597 [2022-07-13 19:22:08,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:08,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:08,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:08,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:08,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:22:08,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:08,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,763 INFO L356 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-07-13 19:22:08,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 278 [2022-07-13 19:22:08,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:08,852 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:22:08,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:22:08,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:08,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:08,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 265 [2022-07-13 19:22:08,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:09,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:09,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:09,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:09,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:09,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 303 [2022-07-13 19:22:09,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:09,714 INFO L356 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-07-13 19:22:09,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 231 [2022-07-13 19:22:09,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:10,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:10,897 INFO L356 Elim1Store]: treesize reduction 36, result has 41.0 percent of original size [2022-07-13 19:22:10,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 72 treesize of output 45 [2022-07-13 19:22:10,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:11,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:11,372 INFO L356 Elim1Store]: treesize reduction 69, result has 38.4 percent of original size [2022-07-13 19:22:11,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 55 [2022-07-13 19:22:11,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:22:11,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:22:11,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:22:11,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:11,888 INFO L356 Elim1Store]: treesize reduction 69, result has 38.4 percent of original size [2022-07-13 19:22:11,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 65 [2022-07-13 19:22:12,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-13 19:22:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-13 19:22:13,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:13,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:13,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:15,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 589814 treesize of output 587766 [2022-07-13 19:22:17,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587766 treesize of output 571382 [2022-07-13 19:22:18,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 571382 treesize of output 538614 [2022-07-13 19:22:20,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 538614 treesize of output 534518 [2022-07-13 19:22:21,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534518 treesize of output 526326 [2022-07-13 19:22:23,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526326 treesize of output 525302 [2022-07-13 19:22:44,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172575524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:44,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:22:44,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 46 [2022-07-13 19:22:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798385891] [2022-07-13 19:22:44,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:44,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 19:22:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:44,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 19:22:44,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2076, Unknown=23, NotChecked=0, Total=2256 [2022-07-13 19:22:44,909 INFO L87 Difference]: Start difference. First operand 1984 states and 3028 transitions. Second operand has 46 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 40 states have internal predecessors, (120), 16 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) [2022-07-13 19:22:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:49,681 INFO L93 Difference]: Finished difference Result 3306 states and 5046 transitions. [2022-07-13 19:22:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 19:22:49,685 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 40 states have internal predecessors, (120), 16 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) Word has length 146 [2022-07-13 19:22:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:49,696 INFO L225 Difference]: With dead ends: 3306 [2022-07-13 19:22:49,696 INFO L226 Difference]: Without dead ends: 2338 [2022-07-13 19:22:49,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=595, Invalid=6500, Unknown=45, NotChecked=0, Total=7140 [2022-07-13 19:22:49,702 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 516 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3639 SdHoareTripleChecker+Invalid, 6024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1525 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:49,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3639 Invalid, 6024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 4115 Invalid, 0 Unknown, 1525 Unchecked, 2.8s Time] [2022-07-13 19:22:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2022-07-13 19:22:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2182. [2022-07-13 19:22:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1597 states have (on average 1.147777082028804) internal successors, (1833), 1476 states have internal predecessors, (1833), 386 states have call successors, (386), 105 states have call predecessors, (386), 198 states have return successors, (1102), 600 states have call predecessors, (1102), 386 states have call successors, (1102) [2022-07-13 19:22:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3321 transitions. [2022-07-13 19:22:49,832 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3321 transitions. Word has length 146 [2022-07-13 19:22:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:49,832 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 3321 transitions. [2022-07-13 19:22:49,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 40 states have internal predecessors, (120), 16 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) [2022-07-13 19:22:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3321 transitions. [2022-07-13 19:22:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 19:22:49,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:49,844 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:49,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 19:22:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 19:22:50,060 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -922750179, now seen corresponding path program 1 times [2022-07-13 19:22:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034094224] [2022-07-13 19:22:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:22:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:22:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:22:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 19:22:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:22:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:22:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-13 19:22:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:50,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034094224] [2022-07-13 19:22:50,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034094224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499309063] [2022-07-13 19:22:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:50,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:50,693 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:50,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 19:22:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 19:22:51,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:51,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:51,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:51,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 19:22:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-13 19:22:51,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:51,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-13 19:22:51,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-13 19:22:52,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-13 19:22:52,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-13 19:22:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 19:22:52,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499309063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:52,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:22:52,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2022-07-13 19:22:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692935194] [2022-07-13 19:22:52,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:52,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 19:22:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 19:22:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2022-07-13 19:22:52,268 INFO L87 Difference]: Start difference. First operand 2182 states and 3321 transitions. Second operand has 31 states, 29 states have (on average 5.068965517241379) internal successors, (147), 26 states have internal predecessors, (147), 15 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-07-13 19:22:54,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:23:02,792 INFO L93 Difference]: Finished difference Result 5488 states and 8214 transitions. [2022-07-13 19:23:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-13 19:23:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 5.068965517241379) internal successors, (147), 26 states have internal predecessors, (147), 15 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 147 [2022-07-13 19:23:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:23:02,815 INFO L225 Difference]: With dead ends: 5488 [2022-07-13 19:23:02,815 INFO L226 Difference]: Without dead ends: 3537 [2022-07-13 19:23:02,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1530, Invalid=7976, Unknown=0, NotChecked=0, Total=9506 [2022-07-13 19:23:02,826 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 1946 mSDsluCounter, 4227 mSDsCounter, 0 mSdLazyCounter, 6060 mSolverCounterSat, 1441 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 4637 SdHoareTripleChecker+Invalid, 7502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 6060 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-13 19:23:02,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1959 Valid, 4637 Invalid, 7502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1441 Valid, 6060 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-13 19:23:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-07-13 19:23:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3240. [2022-07-13 19:23:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 2360 states have (on average 1.1427966101694915) internal successors, (2697), 2150 states have internal predecessors, (2697), 600 states have call successors, (600), 155 states have call predecessors, (600), 279 states have return successors, (1624), 934 states have call predecessors, (1624), 600 states have call successors, (1624) [2022-07-13 19:23:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4921 transitions. [2022-07-13 19:23:03,095 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4921 transitions. Word has length 147 [2022-07-13 19:23:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:23:03,095 INFO L495 AbstractCegarLoop]: Abstraction has 3240 states and 4921 transitions. [2022-07-13 19:23:03,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 5.068965517241379) internal successors, (147), 26 states have internal predecessors, (147), 15 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-07-13 19:23:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4921 transitions. [2022-07-13 19:23:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 19:23:03,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:23:03,100 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:23:03,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 19:23:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:23:03,300 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:23:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:23:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1042056222, now seen corresponding path program 1 times [2022-07-13 19:23:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:23:03,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570091040] [2022-07-13 19:23:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:23:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:23:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:23:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:23:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:23:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:23:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:23:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:23:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:23:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:23:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 19:23:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 19:23:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-07-13 19:23:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:23:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570091040] [2022-07-13 19:23:03,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570091040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:23:03,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:23:03,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 19:23:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104271488] [2022-07-13 19:23:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:23:03,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:23:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:23:03,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:23:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:23:03,512 INFO L87 Difference]: Start difference. First operand 3240 states and 4921 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 19:23:05,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:07,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:09,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:23:10,238 INFO L93 Difference]: Finished difference Result 5908 states and 9357 transitions. [2022-07-13 19:23:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 19:23:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 149 [2022-07-13 19:23:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:23:10,268 INFO L225 Difference]: With dead ends: 5908 [2022-07-13 19:23:10,269 INFO L226 Difference]: Without dead ends: 3323 [2022-07-13 19:23:10,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:23:10,289 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 65 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-13 19:23:10,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 658 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 543 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-07-13 19:23:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2022-07-13 19:23:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3252. [2022-07-13 19:23:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2372 states have (on average 1.1420741989881955) internal successors, (2709), 2162 states have internal predecessors, (2709), 600 states have call successors, (600), 155 states have call predecessors, (600), 279 states have return successors, (1624), 934 states have call predecessors, (1624), 600 states have call successors, (1624) [2022-07-13 19:23:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4933 transitions. [2022-07-13 19:23:10,482 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4933 transitions. Word has length 149 [2022-07-13 19:23:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:23:10,483 INFO L495 AbstractCegarLoop]: Abstraction has 3252 states and 4933 transitions. [2022-07-13 19:23:10,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 19:23:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4933 transitions. [2022-07-13 19:23:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 19:23:10,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:23:10,487 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:23:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 19:23:10,488 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:23:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:23:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 560975964, now seen corresponding path program 1 times [2022-07-13 19:23:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:23:10,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135089982] [2022-07-13 19:23:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:23:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:23:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:23:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:23:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:23:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:23:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:23:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:23:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:23:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:23:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 19:23:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 19:23:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-13 19:23:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:23:13,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135089982] [2022-07-13 19:23:13,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135089982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:23:13,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022829420] [2022-07-13 19:23:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:23:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:23:13,681 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:23:13,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 19:23:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:14,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-13 19:23:14,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:15,038 INFO L356 Elim1Store]: treesize reduction 200, result has 14.2 percent of original size [2022-07-13 19:23:15,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 52 treesize of output 66 [2022-07-13 19:23:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:15,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:16,171 INFO L356 Elim1Store]: treesize reduction 309, result has 24.4 percent of original size [2022-07-13 19:23:16,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 407 [2022-07-13 19:23:16,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:23:16,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:23:16,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:23:17,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 16 [2022-07-13 19:23:17,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:23:17,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 16 [2022-07-13 19:23:17,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:23:17,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 19:23:18,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-13 19:23:18,299 INFO L356 Elim1Store]: treesize reduction 153, result has 32.0 percent of original size [2022-07-13 19:23:18,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 224 treesize of output 306 [2022-07-13 19:23:18,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 19:23:18,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 19:23:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2022-07-13 19:23:19,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 32 [2022-07-13 19:23:19,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 19:23:19,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,201 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:23:19,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,251 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:23:19,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:19,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:23:19,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 96 [2022-07-13 19:23:19,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 19:23:19,727 INFO L356 Elim1Store]: treesize reduction 27, result has 46.0 percent of original size [2022-07-13 19:23:19,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-07-13 19:23:21,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 732 treesize of output 437 [2022-07-13 19:23:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:21,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:21,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:21,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 19:23:21,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3703 treesize of output 3671 [2022-07-13 19:23:21,658 INFO L356 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-07-13 19:23:21,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1098 treesize of output 1014 [2022-07-13 19:23:21,731 INFO L356 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-07-13 19:23:21,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1030 treesize of output 1002 [2022-07-13 19:23:22,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:23:22,161 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:23:22,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:23:22,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:23:22,247 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:23:22,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 19:23:22,456 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 19:23:22,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2022-07-13 19:23:22,493 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 19:23:22,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-07-13 19:23:23,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 19:23:23,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 150 [2022-07-13 19:23:23,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 19:23:23,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 19:23:23,416 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 19:23:58,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1940 treesize of output 1141 [2022-07-13 19:23:58,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:58,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:58,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:04,008 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 301 DAG size of output: 132 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 19:24:04,009 INFO L356 Elim1Store]: treesize reduction 1257, result has 24.3 percent of original size [2022-07-13 19:24:04,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 4606 treesize of output 5751 [2022-07-13 19:24:07,008 INFO L356 Elim1Store]: treesize reduction 659, result has 29.9 percent of original size [2022-07-13 19:24:07,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 5845 treesize of output 6070 [2022-07-13 19:24:10,219 INFO L356 Elim1Store]: treesize reduction 659, result has 29.9 percent of original size [2022-07-13 19:24:10,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 6290 treesize of output 6435 [2022-07-13 19:24:10,343 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 19:24:10,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 19:24:10,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:24:10,552 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 19:24:10,554 INFO L158 Benchmark]: Toolchain (without parser) took 231461.14ms. Allocated memory was 86.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 51.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-13 19:24:10,554 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 19:24:10,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.69ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 73.7MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 19:24:10,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.40ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 70.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 19:24:10,556 INFO L158 Benchmark]: Boogie Preprocessor took 54.63ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 66.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 19:24:10,556 INFO L158 Benchmark]: RCFGBuilder took 1216.08ms. Allocated memory is still 111.1MB. Free memory was 66.3MB in the beginning and 60.6MB in the end (delta: 5.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-07-13 19:24:10,556 INFO L158 Benchmark]: TraceAbstraction took 229685.24ms. Allocated memory was 111.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 60.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-13 19:24:10,557 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.69ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 73.7MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.40ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 70.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.63ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 66.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1216.08ms. Allocated memory is still 111.1MB. Free memory was 66.3MB in the beginning and 60.6MB in the end (delta: 5.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 229685.24ms. Allocated memory was 111.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 60.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 19:24:10,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:24:12,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:24:12,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:24:12,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:24:12,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:24:12,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:24:12,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:24:12,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:24:12,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:24:12,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:24:12,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:24:12,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:24:12,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:24:12,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:24:12,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:24:12,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:24:12,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:24:12,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:24:12,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:24:12,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:24:12,213 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:24:12,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:24:12,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:24:12,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:24:12,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:24:12,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:24:12,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:24:12,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:24:12,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:24:12,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:24:12,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:24:12,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:24:12,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:24:12,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:24:12,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:24:12,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:24:12,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:24:12,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:24:12,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:24:12,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:24:12,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:24:12,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:24:12,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 19:24:12,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:24:12,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:24:12,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:24:12,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:24:12,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:24:12,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:24:12,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:24:12,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:24:12,252 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:24:12,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:24:12,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:24:12,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:24:12,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:24:12,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:24:12,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:24:12,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:24:12,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:24:12,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:24:12,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:24:12,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:24:12,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:24:12,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:24:12,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:24:12,256 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 19:24:12,256 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 19:24:12,256 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:24:12,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:24:12,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:24:12,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 19:24:12,257 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2022-07-13 19:24:12,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:24:12,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:24:12,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:24:12,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:24:12,542 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:24:12,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-13 19:24:12,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1fcb51b/d36b910c90c840c2b5075886d096ab0d/FLAG83fc41b94 [2022-07-13 19:24:12,974 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:24:12,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-13 19:24:12,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1fcb51b/d36b910c90c840c2b5075886d096ab0d/FLAG83fc41b94 [2022-07-13 19:24:13,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1fcb51b/d36b910c90c840c2b5075886d096ab0d [2022-07-13 19:24:13,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:24:13,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:24:13,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:24:13,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:24:13,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:24:13,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306e17ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13, skipping insertion in model container [2022-07-13 19:24:13,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:24:13,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:24:13,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-13 19:24:13,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:24:13,717 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:24:13,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-13 19:24:13,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:24:13,816 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:24:13,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13 WrapperNode [2022-07-13 19:24:13,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:24:13,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:24:13,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:24:13,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:24:13,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,891 INFO L137 Inliner]: procedures = 149, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2022-07-13 19:24:13,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:24:13,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:24:13,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:24:13,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:24:13,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:24:13,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:24:13,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:24:13,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:24:13,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:24:13" (1/1) ... [2022-07-13 19:24:13,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:24:13,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:24:13,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:24:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:24:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:24:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:24:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:24:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:24:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:24:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:24:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:24:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:24:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-13 19:24:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:24:14,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:24:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:24:14,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:24:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:24:14,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:24:14,172 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:24:14,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:24:14,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-13 19:24:14,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-13 19:24:14,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-13 19:24:14,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-13 19:24:14,453 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:24:14,453 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-13 19:24:14,453 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));