./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c --full-output --validate ./goblint.2024-08-08_07-59-58.files/protection-ghost/unroll-cond-3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee 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/weaver/unroll-cond-3.wvr.c ./goblint.2024-08-08_07-59-58.files/protection-ghost/unroll-cond-3.wvr.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 03:56:25,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 03:56:25,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 03:56:25,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 03:56:25,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 03:56:25,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 03:56:25,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 03:56:25,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 03:56:25,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 03:56:25,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 03:56:25,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 03:56:25,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 03:56:25,335 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 03:56:25,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 03:56:25,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 03:56:25,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 03:56:25,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 03:56:25,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 03:56:25,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 03:56:25,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 03:56:25,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 03:56:25,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 03:56:25,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 03:56:25,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 03:56:25,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 03:56:25,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 03:56:25,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 03:56:25,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 03:56:25,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 03:56:25,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 03:56:25,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 03:56:25,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 03:56:25,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 03:56:25,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 03:56:25,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 03:56:25,348 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 03:56:25,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 03:56:25,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 03:56:25,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 03:56:25,349 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 03:56:25,349 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 03:56:25,350 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 03:56:25,350 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 [2024-08-14 03:56:25,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 03:56:25,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 03:56:25,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 03:56:25,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 03:56:25,609 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 03:56:25,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2024-08-14 03:56:27,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 03:56:27,213 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 03:56:27,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2024-08-14 03:56:27,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5efc89bf8/17320093db524c328a382657f347f308/FLAGb492383a2 [2024-08-14 03:56:27,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5efc89bf8/17320093db524c328a382657f347f308 [2024-08-14 03:56:27,235 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 03:56:27,236 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 03:56:27,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-ghost/unroll-cond-3.wvr.yml/witness.yml [2024-08-14 03:56:27,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 03:56:27,314 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 03:56:27,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 03:56:27,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 03:56:27,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 03:56:27,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 03:56:27" (1/2) ... [2024-08-14 03:56:27,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132aed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 03:56:27, skipping insertion in model container [2024-08-14 03:56:27,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 03:56:27" (1/2) ... [2024-08-14 03:56:27,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@352a286a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 03:56:27, skipping insertion in model container [2024-08-14 03:56:27,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 03:56:27" (2/2) ... [2024-08-14 03:56:27,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132aed5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27, skipping insertion in model container [2024-08-14 03:56:27,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 03:56:27" (2/2) ... [2024-08-14 03:56:27,325 INFO L81 nessWitnessExtractor]: Only extracting loop invariants from correctness witness [2024-08-14 03:56:27,338 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 03:56:27,339 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-14 03:56:27,339 INFO L106 edCorrectnessWitness]: ghost_update [L93-L93] multithreaded = 1; [2024-08-14 03:56:27,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 03:56:27,523 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2667,2680] [2024-08-14 03:56:27,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 03:56:27,543 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local [2024-08-14 03:56:27,598 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2667,2680] [2024-08-14 03:56:27,620 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 03:56:27,640 INFO L206 MainTranslator]: Completed translation [2024-08-14 03:56:27,640 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27 WrapperNode [2024-08-14 03:56:27,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 03:56:27,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 03:56:27,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 03:56:27,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 03:56:27,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,685 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 158 [2024-08-14 03:56:27,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 03:56:27,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 03:56:27,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 03:56:27,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 03:56:27,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 03:56:27,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 03:56:27,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 03:56:27,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 03:56:27,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (1/1) ... [2024-08-14 03:56:27,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 03:56:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 03:56:27,757 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-14 03:56:27,760 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-14 03:56:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 03:56:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-08-14 03:56:27,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-08-14 03:56:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-08-14 03:56:27,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-08-14 03:56:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 03:56:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-14 03:56:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-08-14 03:56:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 03:56:27,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 03:56:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-14 03:56:27,787 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 03:56:27,871 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 03:56:27,873 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 03:56:28,135 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 03:56:28,136 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 03:56:28,405 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 03:56:28,405 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-14 03:56:28,406 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 03:56:28 BoogieIcfgContainer [2024-08-14 03:56:28,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 03:56:28,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 03:56:28,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 03:56:28,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 03:56:28,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 03:56:27" (1/4) ... [2024-08-14 03:56:28,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2006784d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 03:56:28, skipping insertion in model container [2024-08-14 03:56:28,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 03:56:27" (2/4) ... [2024-08-14 03:56:28,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2006784d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 03:56:28, skipping insertion in model container [2024-08-14 03:56:28,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 03:56:27" (3/4) ... [2024-08-14 03:56:28,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2006784d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 03:56:28, skipping insertion in model container [2024-08-14 03:56:28,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 03:56:28" (4/4) ... [2024-08-14 03:56:28,419 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2024-08-14 03:56:28,440 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 03:56:28,440 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 03:56:28,440 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 03:56:28,488 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-08-14 03:56:28,530 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 03:56:28,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 03:56:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 03:56:28,532 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-14 03:56:28,533 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-14 03:56:28,565 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 03:56:28,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 03:56:28,583 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;@692c0d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 03:56:28,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-14 03:56:28,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 03:56:28,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 03:56:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1772876627, now seen corresponding path program 1 times [2024-08-14 03:56:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 03:56:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215692817] [2024-08-14 03:56:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 03:56:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-14 03:56:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 03:56:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215692817] [2024-08-14 03:56:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215692817] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 03:56:29,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 03:56:29,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 03:56:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045943665] [2024-08-14 03:56:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 03:56:29,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 03:56:29,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 03:56:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 03:56:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 03:56:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:29,218 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 03:56:29,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-14 03:56:29,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:29,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 03:56:29,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 03:56:29,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 03:56:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1449501804, now seen corresponding path program 1 times [2024-08-14 03:56:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 03:56:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150430082] [2024-08-14 03:56:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 03:56:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-14 03:56:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 03:56:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150430082] [2024-08-14 03:56:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150430082] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 03:56:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018873405] [2024-08-14 03:56:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 03:56:29,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 03:56:29,801 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-14 03:56:29,803 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-14 03:56:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:29,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-14 03:56:29,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 03:56:29,984 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 15 treesize of output 1 [2024-08-14 03:56:30,486 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-08-14 03:56:30,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 104 [2024-08-14 03:56:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 03:56:30,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 03:56:32,209 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 87 treesize of output 77 [2024-08-14 03:56:32,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 03:56:32,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 217 [2024-08-14 03:56:33,934 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 33 treesize of output 29 [2024-08-14 03:56:33,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 03:56:33,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2024-08-14 03:56:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 03:56:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018873405] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 03:56:33,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 03:56:33,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2024-08-14 03:56:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864387780] [2024-08-14 03:56:34,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 03:56:34,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-14 03:56:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 03:56:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-14 03:56:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-08-14 03:56:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:34,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 03:56:34,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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-14 03:56:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:34,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 03:56:34,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 03:56:34,700 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,SelfDestructingSolverStorable1 [2024-08-14 03:56:34,701 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 03:56:34,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 03:56:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -949835600, now seen corresponding path program 1 times [2024-08-14 03:56:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 03:56:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526973725] [2024-08-14 03:56:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 03:56:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 03:56:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526973725] [2024-08-14 03:56:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526973725] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 03:56:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601692793] [2024-08-14 03:56:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 03:56:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 03:56:34,969 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-14 03:56:34,972 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-14 03:56:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:35,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 03:56:35,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 03:56:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:35,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 03:56:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:35,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601692793] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 03:56:35,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 03:56:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2024-08-14 03:56:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765586719] [2024-08-14 03:56:35,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 03:56:35,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-14 03:56:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 03:56:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-14 03:56:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-08-14 03:56:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:35,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 03:56:35,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-14 03:56:35,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:35,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-14 03:56:35,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:38,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 03:56:41,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 03:56:43,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 03:56:44,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 03:56:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 03:56:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-14 03:56:45,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-14 03:56:45,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 03:56:45,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 03:56:45,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 03:56:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -565392153, now seen corresponding path program 2 times [2024-08-14 03:56:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 03:56:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290021059] [2024-08-14 03:56:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 03:56:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 03:56:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 03:56:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 03:56:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290021059] [2024-08-14 03:56:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290021059] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 03:56:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916040606] [2024-08-14 03:56:46,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 03:56:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 03:56:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 03:56:46,338 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-14 03:56:46,340 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-14 03:56:46,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 03:56:46,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 03:56:46,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjunts are in the unsatisfiable core [2024-08-14 03:56:46,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 03:56:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:46,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 03:56:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 03:56:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916040606] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 03:56:47,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 03:56:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2024-08-14 03:56:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836585351] [2024-08-14 03:56:47,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 03:56:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-14 03:56:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 03:56:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-14 03:56:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2024-08-14 03:56:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:56:47,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 03:56:47,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 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-14 03:56:47,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 03:56:47,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-14 03:56:47,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-08-14 03:56:47,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 03:57:14,666 WARN L293 SmtUtils]: Spent 26.03s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 03:58:11,516 WARN L293 SmtUtils]: Spent 52.54s on a formula simplification. DAG size of input: 85 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 03:59:07,311 WARN L293 SmtUtils]: Spent 50.45s on a formula simplification. DAG size of input: 93 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:00:31,655 WARN L293 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:01:36,049 WARN L293 SmtUtils]: Spent 56.45s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:03:27,693 WARN L293 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 90 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:03:47,796 WARN L293 SmtUtils]: Spent 14.25s on a formula simplification. DAG size of input: 85 DAG size of output: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:03:49,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse4 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse16 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse10 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296))) (let ((.cse5 (+ .cse0 4294967294)) (.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse6 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse13 (+ 4294967294 .cse10)) (.cse9 (+ .cse16 1)) (.cse12 (+ 3 .cse4)) (.cse1 (+ 3 .cse8)) (.cse2 (+ .cse7 1)) (.cse11 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse15 (+ 3 .cse7)) (.cse14 (+ .cse4 1))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (<= .cse4 .cse5) (or (< (+ (* 4294967296 (div c_~n~0 4294967296)) 6 |c_thread1Thread1of1ForFork1_~i~0#1|) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (< (+ (* (div (+ 4294967294 c_~n~0) 4294967296) 4294967296) |c_thread2Thread1of1ForFork0_~i~1#1|) (+ (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) c_~n~0 8))) (< .cse6 (mod c_~n~0 4294967296)) (<= .cse7 (+ 4294967294 .cse3)) (<= .cse8 (+ 4294967294 .cse6)) (or (< .cse9 .cse10) (< .cse11 .cse12)) (<= .cse4 .cse13) (<= .cse7 .cse5) (or (< .cse3 (+ 3 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< (+ .cse8 1) .cse6)) (or (< .cse14 .cse0) (< .cse10 .cse15)) (<= .cse16 (+ .cse11 4294967294)) (<= .cse16 .cse13) (or (< .cse9 .cse11) (< (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) .cse12)) (or (< .cse10 .cse1) (< .cse2 .cse0)) (or (< .cse11 .cse15) (< .cse14 .cse10))))) is different from false [2024-08-14 04:04:27,865 WARN L293 SmtUtils]: Spent 35.43s on a formula simplification. DAG size of input: 73 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:04:36,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:44,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:46,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:49,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:51,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:52,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:54,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:56,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:04:59,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:08,366 WARN L293 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 56 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:05:11,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:13,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:15,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:20,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:25,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:05:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:05:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 04:05:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-14 04:05:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-14 04:05:25,495 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-14 04:05:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 04:05:25,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 04:05:25,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:05:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 243086741, now seen corresponding path program 3 times [2024-08-14 04:05:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:05:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60954441] [2024-08-14 04:05:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:05:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:05:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:05:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 04:05:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:05:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60954441] [2024-08-14 04:05:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60954441] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 04:05:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179944913] [2024-08-14 04:05:26,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 04:05:26,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 04:05:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 04:05:26,897 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-14 04:05:26,898 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-14 04:05:28,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-08-14 04:05:28,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 04:05:28,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 50 conjunts are in the unsatisfiable core [2024-08-14 04:05:28,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 04:05:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 04:05:28,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 04:05:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 04:05:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179944913] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 04:05:31,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 04:05:31,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 55 [2024-08-14 04:05:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527814456] [2024-08-14 04:05:31,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 04:05:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-08-14 04:05:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:05:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-08-14 04:05:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2327, Unknown=0, NotChecked=0, Total=2970 [2024-08-14 04:05:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:05:31,389 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:05:31,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-14 04:05:31,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:05:31,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-14 04:05:31,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-08-14 04:05:31,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-08-14 04:05:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:05:53,708 WARN L293 SmtUtils]: Spent 18.94s on a formula simplification. DAG size of input: 183 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:06:15,673 WARN L293 SmtUtils]: Spent 16.57s on a formula simplification. DAG size of input: 182 DAG size of output: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:06:17,700 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse38 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse43 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse27 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse40 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse16 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse10 (+ 4294967294 .cse16)) (.cse15 (+ .cse9 1)) (.cse14 (+ 3 .cse5)) (.cse12 (+ 4294967294 .cse25)) (.cse30 (+ .cse40 4294967294)) (.cse19 (+ .cse27 4294967294)) (.cse34 (+ .cse18 1)) (.cse36 (+ .cse7 3)) (.cse20 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse33 (+ .cse11 1)) (.cse32 (+ 3 .cse26)) (.cse39 (+ 3 .cse9)) (.cse37 (+ .cse23 1)) (.cse17 (+ .cse13 4294967294)) (.cse2 (+ .cse7 1)) (.cse41 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse43 3)) (.cse8 (+ .cse3 4294967294)) (.cse42 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse31 (+ .cse38 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse28 (+ .cse11 3)) (.cse29 (+ .cse43 1)) (.cse45 (+ .cse26 1)) (.cse44 (+ .cse23 3)) (.cse22 (+ .cse0 1)) (.cse35 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse21 (+ 3 .cse18)) (.cse6 (+ 4294967294 .cse24))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse10) (<= .cse11 .cse12) (or (< .cse13 .cse14) (< .cse15 .cse16)) (<= .cse11 .cse17) (<= .cse18 .cse19) (or (< .cse20 .cse21) (< .cse22 .cse1)) (<= .cse23 .cse10) (or (< .cse15 .cse24) (< .cse25 .cse14)) (<= .cse26 .cse12) (or (< .cse27 .cse28) (< .cse29 .cse13)) (<= .cse18 .cse30) (<= .cse26 .cse31) (<= .cse7 .cse30) (or (< .cse27 .cse32) (< .cse33 .cse13)) (or (< .cse34 .cse27) (< .cse35 .cse36)) (<= .cse0 .cse19) (or (< .cse37 .cse38) (< .cse3 .cse39)) (or (< .cse34 .cse40) (< .cse41 .cse36)) (or (< .cse20 30) (< 31 .cse1)) (or (< .cse25 (+ 3 .cse42)) (< (+ .cse5 1) .cse24)) (or (< .cse33 .cse25) (< .cse40 .cse32)) (or (< .cse13 .cse39) (< .cse37 .cse16)) (<= .cse43 .cse17) (or (< .cse2 .cse40) (< .cse41 .cse4)) (<= .cse43 .cse8) (or (< .cse3 .cse44) (< .cse45 .cse38)) (let ((.cse46 (mod (+ 4294967294 c_~n~0) 4294967296))) (or (< .cse38 (mod c_~n~0 4294967296)) (< .cse5 .cse46) (< .cse46 (+ .cse42 1)))) (<= .cse23 .cse31) (or (< .cse1 .cse28) (< .cse29 .cse3)) (or (< .cse45 .cse25) (< .cse40 .cse44)) (or (< .cse22 .cse27) (< .cse35 .cse21)) (<= .cse9 .cse6)))) is different from false [2024-08-14 04:06:19,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse42 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse34 (mod c_~n~0 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse50 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse47 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse27 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse44 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse16 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse10 (+ 4294967294 .cse16)) (.cse15 (+ .cse9 1)) (.cse14 (+ 3 .cse5)) (.cse12 (+ 4294967294 .cse25)) (.cse33 (+ .cse44 4294967294)) (.cse19 (+ .cse27 4294967294)) (.cse38 (+ .cse18 1)) (.cse40 (+ .cse7 3)) (.cse20 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse37 (+ .cse11 1)) (.cse36 (+ 3 .cse26)) (.cse43 (+ 3 .cse9)) (.cse41 (+ .cse23 1)) (.cse17 (+ .cse13 4294967294)) (.cse2 (+ .cse7 1)) (.cse45 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse47 3)) (.cse8 (+ .cse3 4294967294)) (.cse31 (< .cse50 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1))) (.cse32 (< .cse46 .cse50)) (.cse30 (< .cse42 .cse34)) (.cse35 (+ .cse42 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse28 (+ .cse11 3)) (.cse29 (+ .cse47 1)) (.cse49 (+ .cse26 1)) (.cse48 (+ .cse23 3)) (.cse22 (+ .cse0 1)) (.cse39 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse21 (+ 3 .cse18)) (.cse6 (+ 4294967294 .cse24))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse10) (<= .cse11 .cse12) (or (< .cse13 .cse14) (< .cse15 .cse16)) (<= .cse11 .cse17) (<= .cse18 .cse19) (or (< .cse20 .cse21) (< .cse22 .cse1)) (<= .cse23 .cse10) (or (< .cse15 .cse24) (< .cse25 .cse14)) (<= .cse26 .cse12) (or (< .cse27 .cse28) (< .cse29 .cse13)) (or .cse30 .cse31 .cse32) (<= .cse18 .cse33) (< .cse24 .cse34) (<= .cse26 .cse35) (<= .cse7 .cse33) (or (< .cse27 .cse36) (< .cse37 .cse13)) (or (< .cse38 .cse27) (< .cse39 .cse40)) (<= .cse0 .cse19) (or (< .cse41 .cse42) (< .cse3 .cse43)) (or (< .cse38 .cse44) (< .cse45 .cse40)) (or (< .cse20 30) (< 31 .cse1)) (or (< .cse25 (+ 3 .cse46)) (< (+ .cse5 1) .cse24)) (or (< .cse37 .cse25) (< .cse44 .cse36)) (or (< .cse13 .cse43) (< .cse41 .cse16)) (<= .cse47 .cse17) (or (< .cse2 .cse44) (< .cse45 .cse4)) (<= .cse47 .cse8) (or (< .cse3 .cse48) (< .cse49 .cse42)) (or .cse31 (< .cse16 .cse34) .cse32) (or .cse30 (< .cse5 .cse50) (< .cse50 (+ .cse46 1))) (<= .cse23 .cse35) (or (< .cse1 .cse28) (< .cse29 .cse3)) (or (< .cse49 .cse25) (< .cse44 .cse48)) (or (< .cse22 .cse27) (< .cse39 .cse21)) (<= .cse9 .cse6)))) is different from false [2024-08-14 04:06:21,956 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse43 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse47 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse49 (mod c_~n~0 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse53 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (.cse52 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse15 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse25 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse28 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse29 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse45 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse27 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse18 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse12 (+ 4294967294 .cse18)) (.cse17 (+ .cse11 1)) (.cse16 (+ 3 .cse5)) (.cse14 (+ 4294967294 .cse27)) (.cse35 (+ .cse45 4294967294)) (.cse21 (+ .cse29 4294967294)) (.cse39 (+ .cse20 1)) (.cse41 (+ .cse9 3)) (.cse22 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse38 (+ .cse13 1)) (.cse37 (+ 3 .cse28)) (.cse44 (+ 3 .cse11)) (.cse42 (+ .cse25 1)) (.cse19 (+ .cse15 4294967294)) (.cse2 (+ .cse9 1)) (.cse46 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse48 3)) (.cse7 (< .cse53 .cse52)) (.cse10 (+ .cse3 4294967294)) (.cse33 (< .cse52 (+ .cse53 1))) (.cse8 (< .cse18 .cse49)) (.cse34 (< .cse47 .cse52)) (.cse32 (< .cse43 .cse49)) (.cse36 (+ .cse43 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse30 (+ .cse13 3)) (.cse31 (+ .cse48 1)) (.cse51 (+ .cse28 1)) (.cse50 (+ .cse25 3)) (.cse24 (+ .cse0 1)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse23 (+ 3 .cse20)) (.cse6 (+ 4294967294 .cse26))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (or .cse7 .cse8) (<= .cse9 .cse10) (<= .cse11 .cse12) (<= .cse13 .cse14) (or (< .cse15 .cse16) (< .cse17 .cse18)) (<= .cse13 .cse19) (<= .cse20 .cse21) (or (< .cse22 .cse23) (< .cse24 .cse1)) (<= .cse25 .cse12) (or (< .cse17 .cse26) (< .cse27 .cse16)) (<= .cse28 .cse14) (or (< .cse29 .cse30) (< .cse31 .cse15)) (or .cse32 .cse33 .cse34) (<= .cse20 .cse35) (<= .cse28 .cse36) (<= .cse9 .cse35) (or (< .cse29 .cse37) (< .cse38 .cse15)) (or (< .cse39 .cse29) (< .cse40 .cse41)) (<= .cse0 .cse21) (or (< .cse42 .cse43) (< .cse3 .cse44)) (or (< .cse39 .cse45) (< .cse46 .cse41)) (or (< .cse22 30) (< 31 .cse1)) (or (< .cse27 (+ 3 .cse47)) (< (+ .cse5 1) .cse26)) (or (< .cse38 .cse27) (< .cse45 .cse37)) (or (< .cse15 .cse44) (< .cse42 .cse18)) (<= .cse48 .cse19) (or (< .cse2 .cse45) (< .cse46 .cse4)) (or .cse7 (< .cse26 .cse49)) (<= .cse48 .cse10) (or (< .cse3 .cse50) (< .cse51 .cse43)) (or .cse33 .cse8 .cse34) (or .cse32 (< .cse5 .cse52) (< .cse52 (+ .cse47 1))) (<= .cse25 .cse36) (or (< .cse1 .cse30) (< .cse31 .cse3)) (or (< .cse51 .cse27) (< .cse45 .cse50)) (or (< .cse24 .cse29) (< .cse40 .cse23)) (<= .cse11 .cse6)))) is different from false [2024-08-14 04:06:24,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse27 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse45 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse37 (mod c_~n~0 4294967296)) (.cse8 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse7 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse50 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse16 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse14 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse30 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse47 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse28 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse19 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse13 (+ 4294967294 .cse19)) (.cse18 (+ .cse12 1)) (.cse17 (+ 3 .cse5)) (.cse15 (+ 4294967294 .cse28)) (.cse36 (+ .cse47 4294967294)) (.cse22 (+ .cse30 4294967294)) (.cse41 (+ .cse21 1)) (.cse43 (+ .cse10 3)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse40 (+ .cse14 1)) (.cse39 (+ 3 .cse29)) (.cse46 (+ 3 .cse12)) (.cse44 (+ .cse26 1)) (.cse20 (+ .cse16 4294967294)) (.cse2 (+ .cse10 1)) (.cse48 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse50 3)) (.cse11 (+ .cse3 4294967294)) (.cse34 (< .cse8 (+ .cse7 1))) (.cse9 (< .cse19 .cse37)) (.cse35 (< .cse49 .cse8)) (.cse33 (< .cse45 .cse37)) (.cse38 (+ .cse45 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse31 (+ .cse14 3)) (.cse32 (+ .cse50 1)) (.cse52 (+ .cse29 1)) (.cse51 (+ .cse26 3)) (.cse25 (+ .cse0 1)) (.cse42 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse24 (+ 3 .cse21)) (.cse6 (+ 4294967294 .cse27))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (or (< .cse7 .cse8) .cse9) (<= .cse10 .cse11) (<= .cse12 .cse13) (<= .cse14 .cse15) (or (< .cse16 .cse17) (< .cse18 .cse19)) (<= .cse14 .cse20) (<= .cse21 .cse22) (or (< .cse23 .cse24) (< .cse25 .cse1)) (<= .cse26 .cse13) (or (< .cse18 .cse27) (< .cse28 .cse17)) (<= .cse29 .cse15) (or (< .cse30 .cse31) (< .cse32 .cse16)) (or .cse33 .cse34 .cse35) (<= .cse21 .cse36) (< .cse27 .cse37) (<= .cse29 .cse38) (<= .cse10 .cse36) (or (< .cse30 .cse39) (< .cse40 .cse16)) (or (< .cse41 .cse30) (< .cse42 .cse43)) (<= .cse0 .cse22) (or (< .cse44 .cse45) (< .cse3 .cse46)) (or (< .cse41 .cse47) (< .cse48 .cse43)) (or (< .cse23 30) (< 31 .cse1)) (or (< .cse28 (+ 3 .cse49)) (< (+ .cse5 1) .cse27)) (or (< .cse40 .cse28) (< .cse47 .cse39)) (or (< .cse16 .cse46) (< .cse44 .cse19)) (<= .cse50 .cse20) (or (< .cse2 .cse47) (< .cse48 .cse4)) (<= .cse50 .cse11) (or (< .cse3 .cse51) (< .cse52 .cse45)) (or .cse34 .cse9 .cse35) (or .cse33 (< .cse5 .cse8) (< .cse8 (+ .cse49 1))) (<= .cse26 .cse38) (or (< .cse1 .cse31) (< .cse32 .cse3)) (or (< .cse52 .cse28) (< .cse47 .cse51)) (or (< .cse25 .cse30) (< .cse42 .cse24)) (<= .cse12 .cse6)))) is different from false [2024-08-14 04:06:26,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse41 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse49 (mod c_~n~0 4294967296)) (.cse45 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296)) (.cse50 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse27 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse43 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse16 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse10 (+ 4294967294 .cse16)) (.cse15 (+ .cse9 1)) (.cse14 (+ 3 .cse5)) (.cse12 (+ 4294967294 .cse25)) (.cse33 (+ .cse43 4294967294)) (.cse19 (+ .cse27 4294967294)) (.cse37 (+ .cse18 1)) (.cse39 (+ .cse7 3)) (.cse20 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse36 (+ .cse11 1)) (.cse35 (+ 3 .cse26)) (.cse42 (+ 3 .cse9)) (.cse40 (+ .cse23 1)) (.cse17 (+ .cse13 4294967294)) (.cse2 (+ .cse7 1)) (.cse44 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse46 3)) (.cse8 (+ .cse3 4294967294)) (.cse31 (< .cse50 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1))) (.cse32 (< .cse45 .cse50)) (.cse30 (< .cse41 .cse49)) (.cse34 (+ .cse41 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse28 (+ .cse11 3)) (.cse29 (+ .cse46 1)) (.cse48 (+ .cse26 1)) (.cse47 (+ .cse23 3)) (.cse22 (+ .cse0 1)) (.cse38 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse21 (+ 3 .cse18)) (.cse6 (+ 4294967294 .cse24))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse10) (<= .cse11 .cse12) (or (< .cse13 .cse14) (< .cse15 .cse16)) (<= .cse11 .cse17) (<= .cse18 .cse19) (or (< .cse20 .cse21) (< .cse22 .cse1)) (<= .cse23 .cse10) (or (< .cse15 .cse24) (< .cse25 .cse14)) (<= .cse26 .cse12) (or (< .cse27 .cse28) (< .cse29 .cse13)) (or .cse30 .cse31 .cse32) (<= .cse18 .cse33) (<= .cse26 .cse34) (<= .cse7 .cse33) (or (< .cse27 .cse35) (< .cse36 .cse13)) (or (< .cse37 .cse27) (< .cse38 .cse39)) (<= .cse0 .cse19) (or (< .cse40 .cse41) (< .cse3 .cse42)) (or (< .cse37 .cse43) (< .cse44 .cse39)) (or (< .cse20 30) (< 31 .cse1)) (or (< .cse25 (+ 3 .cse45)) (< (+ .cse5 1) .cse24)) (or (< .cse36 .cse25) (< .cse43 .cse35)) (or (< .cse13 .cse42) (< .cse40 .cse16)) (<= .cse46 .cse17) (or (< .cse2 .cse43) (< .cse44 .cse4)) (<= .cse46 .cse8) (or (< .cse3 .cse47) (< .cse48 .cse41)) (or .cse31 (< .cse16 .cse49) .cse32) (or .cse30 (< .cse5 .cse50) (< .cse50 (+ .cse45 1))) (<= .cse23 .cse34) (or (< .cse1 .cse28) (< .cse29 .cse3)) (or (< .cse48 .cse25) (< .cse43 .cse47)) (or (< .cse22 .cse27) (< .cse38 .cse21)) (<= .cse9 .cse6)))) is different from false [2024-08-14 04:06:29,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse38 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse42 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse26 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse27 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse40 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse16 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse10 (+ 4294967294 .cse16)) (.cse15 (+ .cse9 1)) (.cse14 (+ 3 .cse5)) (.cse12 (+ 4294967294 .cse25)) (.cse30 (+ .cse40 4294967294)) (.cse19 (+ .cse27 4294967294)) (.cse34 (+ .cse18 1)) (.cse36 (+ .cse7 3)) (.cse20 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296)) (.cse33 (+ .cse11 1)) (.cse32 (+ 3 .cse26)) (.cse39 (+ 3 .cse9)) (.cse37 (+ .cse23 1)) (.cse17 (+ .cse13 4294967294)) (.cse2 (+ .cse7 1)) (.cse41 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse42 3)) (.cse8 (+ .cse3 4294967294)) (.cse31 (+ .cse38 4294967294)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse28 (+ .cse11 3)) (.cse29 (+ .cse42 1)) (.cse44 (+ .cse26 1)) (.cse43 (+ .cse23 3)) (.cse22 (+ .cse0 1)) (.cse35 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse21 (+ 3 .cse18)) (.cse6 (+ 4294967294 .cse24))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse10) (<= .cse11 .cse12) (or (< .cse13 .cse14) (< .cse15 .cse16)) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1| 18) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (<= .cse11 .cse17) (<= .cse18 .cse19) (or (< .cse20 .cse21) (< .cse22 .cse1)) (<= .cse23 .cse10) (or (< .cse15 .cse24) (< .cse25 .cse14)) (<= .cse26 .cse12) (or (< .cse27 .cse28) (< .cse29 .cse13)) (<= .cse18 .cse30) (<= .cse26 .cse31) (<= .cse7 .cse30) (or (< .cse27 .cse32) (< .cse33 .cse13)) (or (< .cse34 .cse27) (< .cse35 .cse36)) (<= .cse0 .cse19) (or (< .cse37 .cse38) (< .cse3 .cse39)) (or (< .cse34 .cse40) (< .cse41 .cse36)) (or (< .cse20 30) (< 31 .cse1)) (or (< .cse25 (+ 3 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296))) (< (+ .cse5 1) .cse24)) (or (< .cse33 .cse25) (< .cse40 .cse32)) (or (< .cse13 .cse39) (< .cse37 .cse16)) (<= .cse42 .cse17) (or (< .cse2 .cse40) (< .cse41 .cse4)) (<= .cse42 .cse8) (or (< .cse3 .cse43) (< .cse44 .cse38)) (<= .cse23 .cse31) (or (< .cse1 .cse28) (< .cse29 .cse3)) (or (< .cse44 .cse25) (< .cse40 .cse43)) (or (< .cse22 .cse27) (< .cse35 .cse21)) (<= .cse9 .cse6)))) is different from false [2024-08-14 04:08:25,173 WARN L293 SmtUtils]: Spent 1.86m on a formula simplification. DAG size of input: 188 DAG size of output: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:09:04,328 WARN L293 SmtUtils]: Spent 37.48s on a formula simplification. DAG size of input: 168 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:09:06,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:09:08,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 30) 4294967296)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse3 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse36 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 21) 4294967296)) (.cse11 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 24) 4294967296)) (.cse16 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 27) 4294967296)) (.cse24 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse34 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse22 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296)) (.cse14 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296))) (let ((.cse8 (+ 4294967294 .cse14)) (.cse13 (+ .cse7 1)) (.cse12 (+ 3 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296))) (.cse10 (+ 4294967294 .cse22)) (.cse27 (+ .cse34 4294967294)) (.cse17 (+ .cse24 4294967294)) (.cse31 (+ .cse16 1)) (.cse33 (+ .cse5 3)) (.cse30 (+ .cse9 1)) (.cse29 (+ 3 .cse23)) (.cse15 (+ .cse11 4294967294)) (.cse2 (+ .cse5 1)) (.cse35 (mod (+ 9 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (+ .cse36 3)) (.cse6 (+ .cse3 4294967294)) (.cse28 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 8) 4294967296)) (.cse25 (+ .cse9 3)) (.cse26 (+ .cse36 1)) (.cse38 (+ .cse23 1)) (.cse37 (+ .cse20 3)) (.cse19 (+ .cse0 1)) (.cse32 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 10) 4294967296)) (.cse18 (+ 3 .cse16)) (.cse21 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (<= .cse0 (+ .cse1 4294967294)) (or (< .cse2 .cse3) (< .cse1 .cse4)) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse10) (or (< .cse11 .cse12) (< .cse13 .cse14)) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1| 18) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (<= .cse9 .cse15) (<= .cse16 .cse17) (or (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 11) 4294967296) .cse18) (< .cse19 .cse1)) (<= .cse20 .cse8) (or (< .cse13 .cse21) (< .cse22 .cse12)) (<= .cse23 .cse10) (or (< .cse24 .cse25) (< .cse26 .cse11)) (<= .cse16 .cse27) (<= .cse23 (+ .cse28 4294967294)) (<= .cse5 .cse27) (or (< .cse24 .cse29) (< .cse30 .cse11)) (or (< .cse31 .cse24) (< .cse32 .cse33)) (<= .cse0 .cse17) (or (< .cse31 .cse34) (< .cse35 .cse33)) (or (< .cse30 .cse22) (< .cse34 .cse29)) (or (< .cse11 (+ 3 .cse7)) (< (+ .cse20 1) .cse14)) (<= .cse36 .cse15) (or (< .cse2 .cse34) (< .cse35 .cse4)) (<= .cse36 .cse6) (or (< .cse3 .cse37) (< .cse38 .cse28)) (or (< .cse1 .cse25) (< .cse26 .cse3)) (or (< .cse38 .cse22) (< .cse34 .cse37)) (or (< .cse19 .cse24) (< .cse32 .cse18)) (<= .cse7 (+ 4294967294 .cse21))))) is different from false [2024-08-14 04:09:10,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:09:12,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:09:15,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:38,461 WARN L293 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 167 DAG size of output: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 04:10:40,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:42,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:44,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:46,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:48,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:50,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:52,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:54,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:56,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:10:58,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-08-14 04:11:00,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15