./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-08-20_10-08-36.files/protection-ghost/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i ./goblint.2024-08-20_10-08-36.files/protection-ghost/circular_buffer_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-26 19:30:42,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-26 19:30:42,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-26 19:30:42,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-26 19:30:42,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-26 19:30:42,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-26 19:30:42,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-26 19:30:42,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-26 19:30:42,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-26 19:30:42,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-26 19:30:42,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-26 19:30:42,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-26 19:30:42,510 INFO L153 SettingsManager]: * Use SBE=true [2024-08-26 19:30:42,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-26 19:30:42,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-26 19:30:42,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-26 19:30:42,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-26 19:30:42,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-26 19:30:42,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-26 19:30:42,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-26 19:30:42,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-26 19:30:42,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-26 19:30:42,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-26 19:30:42,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-26 19:30:42,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-26 19:30:42,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-26 19:30:42,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-26 19:30:42,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-26 19:30:42,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-26 19:30:42,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-26 19:30:42,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-26 19:30:42,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-26 19:30:42,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-26 19:30:42,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-26 19:30:42,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-26 19:30:42,521 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-26 19:30:42,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-26 19:30:42,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-26 19:30:42,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-26 19:30:42,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-26 19:30:42,523 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-26 19:30:42,524 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-26 19:30:42,524 INFO L153 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/UGemCutter-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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-26 19:30:42,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-26 19:30:42,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-26 19:30:42,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-26 19:30:42,797 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-26 19:30:42,798 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-26 19:30:42,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-ghost/circular_buffer_ok.yml/witness.yml [2024-08-26 19:30:42,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-26 19:30:42,879 INFO L274 PluginConnector]: CDTParser initialized [2024-08-26 19:30:42,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-08-26 19:30:44,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-26 19:30:44,706 INFO L384 CDTParser]: Found 1 translation units. [2024-08-26 19:30:44,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-08-26 19:30:44,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/318022257/412ef3ab478c42e7ae53e8a18dfb0042/FLAG5783480b7 [2024-08-26 19:30:45,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/318022257/412ef3ab478c42e7ae53e8a18dfb0042 [2024-08-26 19:30:45,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-26 19:30:45,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-26 19:30:45,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-26 19:30:45,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-26 19:30:45,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-26 19:30:45,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.08 07:30:42" (1/2) ... [2024-08-26 19:30:45,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f74f9c3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.08 07:30:45, skipping insertion in model container [2024-08-26 19:30:45,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.08 07:30:42" (1/2) ... [2024-08-26 19:30:45,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7bac4996 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.08 07:30:45, skipping insertion in model container [2024-08-26 19:30:45,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:30:45" (2/2) ... [2024-08-26 19:30:45,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f74f9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45, skipping insertion in model container [2024-08-26 19:30:45,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:30:45" (2/2) ... [2024-08-26 19:30:45,022 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-26 19:30:45,073 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-26 19:30:45,074 INFO L1541 ArrayList]: Location invariant before [L764-L764] ! multithreaded || (0 <= value && value <= 6) [2024-08-26 19:30:45,075 INFO L1541 ArrayList]: Location invariant before [L765-L765] ! multithreaded || (0 <= value && value <= 6) [2024-08-26 19:30:45,075 INFO L1541 ArrayList]: ghost_variable m_locked = 0 [2024-08-26 19:30:45,075 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-08-26 19:30:45,075 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,076 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,076 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,076 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L727-L727] m_locked = 1; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,077 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L753-L753] m_locked = 0; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,078 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,079 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,079 INFO L1541 ArrayList]: ghost_update [L745-L745] m_locked = 1; [2024-08-26 19:30:45,079 INFO L1541 ArrayList]: ghost_update [L763-L763] multithreaded = 1; [2024-08-26 19:30:45,079 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,080 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,080 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,080 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,080 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,080 INFO L1541 ArrayList]: ghost_update [L736-L736] m_locked = 0; [2024-08-26 19:30:45,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-26 19:30:45,430 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-26 19:30:45,440 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-26 19:30:45,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-26 19:30:45,557 INFO L206 MainTranslator]: Completed translation [2024-08-26 19:30:45,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45 WrapperNode [2024-08-26 19:30:45,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-26 19:30:45,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-26 19:30:45,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-26 19:30:45,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-26 19:30:45,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,600 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-08-26 19:30:45,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-26 19:30:45,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-26 19:30:45,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-26 19:30:45,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-26 19:30:45,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-26 19:30:45,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-26 19:30:45,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-26 19:30:45,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-26 19:30:45,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (1/1) ... [2024-08-26 19:30:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-26 19:30:45,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:30:45,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-26 19:30:45,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-26 19:30:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-26 19:30:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-08-26 19:30:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-08-26 19:30:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-08-26 19:30:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-08-26 19:30:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-26 19:30:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-26 19:30:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-26 19:30:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-08-26 19:30:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-26 19:30:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-26 19:30:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-26 19:30:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-26 19:30:45,697 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-26 19:30:45,810 INFO L242 CfgBuilder]: Building ICFG [2024-08-26 19:30:45,812 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-26 19:30:46,079 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-26 19:30:46,079 INFO L291 CfgBuilder]: Performing block encoding [2024-08-26 19:30:46,375 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-26 19:30:46,376 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-26 19:30:46,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:30:46 BoogieIcfgContainer [2024-08-26 19:30:46,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-26 19:30:46,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-26 19:30:46,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-26 19:30:46,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-26 19:30:46,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.08 07:30:42" (1/4) ... [2024-08-26 19:30:46,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f957787 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 26.08 07:30:46, skipping insertion in model container [2024-08-26 19:30:46,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:30:45" (2/4) ... [2024-08-26 19:30:46,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f957787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:30:46, skipping insertion in model container [2024-08-26 19:30:46,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:30:45" (3/4) ... [2024-08-26 19:30:46,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f957787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:30:46, skipping insertion in model container [2024-08-26 19:30:46,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:30:46" (4/4) ... [2024-08-26 19:30:46,388 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-08-26 19:30:46,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-26 19:30:46,407 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-08-26 19:30:46,407 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-26 19:30:46,457 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-08-26 19:30:46,503 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-26 19:30:46,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-26 19:30:46,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:30:46,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-26 19:30:46,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-26 19:30:46,546 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-26 19:30:46,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-26 19:30:46,571 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75db11a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-26 19:30:46,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-26 19:30:46,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:30:46,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:30:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1100392114, now seen corresponding path program 1 times [2024-08-26 19:30:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:30:46,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769344566] [2024-08-26 19:30:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:30:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:30:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:30:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:30:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769344566] [2024-08-26 19:30:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769344566] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-26 19:30:47,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-26 19:30:47,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-26 19:30:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146295802] [2024-08-26 19:30:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-26 19:30:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-26 19:30:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:30:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-26 19:30:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-26 19:30:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:47,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:30:47,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-08-26 19:30:47,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:30:47,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-26 19:30:47,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:30:47,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:30:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash -395241688, now seen corresponding path program 1 times [2024-08-26 19:30:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:30:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119200944] [2024-08-26 19:30:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:30:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:30:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:30:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:30:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119200944] [2024-08-26 19:30:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119200944] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-26 19:30:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-26 19:30:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-26 19:30:47,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978807306] [2024-08-26 19:30:47,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-26 19:30:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-26 19:30:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:30:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-26 19:30:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-26 19:30:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:47,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:30:47,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-08-26 19:30:47,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:30:47,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:30:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:30:47,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-26 19:30:47,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:30:47,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:30:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1864164271, now seen corresponding path program 1 times [2024-08-26 19:30:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:30:47,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755153344] [2024-08-26 19:30:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:30:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:30:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:30:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:30:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755153344] [2024-08-26 19:30:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755153344] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-26 19:30:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760337013] [2024-08-26 19:30:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:30:48,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:30:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:30:48,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-26 19:30:48,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-26 19:30:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:30:48,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-26 19:30:48,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-26 19:30:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:48,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-26 19:30:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760337013] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-26 19:30:50,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-26 19:30:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-26 19:30:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137506938] [2024-08-26 19:30:50,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-26 19:30:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-26 19:30:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:30:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-26 19:30:50,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-08-26 19:30:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:50,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:30:50,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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) [2024-08-26 19:30:50,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:30:50,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:30:50,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:30:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:30:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:30:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:30:50,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-26 19:30:50,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-08-26 19:30:50,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:30:50,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:30:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1433717123, now seen corresponding path program 2 times [2024-08-26 19:30:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:30:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491779747] [2024-08-26 19:30:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:30:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:30:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:30:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:30:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:30:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491779747] [2024-08-26 19:30:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491779747] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-26 19:30:51,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959705043] [2024-08-26 19:30:51,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-26 19:30:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:30:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:30:51,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-26 19:30:51,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-26 19:30:52,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-26 19:30:52,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-26 19:30:52,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-26 19:30:52,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-26 19:30:52,261 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:52,272 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:52,281 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 53 treesize of output 40 [2024-08-26 19:30:53,997 INFO L378 Elim1Store]: Elim1 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 3 [2024-08-26 19:30:54,003 INFO L378 Elim1Store]: Elim1 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 3 [2024-08-26 19:30:54,208 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:54,214 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:57,254 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:30:57,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 53 treesize of output 40 [2024-08-26 19:30:57,705 INFO L378 Elim1Store]: Elim1 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 3 [2024-08-26 19:30:57,714 INFO L378 Elim1Store]: Elim1 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 3 [2024-08-26 19:30:57,721 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:31:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:31:03,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-26 19:31:06,122 INFO L378 Elim1Store]: Elim1 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 4 [2024-08-26 19:31:06,128 INFO L378 Elim1Store]: Elim1 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 4 [2024-08-26 19:31:10,362 INFO L378 Elim1Store]: Elim1 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 4 [2024-08-26 19:31:10,372 INFO L378 Elim1Store]: Elim1 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 4 [2024-08-26 19:31:24,061 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-08-26 19:31:24,663 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 4 [2024-08-26 19:31:24,697 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 4 [2024-08-26 19:31:24,743 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 4 [2024-08-26 19:31:24,775 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 4 [2024-08-26 19:31:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:31:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959705043] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-26 19:31:31,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-26 19:31:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 36 [2024-08-26 19:31:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018793275] [2024-08-26 19:31:31,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-26 19:31:31,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-08-26 19:31:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:31:31,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-08-26 19:31:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2024-08-26 19:31:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:31:31,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:31:31,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 37 states have internal predecessors, (132), 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) [2024-08-26 19:31:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:31:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:31:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:31:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:31:34,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-08-26 19:31:35,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse40 (mod c_~first~0 4294967296))) (let ((.cse35 (+ .cse40 1)) (.cse36 (mod c_~buffer_size~0 4294967296)) (.cse34 (mod c_~next~0 4294967296)) (.cse16 (<= c_~value~0 6)) (.cse32 (<= 0 c_~value~0)) (.cse5 (= (mod c_~send~0 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (and .cse16 .cse32)) (.cse2 (< .cse36 (+ .cse34 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse33 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse28 (< .cse36 .cse35)) (.cse27 (mod (mod (+ c_~next~0 1) 4294967296) .cse36)) (.cse37 (not (= (+ c_~value~0 1) 0))) (.cse39 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse38 (< .cse34 1))) (let ((.cse12 (and (or .cse37 (< 0 .cse34)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse42 (* v_y_49 4294967296)) (.cse43 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse42 .cse43) 0) (< v_z_55 2147483649) (< .cse36 (+ v_z_55 .cse42 1 .cse43)) (not (= c_~value~0 (select .cse39 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse36 (+ v_z_55 2 .cse43)) (< (+ v_z_55 .cse43) 0) (< .cse36 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse44 (* v_y_53 4294967296)) (.cse45 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse36 v_z_53) (< (+ v_z_53 .cse44) 0) (< .cse36 (+ v_z_53 .cse44 2)) (not (= (select .cse39 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse36 (+ v_z_53 .cse44 .cse45 1)) (< (+ v_z_53 .cse44 .cse45) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse46 (* v_y_49 4294967296)) (.cse47 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse46 .cse47) 0) (= v_z_55 0) (< .cse36 (+ v_z_55 .cse46 1 .cse47)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse39 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse36 (+ v_z_55 2 .cse47)) (< (+ v_z_55 .cse47) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse48 (* v_y_53 4294967296)) (.cse49 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse48) 0) (< .cse36 (+ v_z_53 .cse48 2)) (< .cse36 (+ v_z_53 .cse48 .cse49 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse39 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse48 .cse49) 0))))) .cse38))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse41 (* v_y_30 4294967296))) (or (= .cse27 .cse41) (< (mod (+ .cse27 (* v_y_30 (- 4294967296)) 1) .cse36) 1) (< (+ 4294967295 .cse41) .cse27) (< .cse27 .cse41))))) (.cse31 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse25 (and (or (and (<= 1 .cse34) (<= .cse35 .cse36)) .cse37) (or .cse28 .cse38 (and (or (not (= c_~value~0 (select .cse39 (+ |c_~#buffer~0.offset| .cse40 (- 4294967296))))) (< .cse40 2147483648)) (or (< 2147483647 .cse40) (not (= c_~value~0 (select .cse39 (+ |c_~#buffer~0.offset| .cse40))))))))) (.cse30 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse29 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse33 0)) (.cse7 (< .cse33 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse21 (and (or .cse2 .cse8) (not (= .cse26 0)))) (.cse22 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse24 (or .cse10 .cse11))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) .cse16 (or (let ((.cse20 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse18 (= .cse20 0)) (.cse19 (< .cse20 0))) (and (or .cse1 (and (or .cse17 .cse18 .cse2 .cse3 .cse5 .cse19 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse17 .cse13 .cse14 .cse18 .cse2 .cse3 .cse15 .cse19 .cse8)))) .cse0) (or .cse0 (let ((.cse23 (< 0 .cse26))) (and (or .cse1 (and (or .cse21 .cse5 .cse22 .cse23) .cse24)) (or .cse25 .cse21 .cse13 .cse14 .cse22 .cse15 .cse23))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (<= 3 c_~value~0) (or .cse0 (and (or (and (or (< .cse27 1) .cse2 .cse28 .cse5 .cse22 .cse8) (or .cse25 .cse13 .cse10 .cse29 .cse15)) .cse30) (or .cse1 .cse10 .cse31 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse30) (or .cse10 .cse31 .cse11))) (or .cse25 .cse13 .cse14 .cse15 .cse30))) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse4 (and (or .cse5 .cse22) (or .cse13 .cse10 .cse29 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or .cse0 (and (or .cse21 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse5 .cse22 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse24)) (or (and .cse32 (<= c_~value~0 1)) (= c_~value~0 2) (= c_~value~0 3))))))) is different from false [2024-08-26 19:31:49,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (mod c_~first~0 4294967296))) (let ((.cse33 (+ .cse38 1)) (.cse34 (mod c_~buffer_size~0 4294967296)) (.cse32 (mod c_~next~0 4294967296)) (.cse5 (= (mod c_~send~0 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (< .cse34 (+ .cse32 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse27 (< .cse34 .cse33)) (.cse26 (mod (mod (+ c_~next~0 1) 4294967296) .cse34)) (.cse35 (not (= (+ c_~value~0 1) 0))) (.cse37 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse36 (< .cse32 1))) (let ((.cse12 (and (or .cse35 (< 0 .cse32)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse40 (* v_y_49 4294967296)) (.cse41 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse40 .cse41) 0) (< v_z_55 2147483649) (< .cse34 (+ v_z_55 .cse40 1 .cse41)) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse34 (+ v_z_55 2 .cse41)) (< (+ v_z_55 .cse41) 0) (< .cse34 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse42 (* v_y_53 4294967296)) (.cse43 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse34 v_z_53) (< (+ v_z_53 .cse42) 0) (< .cse34 (+ v_z_53 .cse42 2)) (not (= (select .cse37 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse34 (+ v_z_53 .cse42 .cse43 1)) (< (+ v_z_53 .cse42 .cse43) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse44 (* v_y_49 4294967296)) (.cse45 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse44 .cse45) 0) (= v_z_55 0) (< .cse34 (+ v_z_55 .cse44 1 .cse45)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse34 (+ v_z_55 2 .cse45)) (< (+ v_z_55 .cse45) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse46 (* v_y_53 4294967296)) (.cse47 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse46) 0) (< .cse34 (+ v_z_53 .cse46 2)) (< .cse34 (+ v_z_53 .cse46 .cse47 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse46 .cse47) 0))))) .cse36))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse39 (* v_y_30 4294967296))) (or (= .cse26 .cse39) (< (mod (+ .cse26 (* v_y_30 (- 4294967296)) 1) .cse34) 1) (< (+ 4294967295 .cse39) .cse26) (< .cse26 .cse39))))) (.cse30 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse24 (and (or (and (<= 1 .cse32) (<= .cse33 .cse34)) .cse35) (or .cse27 .cse36 (and (or (not (= c_~value~0 (select .cse37 (+ |c_~#buffer~0.offset| .cse38 (- 4294967296))))) (< .cse38 2147483648)) (or (< 2147483647 .cse38) (not (= c_~value~0 (select .cse37 (+ |c_~#buffer~0.offset| .cse38))))))))) (.cse29 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse28 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse31 0)) (.cse7 (< .cse31 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse20 (and (or .cse2 .cse8) (not (= .cse25 0)))) (.cse21 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse23 (or .cse10 .cse11))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) (or (let ((.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse17 (= .cse19 0)) (.cse18 (< .cse19 0))) (and (or .cse1 (and (or .cse16 .cse17 .cse2 .cse3 .cse5 .cse18 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse16 .cse13 .cse14 .cse17 .cse2 .cse3 .cse15 .cse18 .cse8)))) .cse0) (or .cse0 (let ((.cse22 (< 0 .cse25))) (and (or .cse1 (and (or .cse20 .cse5 .cse21 .cse22) .cse23)) (or .cse24 .cse20 .cse13 .cse14 .cse21 .cse15 .cse22))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (or (< .cse26 1) .cse2 .cse27 .cse5 .cse21 .cse8) (or .cse24 .cse13 .cse10 .cse28 .cse15)) .cse29) (or .cse1 .cse10 .cse30 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse29) (or .cse10 .cse30 .cse11))) (or .cse24 .cse13 .cse14 .cse15 .cse29))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse21) (or .cse13 .cse10 .cse28 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or .cse0 (and (or .cse20 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse5 .cse21 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse23))))))) is different from false [2024-08-26 19:31:49,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (mod c_~first~0 4294967296))) (let ((.cse13 (mod c_~next~0 4294967296)) (.cse16 (mod c_~buffer_size~0 4294967296)) (.cse37 (+ .cse38 1))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse26 (= (mod c_~receive~0 256) 0)) (.cse36 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (not (= (+ c_~value~0 1) 0))) (.cse30 (< .cse16 .cse37)) (.cse24 (< .cse13 1)) (.cse17 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse28 (mod (mod (+ c_~next~0 1) 4294967296) .cse16)) (.cse35 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (and (or (and (<= 1 .cse13) (<= .cse37 .cse16)) .cse12) (or .cse30 .cse24 (and (or (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse38 (- 4294967296))))) (< .cse38 2147483648)) (or (< 2147483647 .cse38) (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse38))))))))) (.cse34 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse25 (< (+ c_~value~0 2147483648) 0)) (.cse33 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse27 (< 2147483647 c_~value~0)) (.cse6 (= .cse36 0)) (.cse7 (< .cse36 0)) (.cse1 (not .cse26)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (< .cse16 (+ .cse13 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse31 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (let ((.cse3 (forall ((v_y_30 Int)) (let ((.cse29 (* v_y_30 4294967296))) (or (= .cse28 .cse29) (< (mod (+ .cse28 (* v_y_30 (- 4294967296)) 1) .cse16) 1) (< (+ 4294967295 .cse29) .cse28) (< .cse28 .cse29)))))) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or (and (or .cse12 (< 0 .cse13)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse14 (* v_y_49 4294967296)) (.cse15 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse14 .cse15) 0) (< v_z_55 2147483649) (< .cse16 (+ v_z_55 .cse14 1 .cse15)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse16 (+ v_z_55 2 .cse15)) (< (+ v_z_55 .cse15) 0) (< .cse16 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse18 (* v_y_53 4294967296)) (.cse19 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse16 v_z_53) (< (+ v_z_53 .cse18) 0) (< .cse16 (+ v_z_53 .cse18 2)) (not (= (select .cse17 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse16 (+ v_z_53 .cse18 .cse19 1)) (< (+ v_z_53 .cse18 .cse19) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse20 (* v_y_49 4294967296)) (.cse21 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse20 .cse21) 0) (= v_z_55 0) (< .cse16 (+ v_z_55 .cse20 1 .cse21)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse16 (+ v_z_55 2 .cse21)) (< (+ v_z_55 .cse21) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse22 (* v_y_53 4294967296)) (.cse23 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse22) 0) (< .cse16 (+ v_z_53 .cse22 2)) (< .cse16 (+ v_z_53 .cse22 .cse23 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse22 .cse23) 0))))) .cse24)) .cse25 .cse26 .cse2 .cse3 .cse4 .cse27 .cse6 .cse7 .cse8)))) (or .cse0 (and (or (and (or (< .cse28 1) .cse2 .cse30 .cse5 .cse31 .cse8) (or .cse32 .cse25 .cse10 .cse33 .cse27)) .cse34) (or .cse1 .cse10 .cse35 .cse11))) (or .cse0 .cse11) (or .cse0 (and (or .cse1 (and (or .cse5 .cse34) (or .cse10 .cse35 .cse11))) (or .cse32 .cse25 .cse26 .cse27 .cse34))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse31) (or .cse25 .cse10 .cse33 .cse27)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or .cse0 (and (or (and (or .cse2 .cse8) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse5 .cse31 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse10 .cse11)))))))) is different from false [2024-08-26 19:31:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:31:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:31:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:31:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-08-26 19:31:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-26 19:31:50,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:31:50,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:31:50,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:31:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash 942928523, now seen corresponding path program 3 times [2024-08-26 19:31:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:31:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350150654] [2024-08-26 19:31:50,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:31:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:31:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:31:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-08-26 19:31:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:31:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350150654] [2024-08-26 19:31:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350150654] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-26 19:31:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-26 19:31:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-26 19:31:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353301761] [2024-08-26 19:31:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-26 19:31:51,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-26 19:31:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:31:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-26 19:31:51,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-26 19:31:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:31:51,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:31:51,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2024-08-26 19:31:51,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:31:51,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:31:51,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:31:51,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-08-26 19:31:51,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:31:57,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-08-26 19:31:58,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse40 (mod c_~first~0 4294967296)) (.cse17 (mod c_~buffer_size~0 4294967296)) (.cse14 (mod c_~next~0 4294967296))) (let ((.cse8 (= (mod c_~send~0 256) 0)) (.cse6 (< .cse17 (+ .cse14 1))) (.cse10 (< c_~buffer_size~0 1)) (.cse41 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse39 (+ .cse40 1))) (let ((.cse13 (not (= (+ c_~value~0 1) 0))) (.cse36 (< .cse17 .cse39)) (.cse25 (< .cse14 1)) (.cse18 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse27 (= (mod c_~receive~0 256) 0)) (.cse33 (and (or .cse6 .cse10) (not (= .cse41 0)))) (.cse34 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse35 (< 0 .cse41)) (.cse11 (not .cse8)) (.cse12 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse1 (and (or .cse33 .cse8 .cse34 .cse35) (or .cse11 .cse12))) (.cse2 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (mod (mod (+ c_~next~0 1) 4294967296) .cse17)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse3 (not .cse27)) (.cse38 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (and (or (and (<= 1 .cse14) (<= .cse39 .cse17)) .cse13) (or .cse36 .cse25 (and (or (not (= c_~value~0 (select .cse18 (+ |c_~#buffer~0.offset| .cse40 (- 4294967296))))) (< .cse40 2147483648)) (or (< 2147483647 .cse40) (not (= c_~value~0 (select .cse18 (+ |c_~#buffer~0.offset| .cse40))))))))) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse28 (< 2147483647 c_~value~0)) (.cse37 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse0 .cse1 .cse2) (or (let ((.cse29 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse5 (= .cse29 0)) (.cse7 (forall ((v_y_30 Int)) (let ((.cse31 (* v_y_30 4294967296))) (or (= .cse30 .cse31) (< (mod (+ .cse30 (* v_y_30 (- 4294967296)) 1) .cse17) 1) (< (+ 4294967295 .cse31) .cse30) (< .cse30 .cse31))))) (.cse9 (< .cse29 0))) (and (or .cse3 (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or (and (or .cse13 (< 0 .cse14)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse15 (* v_y_49 4294967296)) (.cse16 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse15 .cse16) 0) (< v_z_55 2147483649) (< .cse17 (+ v_z_55 .cse15 1 .cse16)) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse17 (+ v_z_55 2 .cse16)) (< (+ v_z_55 .cse16) 0) (< .cse17 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse19 (* v_y_53 4294967296)) (.cse20 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse17 v_z_53) (< (+ v_z_53 .cse19) 0) (< .cse17 (+ v_z_53 .cse19 2)) (not (= (select .cse18 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse17 (+ v_z_53 .cse19 .cse20 1)) (< (+ v_z_53 .cse19 .cse20) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse21 (* v_y_49 4294967296)) (.cse22 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse21 .cse22) 0) (= v_z_55 0) (< .cse17 (+ v_z_55 .cse21 1 .cse22)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse17 (+ v_z_55 2 .cse22)) (< (+ v_z_55 .cse22) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse23 (* v_y_53 4294967296)) (.cse24 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse23) 0) (< .cse17 (+ v_z_53 .cse23 2)) (< .cse17 (+ v_z_53 .cse23 .cse24 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse23 .cse24) 0))))) .cse25)) .cse4 .cse26 .cse27 .cse5 .cse6 .cse7 .cse28 .cse9 .cse10)))) .cse0) (or .cse0 (and (or .cse3 .cse1) (or .cse32 .cse33 .cse26 .cse27 .cse34 .cse28 .cse35)) .cse2) (or .cse0 (and (or (and (or (< .cse30 1) .cse6 .cse36 .cse8 .cse34 .cse10) (or .cse32 .cse26 .cse11 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse28)) .cse37) (or .cse3 .cse11 .cse38 .cse12))) (or .cse0 (and (or .cse3 (and (or .cse8 .cse37) (or .cse11 .cse38 .cse12))) (or .cse32 .cse26 .cse27 .cse28 .cse37)))))))) is different from false [2024-08-26 19:31:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:31:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:31:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:31:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-26 19:31:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:31:58,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-26 19:31:58,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:31:58,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:31:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1831963839, now seen corresponding path program 4 times [2024-08-26 19:31:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:31:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826265827] [2024-08-26 19:31:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:31:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:31:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:31:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-26 19:31:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:31:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826265827] [2024-08-26 19:31:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826265827] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-26 19:31:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482716596] [2024-08-26 19:31:59,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-26 19:31:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:31:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:31:59,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-26 19:31:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-26 19:32:00,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-26 19:32:00,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-26 19:32:00,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-26 19:32:00,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-26 19:32:00,236 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,242 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,246 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,352 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,376 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,382 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,818 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,834 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:00,843 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:01,862 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:01,867 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:01,881 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-26 19:32:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-26 19:32:05,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-26 19:32:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-26 19:32:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482716596] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-26 19:32:09,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-26 19:32:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 34 [2024-08-26 19:32:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406677968] [2024-08-26 19:32:09,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-26 19:32:09,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-08-26 19:32:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:32:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-08-26 19:32:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-08-26 19:32:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:09,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:32:09,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 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) [2024-08-26 19:32:09,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:09,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:32:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-26 19:32:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:32:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-26 19:32:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-26 19:32:12,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-26 19:32:12,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:32:12,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:32:12,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:32:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2069102883, now seen corresponding path program 5 times [2024-08-26 19:32:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:32:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120575846] [2024-08-26 19:32:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:32:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:32:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:32:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 257 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:32:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:32:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120575846] [2024-08-26 19:32:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120575846] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-26 19:32:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776758330] [2024-08-26 19:32:13,537 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-26 19:32:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:32:13,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:32:13,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-26 19:32:13,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-26 19:32:36,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-08-26 19:32:36,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-26 19:32:36,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-26 19:32:36,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-26 19:32:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-26 19:32:36,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-26 19:32:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776758330] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-26 19:32:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-26 19:32:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 29 [2024-08-26 19:32:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546644599] [2024-08-26 19:32:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-26 19:32:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-26 19:32:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:32:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-26 19:32:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2024-08-26 19:32:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:36,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:32:36,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-08-26 19:32:36,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:36,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:32:36,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:36,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-26 19:32:36,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:36,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-26 19:32:36,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:32:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-26 19:32:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-26 19:32:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:37,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-26 19:32:38,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-08-26 19:32:38,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-08-26 19:32:38,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-26 19:32:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1843211935, now seen corresponding path program 1 times [2024-08-26 19:32:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-26 19:32:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896735824] [2024-08-26 19:32:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:32:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-26 19:32:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:32:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 240 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-26 19:32:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-26 19:32:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896735824] [2024-08-26 19:32:38,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896735824] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-26 19:32:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789515024] [2024-08-26 19:32:38,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-26 19:32:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:32:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-26 19:32:38,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-26 19:32:38,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-26 19:32:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-26 19:32:38,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-26 19:32:38,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-26 19:32:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-26 19:32:38,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-26 19:32:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789515024] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-26 19:32:38,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-26 19:32:38,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-08-26 19:32:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029612364] [2024-08-26 19:32:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-26 19:32:38,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-26 19:32:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-26 19:32:38,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-26 19:32:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2024-08-26 19:32:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:38,826 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-26 19:32:38,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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) [2024-08-26 19:32:38,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:38,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:32:38,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:38,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-08-26 19:32:38,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:32:38,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-26 19:32:38,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:32:38,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-26 19:32:53,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-08-26 19:32:56,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-08-26 19:32:56,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~first~0 4294967296))) (let ((.cse34 (+ .cse39 1)) (.cse35 (mod c_~buffer_size~0 4294967296)) (.cse33 (mod c_~next~0 4294967296)) (.cse31 (<= 0 c_~value~0)) (.cse5 (= (mod c_~send~0 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) .cse31)) (.cse2 (< .cse35 (+ .cse33 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse32 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse27 (< .cse35 .cse34)) (.cse26 (mod (mod (+ c_~next~0 1) 4294967296) .cse35)) (.cse36 (not (= (+ c_~value~0 1) 0))) (.cse38 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse37 (< .cse33 1))) (let ((.cse12 (and (or .cse36 (< 0 .cse33)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse41 (* v_y_49 4294967296)) (.cse42 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse41 .cse42) 0) (< v_z_55 2147483649) (< .cse35 (+ v_z_55 .cse41 1 .cse42)) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse35 (+ v_z_55 2 .cse42)) (< (+ v_z_55 .cse42) 0) (< .cse35 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse43 (* v_y_53 4294967296)) (.cse44 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse35 v_z_53) (< (+ v_z_53 .cse43) 0) (< .cse35 (+ v_z_53 .cse43 2)) (not (= (select .cse38 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse35 (+ v_z_53 .cse43 .cse44 1)) (< (+ v_z_53 .cse43 .cse44) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse45 (* v_y_49 4294967296)) (.cse46 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse45 .cse46) 0) (= v_z_55 0) (< .cse35 (+ v_z_55 .cse45 1 .cse46)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse35 (+ v_z_55 2 .cse46)) (< (+ v_z_55 .cse46) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse47 (* v_y_53 4294967296)) (.cse48 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse47) 0) (< .cse35 (+ v_z_53 .cse47 2)) (< .cse35 (+ v_z_53 .cse47 .cse48 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse47 .cse48) 0))))) .cse37))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse40 (* v_y_30 4294967296))) (or (= .cse26 .cse40) (< (mod (+ .cse26 (* v_y_30 (- 4294967296)) 1) .cse35) 1) (< (+ 4294967295 .cse40) .cse26) (< .cse26 .cse40))))) (.cse30 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse24 (and (or (and (<= 1 .cse33) (<= .cse34 .cse35)) .cse36) (or .cse27 .cse37 (and (or (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39 (- 4294967296))))) (< .cse39 2147483648)) (or (< 2147483647 .cse39) (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39))))))))) (.cse29 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse28 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse32 0)) (.cse7 (< .cse32 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse20 (and (or .cse2 .cse8) (not (= .cse25 0)))) (.cse21 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse23 (or .cse10 .cse11))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) (or (let ((.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse17 (= .cse19 0)) (.cse18 (< .cse19 0))) (and (or .cse1 (and (or .cse16 .cse17 .cse2 .cse3 .cse5 .cse18 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse16 .cse13 .cse14 .cse17 .cse2 .cse3 .cse15 .cse18 .cse8)))) .cse0) (or .cse0 (let ((.cse22 (< 0 .cse25))) (and (or .cse1 (and (or .cse20 .cse5 .cse21 .cse22) .cse23)) (or .cse24 .cse20 .cse13 .cse14 .cse21 .cse15 .cse22))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (or (< .cse26 1) .cse2 .cse27 .cse5 .cse21 .cse8) (or .cse24 .cse13 .cse10 .cse28 .cse15)) .cse29) (or .cse1 .cse10 .cse30 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse29) (or .cse10 .cse30 .cse11))) (or .cse24 .cse13 .cse14 .cse15 .cse29))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse21) (or .cse13 .cse10 .cse28 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or .cse0 (and (or .cse20 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse5 .cse21 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse23)) (or (and .cse31 (<= c_~value~0 1)) (= c_~value~0 2) (= c_~value~0 3))))))) is different from false [2024-08-26 19:32:57,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (mod c_~first~0 4294967296)) (.cse34 (mod c_~buffer_size~0 4294967296)) (.cse32 (mod c_~next~0 4294967296))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse34 (+ .cse32 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse48 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse33 (+ .cse38 1))) (let ((.cse14 (= (mod c_~receive~0 256) 0)) (.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse27 (< .cse34 .cse33)) (.cse23 (and (or .cse2 .cse8) (not (= .cse48 0)))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse25 (< 0 .cse48)) (.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse26 (mod (mod (+ c_~next~0 1) 4294967296) .cse34)) (.cse35 (not (= (+ c_~value~0 1) 0))) (.cse37 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse36 (< .cse32 1))) (let ((.cse12 (and (or .cse35 (< 0 .cse32)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse40 (* v_y_49 4294967296)) (.cse41 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse40 .cse41) 0) (< v_z_55 2147483649) (< .cse34 (+ v_z_55 .cse40 1 .cse41)) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse34 (+ v_z_55 2 .cse41)) (< (+ v_z_55 .cse41) 0) (< .cse34 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse42 (* v_y_53 4294967296)) (.cse43 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse34 v_z_53) (< (+ v_z_53 .cse42) 0) (< .cse34 (+ v_z_53 .cse42 2)) (not (= (select .cse37 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse34 (+ v_z_53 .cse42 .cse43 1)) (< (+ v_z_53 .cse42 .cse43) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse44 (* v_y_49 4294967296)) (.cse45 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse44 .cse45) 0) (= v_z_55 0) (< .cse34 (+ v_z_55 .cse44 1 .cse45)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse34 (+ v_z_55 2 .cse45)) (< (+ v_z_55 .cse45) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse46 (* v_y_53 4294967296)) (.cse47 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse46) 0) (< .cse34 (+ v_z_53 .cse46 2)) (< .cse34 (+ v_z_53 .cse46 .cse47 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse37 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse46 .cse47) 0))))) .cse36))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse39 (* v_y_30 4294967296))) (or (= .cse26 .cse39) (< (mod (+ .cse26 (* v_y_30 (- 4294967296)) 1) .cse34) 1) (< (+ 4294967295 .cse39) .cse26) (< .cse26 .cse39))))) (.cse16 (and (or .cse23 .cse5 .cse24 .cse25) (or .cse10 .cse11))) (.cse17 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (and (or (and (<= 1 .cse32) (<= .cse33 .cse34)) .cse35) (or .cse27 .cse36 (and (or (not (= c_~value~0 (select .cse37 (+ |c_~#buffer~0.offset| .cse38 (- 4294967296))))) (< .cse38 2147483648)) (or (< 2147483647 .cse38) (not (= c_~value~0 (select .cse37 (+ |c_~#buffer~0.offset| .cse38))))))))) (.cse29 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse28 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse31 0)) (.cse7 (< .cse31 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) (or .cse0 .cse16 .cse17) (or (let ((.cse21 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse19 (= .cse21 0)) (.cse20 (< .cse21 0))) (and (or .cse1 (and (or .cse18 .cse19 .cse2 .cse3 .cse5 .cse20 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse18 .cse13 .cse14 .cse19 .cse2 .cse3 .cse15 .cse20 .cse8)))) .cse0) (or .cse0 (and (or .cse1 .cse16) (or .cse22 .cse23 .cse13 .cse14 .cse24 .cse15 .cse25)) .cse17) (or .cse0 (and (or (and (or (< .cse26 1) .cse2 .cse27 .cse5 .cse24 .cse8) (or .cse22 .cse13 .cse10 .cse28 .cse15)) .cse29) (or .cse1 .cse10 .cse30 .cse11))) (or .cse0 .cse11) (or .cse0 (and (or .cse1 (and (or .cse5 .cse29) (or .cse10 .cse30 .cse11))) (or .cse22 .cse13 .cse14 .cse15 .cse29))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse24) (or .cse13 .cse10 .cse28 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11)))))))) is different from false [2024-08-26 19:33:03,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~first~0 4294967296))) (let ((.cse34 (+ .cse39 1)) (.cse35 (mod c_~buffer_size~0 4294967296)) (.cse33 (mod c_~next~0 4294967296)) (.cse16 (<= c_~value~0 6)) (.cse5 (= (mod c_~send~0 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (and .cse16 (<= 0 c_~value~0))) (.cse2 (< .cse35 (+ .cse33 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse26 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse32 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse28 (< .cse35 .cse34)) (.cse27 (mod (mod (+ c_~next~0 1) 4294967296) .cse35)) (.cse36 (not (= (+ c_~value~0 1) 0))) (.cse38 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse37 (< .cse33 1))) (let ((.cse12 (and (or .cse36 (< 0 .cse33)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse41 (* v_y_49 4294967296)) (.cse42 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse41 .cse42) 0) (< v_z_55 2147483649) (< .cse35 (+ v_z_55 .cse41 1 .cse42)) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse35 (+ v_z_55 2 .cse42)) (< (+ v_z_55 .cse42) 0) (< .cse35 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse43 (* v_y_53 4294967296)) (.cse44 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse35 v_z_53) (< (+ v_z_53 .cse43) 0) (< .cse35 (+ v_z_53 .cse43 2)) (not (= (select .cse38 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse35 (+ v_z_53 .cse43 .cse44 1)) (< (+ v_z_53 .cse43 .cse44) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse45 (* v_y_49 4294967296)) (.cse46 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse45 .cse46) 0) (= v_z_55 0) (< .cse35 (+ v_z_55 .cse45 1 .cse46)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse35 (+ v_z_55 2 .cse46)) (< (+ v_z_55 .cse46) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse47 (* v_y_53 4294967296)) (.cse48 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse47) 0) (< .cse35 (+ v_z_53 .cse47 2)) (< .cse35 (+ v_z_53 .cse47 .cse48 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse47 .cse48) 0))))) .cse37))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse40 (* v_y_30 4294967296))) (or (= .cse27 .cse40) (< (mod (+ .cse27 (* v_y_30 (- 4294967296)) 1) .cse35) 1) (< (+ 4294967295 .cse40) .cse27) (< .cse27 .cse40))))) (.cse31 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse25 (and (or (and (<= 1 .cse33) (<= .cse34 .cse35)) .cse36) (or .cse28 .cse37 (and (or (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39 (- 4294967296))))) (< .cse39 2147483648)) (or (< 2147483647 .cse39) (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39))))))))) (.cse30 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse29 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse32 0)) (.cse7 (< .cse32 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse21 (and (or .cse2 .cse8) (not (= .cse26 0)))) (.cse22 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse24 (or .cse10 .cse11))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) .cse16 (or (let ((.cse20 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse18 (= .cse20 0)) (.cse19 (< .cse20 0))) (and (or .cse1 (and (or .cse17 .cse18 .cse2 .cse3 .cse5 .cse19 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse17 .cse13 .cse14 .cse18 .cse2 .cse3 .cse15 .cse19 .cse8)))) .cse0) (or .cse0 (let ((.cse23 (< 0 .cse26))) (and (or .cse1 (and (or .cse21 .cse5 .cse22 .cse23) .cse24)) (or .cse25 .cse21 .cse13 .cse14 .cse22 .cse15 .cse23))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (<= 3 c_~value~0) (or .cse0 (and (or (and (or (< .cse27 1) .cse2 .cse28 .cse5 .cse22 .cse8) (or .cse25 .cse13 .cse10 .cse29 .cse15)) .cse30) (or .cse1 .cse10 .cse31 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse30) (or .cse10 .cse31 .cse11))) (or .cse25 .cse13 .cse14 .cse15 .cse30))) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse4 (and (or .cse5 .cse22) (or .cse13 .cse10 .cse29 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or .cse0 (and (or .cse21 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse5 .cse22 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse24))))))) is different from false [2024-08-26 19:33:04,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~first~0 4294967296))) (let ((.cse28 (mod c_~next~0 4294967296)) (.cse30 (mod c_~buffer_size~0 4294967296)) (.cse29 (+ .cse34 1))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse14 (= (mod c_~receive~0 256) 0)) (.cse27 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse21 (< .cse30 .cse29)) (.cse20 (mod (mod (+ c_~next~0 1) 4294967296) .cse30)) (.cse31 (not (= (+ c_~value~0 1) 0))) (.cse33 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse32 (< .cse28 1))) (let ((.cse12 (and (or .cse31 (< 0 .cse28)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse36 (* v_y_49 4294967296)) (.cse37 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse36 .cse37) 0) (< v_z_55 2147483649) (< .cse30 (+ v_z_55 .cse36 1 .cse37)) (not (= c_~value~0 (select .cse33 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse30 (+ v_z_55 2 .cse37)) (< (+ v_z_55 .cse37) 0) (< .cse30 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse38 (* v_y_53 4294967296)) (.cse39 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse30 v_z_53) (< (+ v_z_53 .cse38) 0) (< .cse30 (+ v_z_53 .cse38 2)) (not (= (select .cse33 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse30 (+ v_z_53 .cse38 .cse39 1)) (< (+ v_z_53 .cse38 .cse39) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse40 (* v_y_49 4294967296)) (.cse41 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse40 .cse41) 0) (= v_z_55 0) (< .cse30 (+ v_z_55 .cse40 1 .cse41)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse33 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse30 (+ v_z_55 2 .cse41)) (< (+ v_z_55 .cse41) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse42 (* v_y_53 4294967296)) (.cse43 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse42) 0) (< .cse30 (+ v_z_53 .cse42 2)) (< .cse30 (+ v_z_53 .cse42 .cse43 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse33 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse42 .cse43) 0))))) .cse32))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse35 (* v_y_30 4294967296))) (or (= .cse20 .cse35) (< (mod (+ .cse20 (* v_y_30 (- 4294967296)) 1) .cse30) 1) (< (+ 4294967295 .cse35) .cse20) (< .cse20 .cse35))))) (.cse2 (< .cse30 (+ .cse28 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse26 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse23 (and (or (and (<= 1 .cse28) (<= .cse29 .cse30)) .cse31) (or .cse21 .cse32 (and (or (not (= c_~value~0 (select .cse33 (+ |c_~#buffer~0.offset| .cse34 (- 4294967296))))) (< .cse34 2147483648)) (or (< 2147483647 .cse34) (not (= c_~value~0 (select .cse33 (+ |c_~#buffer~0.offset| .cse34))))))))) (.cse25 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse22 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse24 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse27 0)) (.cse7 (< .cse27 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) (or (let ((.cse19 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse16 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse17 (= .cse19 0)) (.cse18 (< .cse19 0))) (and (or .cse1 (and (or .cse16 .cse17 .cse2 .cse3 .cse5 .cse18 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse16 .cse13 .cse14 .cse17 .cse2 .cse3 .cse15 .cse18 .cse8)))) .cse0) (or .cse0 (and (or (and (or (< .cse20 1) .cse2 .cse21 .cse5 .cse22 .cse8) (or .cse23 .cse13 .cse10 .cse24 .cse15)) .cse25) (or .cse1 .cse10 .cse26 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse25) (or .cse10 .cse26 .cse11))) (or .cse23 .cse13 .cse14 .cse15 .cse25))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse22) (or .cse13 .cse10 .cse24 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11)))))))) is different from false [2024-08-26 19:33:13,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-08-26 19:33:13,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~first~0 4294967296)) (.cse35 (mod c_~buffer_size~0 4294967296)) (.cse33 (mod c_~next~0 4294967296))) (let ((.cse31 (<= 0 c_~value~0)) (.cse5 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse35 (+ .cse33 1))) (.cse8 (< c_~buffer_size~0 1)) (.cse49 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse34 (+ .cse39 1))) (let ((.cse14 (= (mod c_~receive~0 256) 0)) (.cse32 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse27 (< .cse35 .cse34)) (.cse23 (and (or .cse2 .cse8) (not (= .cse49 0)))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse25 (< 0 .cse49)) (.cse10 (not .cse5)) (.cse11 (and (<= c_~value~0 6) .cse31)) (.cse26 (mod (mod (+ c_~next~0 1) 4294967296) .cse35)) (.cse36 (not (= (+ c_~value~0 1) 0))) (.cse38 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse37 (< .cse33 1))) (let ((.cse12 (and (or .cse36 (< 0 .cse33)) (or (and (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse41 (* v_y_49 4294967296)) (.cse42 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse41 .cse42) 0) (< v_z_55 2147483649) (< .cse35 (+ v_z_55 .cse41 1 .cse42)) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| v_z_55 (- 4294967297))))) (< .cse35 (+ v_z_55 2 .cse42)) (< (+ v_z_55 .cse42) 0) (< .cse35 v_z_55)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse43 (* v_y_53 4294967296)) (.cse44 (* v_y_49 4294967296))) (or (< v_z_53 2147483649) (< .cse35 v_z_53) (< (+ v_z_53 .cse43) 0) (< .cse35 (+ v_z_53 .cse43 2)) (not (= (select .cse38 (+ |~#buffer~0.offset| v_z_53 (- 4294967297))) c_~value~0)) (< .cse35 (+ v_z_53 .cse43 .cse44 1)) (< (+ v_z_53 .cse43 .cse44) 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_55 Int) (v_y_55 Int)) (let ((.cse45 (* v_y_49 4294967296)) (.cse46 (* v_y_55 4294967296))) (or (< (+ v_z_55 .cse45 .cse46) 0) (= v_z_55 0) (< .cse35 (+ v_z_55 .cse45 1 .cse46)) (< 2147483648 v_z_55) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_55)))) (< .cse35 (+ v_z_55 2 .cse46)) (< (+ v_z_55 .cse46) 0) (< v_z_55 0)))) (forall ((|~#buffer~0.offset| Int) (v_y_49 Int) (v_z_53 Int) (v_y_53 Int)) (let ((.cse47 (* v_y_53 4294967296)) (.cse48 (* v_y_49 4294967296))) (or (< (+ v_z_53 .cse47) 0) (< .cse35 (+ v_z_53 .cse47 2)) (< .cse35 (+ v_z_53 .cse47 .cse48 1)) (< v_z_53 0) (< 2147483648 v_z_53) (not (= c_~value~0 (select .cse38 (+ |~#buffer~0.offset| (- 1) v_z_53)))) (= v_z_53 0) (< (+ v_z_53 .cse47 .cse48) 0))))) .cse37))) (.cse3 (forall ((v_y_30 Int)) (let ((.cse40 (* v_y_30 4294967296))) (or (= .cse26 .cse40) (< (mod (+ .cse26 (* v_y_30 (- 4294967296)) 1) .cse35) 1) (< (+ 4294967295 .cse40) .cse26) (< .cse26 .cse40))))) (.cse16 (and (or .cse23 .cse5 .cse24 .cse25) (or .cse10 .cse11))) (.cse17 (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (and (or (and (<= 1 .cse33) (<= .cse34 .cse35)) .cse36) (or .cse27 .cse37 (and (or (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39 (- 4294967296))))) (< .cse39 2147483648)) (or (< 2147483647 .cse39) (not (= c_~value~0 (select .cse38 (+ |c_~#buffer~0.offset| .cse39))))))))) (.cse29 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse4 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse28 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse15 (< 2147483647 c_~value~0)) (.cse6 (= .cse32 0)) (.cse7 (< .cse32 0)) (.cse1 (not .cse14)) (.cse9 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11))) (or .cse12 .cse13 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8))) (or .cse0 .cse16 .cse17) (or (let ((.cse21 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse18 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse19 (= .cse21 0)) (.cse20 (< .cse21 0))) (and (or .cse1 (and (or .cse18 .cse19 .cse2 .cse3 .cse5 .cse20 .cse8) (or .cse10 .cse11 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse18 .cse13 .cse14 .cse19 .cse2 .cse3 .cse15 .cse20 .cse8)))) .cse0) (or .cse0 (and (or .cse1 .cse16) (or .cse22 .cse23 .cse13 .cse14 .cse24 .cse15 .cse25)) .cse17) (or .cse0 (and (or (and (or (< .cse26 1) .cse2 .cse27 .cse5 .cse24 .cse8) (or .cse22 .cse13 .cse10 .cse28 .cse15)) .cse29) (or .cse1 .cse10 .cse30 .cse11))) (or .cse0 (and (or .cse1 (and (or .cse5 .cse29) (or .cse10 .cse30 .cse11))) (or .cse22 .cse13 .cse14 .cse15 .cse29))) (or .cse0 (and (or .cse4 (and (or .cse5 .cse24) (or .cse13 .cse10 .cse28 .cse15)) .cse6 .cse7) (or .cse1 .cse9 .cse10 .cse11))) (or (and .cse31 (<= c_~value~0 1)) (= c_~value~0 2) (= c_~value~0 3))))))) is different from false [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-26 19:33:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:33:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-26 19:33:15,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-08-26 19:33:15,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-26 19:33:15,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-08-26 19:33:15,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-08-26 19:33:15,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-26 19:33:15,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-26 19:33:15,449 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2024-08-26 19:33:15,451 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-26 19:33:15,451 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-26 19:33:15,453 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-08-26 19:33:15,453 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-08-26 19:33:15,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:33:15 BasicIcfg [2024-08-26 19:33:15,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-26 19:33:15,454 INFO L158 Benchmark]: Toolchain (without parser) took 150446.44ms. Allocated memory was 180.4MB in the beginning and 616.6MB in the end (delta: 436.2MB). Free memory was 120.7MB in the beginning and 224.0MB in the end (delta: -103.2MB). Peak memory consumption was 334.8MB. Max. memory is 16.1GB. [2024-08-26 19:33:15,455 INFO L158 Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 180.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-26 19:33:15,455 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-26 19:33:15,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.97ms. Allocated memory is still 180.4MB. Free memory was 120.7MB in the beginning and 91.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-08-26 19:33:15,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 180.4MB. Free memory was 91.3MB in the beginning and 88.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-26 19:33:15,456 INFO L158 Benchmark]: Boogie Preprocessor took 27.12ms. Allocated memory is still 180.4MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-26 19:33:15,456 INFO L158 Benchmark]: RCFGBuilder took 747.87ms. Allocated memory was 180.4MB in the beginning and 245.4MB in the end (delta: 65.0MB). Free memory was 87.2MB in the beginning and 197.5MB in the end (delta: -110.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2024-08-26 19:33:15,456 INFO L158 Benchmark]: TraceAbstraction took 149074.22ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 196.5MB in the beginning and 224.0MB in the end (delta: -27.5MB). Peak memory consumption was 343.7MB. Max. memory is 16.1GB. [2024-08-26 19:33:15,457 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.23ms. Allocated memory is still 180.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.97ms. Allocated memory is still 180.4MB. Free memory was 120.7MB in the beginning and 91.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 180.4MB. Free memory was 91.3MB in the beginning and 88.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.12ms. Allocated memory is still 180.4MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 747.87ms. Allocated memory was 180.4MB in the beginning and 245.4MB in the end (delta: 65.0MB). Free memory was 87.2MB in the beginning and 197.5MB in the end (delta: -110.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * TraceAbstraction took 149074.22ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 196.5MB in the beginning and 224.0MB in the end (delta: -27.5MB). Peak memory consumption was 343.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26469, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 2326, dependent conditional: 2314, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24347, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 204, dependent conditional: 192, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24347, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 204, dependent conditional: 192, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 3350, dependent unconditional: 1470, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 1395, dependent unconditional: 3425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 1395, dependent unconditional: 3425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 457, independent: 404, independent conditional: 53, independent unconditional: 351, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 457, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 57, independent conditional: 53, independent unconditional: 4, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 57, independent conditional: 53, independent unconditional: 4, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 787, independent: 377, independent conditional: 337, independent unconditional: 40, dependent: 410, dependent conditional: 282, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 28963, independent: 23739, independent conditional: 1213, independent unconditional: 22526, dependent: 4767, dependent conditional: 1356, dependent unconditional: 3411, unknown: 457, unknown conditional: 92, unknown unconditional: 365] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 404, Positive conditional cache size: 53, Positive unconditional cache size: 351, Negative cache size: 53, Negative conditional cache size: 39, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1955, Maximal queried relation: 8, Independence queries for same thread: 2122 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 80, Number of trivial persistent sets: 68, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 408, independent: 396, independent conditional: 0, independent unconditional: 396, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26469, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 2326, dependent conditional: 2314, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24347, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 204, dependent conditional: 192, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24347, independent: 24143, independent conditional: 23747, independent unconditional: 396, dependent: 204, dependent conditional: 192, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 3350, dependent unconditional: 1470, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 1395, dependent unconditional: 3425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28963, independent: 24143, independent conditional: 1266, independent unconditional: 22877, dependent: 4820, dependent conditional: 1395, dependent unconditional: 3425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 457, independent: 404, independent conditional: 53, independent unconditional: 351, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 457, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 57, independent conditional: 53, independent unconditional: 4, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 57, independent conditional: 53, independent unconditional: 4, dependent: 53, dependent conditional: 39, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 787, independent: 377, independent conditional: 337, independent unconditional: 40, dependent: 410, dependent conditional: 282, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 28963, independent: 23739, independent conditional: 1213, independent unconditional: 22526, dependent: 4767, dependent conditional: 1356, dependent unconditional: 3411, unknown: 457, unknown conditional: 92, unknown unconditional: 365] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 404, Positive conditional cache size: 53, Positive unconditional cache size: 351, Negative cache size: 53, Negative conditional cache size: 39, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1955, Maximal queried relation: 8, Independence queries for same thread: 2122 - PositiveResult [Line: 764]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 765]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 148.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 67.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 23.7s SatisfiabilityAnalysisTime, 55.7s InterpolantComputationTime, 712 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 822 ConstructedInterpolants, 74 QuantifiedInterpolants, 23867 SizeOfPredicates, 108 NumberOfNonLiveVariables, 2020 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 1246/1729 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-08-26 19:33:15,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-08-26 19:33:15,872 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-08-26 19:33:15,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE