./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 14:16:07,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 14:16:07,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 14:16:07,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 14:16:07,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 14:16:07,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 14:16:07,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 14:16:07,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 14:16:07,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 14:16:07,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 14:16:07,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 14:16:07,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 14:16:07,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 14:16:07,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 14:16:07,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 14:16:07,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 14:16:07,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 14:16:07,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 14:16:07,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 14:16:07,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 14:16:07,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 14:16:07,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 14:16:07,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 14:16:07,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 14:16:07,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 14:16:07,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 14:16:07,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 14:16:07,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 14:16:07,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 14:16:07,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 14:16:07,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:16:07,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 14:16:07,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 14:16:07,385 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 14:16:07,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 14:16:07,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 14:16:07,386 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 14:16:07,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 14:16:07,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 14:16:07,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 14:16:07,387 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 14:16:07,387 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-18 14:16:07,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 14:16:07,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 14:16:07,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 14:16:07,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 14:16:07,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 14:16:07,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-18 14:16:08,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 14:16:09,027 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 14:16:09,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-18 14:16:09,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/51e0e2519/bde64012c08b461ea4fe85fd7a1538b2/FLAG9ad9282a2 [2024-10-18 14:16:09,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/51e0e2519/bde64012c08b461ea4fe85fd7a1538b2 [2024-10-18 14:16:09,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 14:16:09,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 14:16:09,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 14:16:09,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 14:16:09,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 14:16:09,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314f111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09, skipping insertion in model container [2024-10-18 14:16:09,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 14:16:09,600 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/test-hard1.wvr.c[3425,3438] [2024-10-18 14:16:09,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:16:09,612 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 14:16:09,635 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/test-hard1.wvr.c[3425,3438] [2024-10-18 14:16:09,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:16:09,651 INFO L204 MainTranslator]: Completed translation [2024-10-18 14:16:09,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09 WrapperNode [2024-10-18 14:16:09,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 14:16:09,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 14:16:09,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 14:16:09,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 14:16:09,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,676 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-18 14:16:09,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 14:16:09,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 14:16:09,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 14:16:09,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 14:16:09,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 14:16:09,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 14:16:09,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 14:16:09,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 14:16:09,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (1/1) ... [2024-10-18 14:16:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:16:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:09,723 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-10-18 14:16:09,725 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-10-18 14:16:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 14:16:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 14:16:09,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 14:16:09,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 14:16:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-18 14:16:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-18 14:16:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 14:16:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 14:16:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 14:16:09,759 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 14:16:09,831 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 14:16:09,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 14:16:10,042 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 14:16:10,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 14:16:10,172 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 14:16:10,173 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-18 14:16:10,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:16:10 BoogieIcfgContainer [2024-10-18 14:16:10,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 14:16:10,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 14:16:10,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 14:16:10,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 14:16:10,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 02:16:09" (1/3) ... [2024-10-18 14:16:10,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b5587b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:16:10, skipping insertion in model container [2024-10-18 14:16:10,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:16:09" (2/3) ... [2024-10-18 14:16:10,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b5587b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:16:10, skipping insertion in model container [2024-10-18 14:16:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:16:10" (3/3) ... [2024-10-18 14:16:10,180 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-18 14:16:10,192 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 14:16:10,193 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 14:16:10,193 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 14:16:10,246 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 14:16:10,281 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:16:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:16:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:10,283 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-10-18 14:16:10,283 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-10-18 14:16:10,355 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:16:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:10,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:16:10,376 INFO L333 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, 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;@75e9d2ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:16:10,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-18 14:16:12,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:12,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-18 14:16:12,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113456605] [2024-10-18 14:16:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-18 14:16:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113456605] [2024-10-18 14:16:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113456605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:16:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:16:12,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 14:16:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386927933] [2024-10-18 14:16:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:16:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 14:16:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:16:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-18 14:16:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:12,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-18 14:16:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-18 14:16:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:14,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:15,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 14:16:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-18 14:16:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:15,132 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:16:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10-18 14:16:15,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-18 14:16:15,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-18 14:16:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641901890] [2024-10-18 14:16:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 14:16:17,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641901890] [2024-10-18 14:16:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641901890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:16:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335216434] [2024-10-18 14:16:17,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 14:16:17,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:16:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:17,405 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-10-18 14:16:17,407 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-10-18 14:16:17,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 14:16:17,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:16:17,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 14:16:17,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:16:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-18 14:16:17,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:16:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335216434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:16:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 14:16:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-18 14:16:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017194988] [2024-10-18 14:16:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:16:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 14:16:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:16:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334922, now seen corresponding path program 1 times [2024-10-18 14:16:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:17,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2119310385, now seen corresponding path program 1 times [2024-10-18 14:16:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:17,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656772, now seen corresponding path program 1 times [2024-10-18 14:16:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:18,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1540848974, now seen corresponding path program 1 times [2024-10-18 14:16:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:18,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458464, now seen corresponding path program 1 times [2024-10-18 14:16:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:20,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:20,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179370, now seen corresponding path program 1 times [2024-10-18 14:16:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-18 14:16:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-18 14:16:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 14:16:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2473, Unknown=0, NotChecked=0, Total=2756 [2024-10-18 14:16:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:22,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:16:22,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-10-18 14:16:22,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:22,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:22,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 14:16:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13 [2024-10-18 14:16:22,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-18 14:16:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095612913] [2024-10-18 14:16:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 14:16:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095612913] [2024-10-18 14:16:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095612913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:16:23,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458784267] [2024-10-18 14:16:23,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 14:16:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:16:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:23,314 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-10-18 14:16:23,315 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-10-18 14:16:23,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-18 14:16:23,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:16:23,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-18 14:16:23,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:16:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 14:16:23,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:16:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 14:16:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458784267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:16:23,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:16:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-18 14:16:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109977280] [2024-10-18 14:16:23,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:16:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 14:16:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:16:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334910, now seen corresponding path program 1 times [2024-10-18 14:16:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:23,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2119310373, now seen corresponding path program 1 times [2024-10-18 14:16:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:23,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656784, now seen corresponding path program 1 times [2024-10-18 14:16:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:24,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1540848960, now seen corresponding path program 1 times [2024-10-18 14:16:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:24,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458448, now seen corresponding path program 1 times [2024-10-18 14:16:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:16:27,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 14:16:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2024-10-18 14:16:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:27,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:16:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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-10-18 14:16:27,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:27,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:27,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:16:27,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 14:16:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-18 14:16:28,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-18 14:16:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384939496] [2024-10-18 14:16:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-18 14:16:32,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:32,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384939496] [2024-10-18 14:16:32,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384939496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:16:32,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123340737] [2024-10-18 14:16:32,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 14:16:32,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:16:32,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:32,096 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-10-18 14:16:32,108 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-10-18 14:16:32,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 14:16:32,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:16:32,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 14:16:32,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:16:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-18 14:16:32,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:16:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123340737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:16:32,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 14:16:32,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-18 14:16:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136315738] [2024-10-18 14:16:32,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:16:32,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 14:16:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:16:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334879, now seen corresponding path program 1 times [2024-10-18 14:16:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:32,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164590, now seen corresponding path program 1 times [2024-10-18 14:16:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:32,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446655, now seen corresponding path program 1 times [2024-10-18 14:16:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:32,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -566034417, now seen corresponding path program 1 times [2024-10-18 14:16:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:33,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 719854778, now seen corresponding path program 1 times [2024-10-18 14:16:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:33,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 418051278, now seen corresponding path program 1 times [2024-10-18 14:16:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-18 14:16:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-18 14:16:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371738, now seen corresponding path program 1 times [2024-10-18 14:16:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:38,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash -32616673, now seen corresponding path program 1 times [2024-10-18 14:16:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:38,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 14:16:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3091, Unknown=0, NotChecked=0, Total=3422 [2024-10-18 14:16:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:38,319 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:16:38,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-10-18 14:16:38,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:38,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:38,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:16:38,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:16:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:38,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-18 14:16:38,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 14:16:38,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:38,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-18 14:16:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596871886] [2024-10-18 14:16:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-18 14:16:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596871886] [2024-10-18 14:16:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596871886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:16:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940507593] [2024-10-18 14:16:39,476 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 14:16:39,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:16:39,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:39,478 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-10-18 14:16:39,480 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-10-18 14:16:39,700 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-18 14:16:39,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:16:39,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 14:16:39,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:16:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-18 14:16:39,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:16:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-18 14:16:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940507593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:16:39,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:16:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-18 14:16:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581711377] [2024-10-18 14:16:39,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:16:39,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 14:16:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:16:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334849, now seen corresponding path program 1 times [2024-10-18 14:16:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164620, now seen corresponding path program 1 times [2024-10-18 14:16:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446685, now seen corresponding path program 1 times [2024-10-18 14:16:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1674813409, now seen corresponding path program 1 times [2024-10-18 14:16:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1732726702, now seen corresponding path program 1 times [2024-10-18 14:16:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 686650055, now seen corresponding path program 1 times [2024-10-18 14:16:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:40,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -396186390, now seen corresponding path program 1 times [2024-10-18 14:16:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1031502943, now seen corresponding path program 1 times [2024-10-18 14:16:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 366979072, now seen corresponding path program 1 times [2024-10-18 14:16:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -807576351, now seen corresponding path program 1 times [2024-10-18 14:16:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1401846976, now seen corresponding path program 1 times [2024-10-18 14:16:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 533137936, now seen corresponding path program 1 times [2024-10-18 14:16:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash 368111940, now seen corresponding path program 1 times [2024-10-18 14:16:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1365990554, now seen corresponding path program 1 times [2024-10-18 14:16:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -595742148, now seen corresponding path program 1 times [2024-10-18 14:16:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:43,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 83246373, now seen corresponding path program 1 times [2024-10-18 14:16:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:43,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:16:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:16:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 14:16:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-18 14:16:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:43,652 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:16:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:16:43,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:43,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:43,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:16:43,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:43,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:16:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:16:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:16:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 14:16:44,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-18 14:16:44,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-10-18 14:16:44,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:16:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:16:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-18 14:16:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:16:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219793003] [2024-10-18 14:16:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:16:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:16:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:16:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-18 14:16:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:16:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219793003] [2024-10-18 14:16:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219793003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:16:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109429025] [2024-10-18 14:16:57,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-18 14:16:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:16:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:16:57,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:16:57,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-18 14:16:57,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-18 14:16:57,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:16:57,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-18 14:16:57,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:17:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-18 14:17:11,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:17:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-18 14:17:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109429025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:17:19,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:17:19,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-18 14:17:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277444614] [2024-10-18 14:17:19,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:17:19,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-18 14:17:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1046334795, now seen corresponding path program 1 times [2024-10-18 14:17:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164674, now seen corresponding path program 1 times [2024-10-18 14:17:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446741, now seen corresponding path program 1 times [2024-10-18 14:17:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1674813351, now seen corresponding path program 1 times [2024-10-18 14:17:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1732726644, now seen corresponding path program 1 times [2024-10-18 14:17:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:19,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash 686650115, now seen corresponding path program 1 times [2024-10-18 14:17:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 366979126, now seen corresponding path program 1 times [2024-10-18 14:17:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -807576295, now seen corresponding path program 1 times [2024-10-18 14:17:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1401846920, now seen corresponding path program 1 times [2024-10-18 14:17:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:20,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 533137994, now seen corresponding path program 1 times [2024-10-18 14:17:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:21,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1365990609, now seen corresponding path program 1 times [2024-10-18 14:17:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:21,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:17:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:17:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-18 14:17:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-18 14:17:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:21,611 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:21,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 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-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 14:17:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 14:18:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-18 14:18:22,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 14:18:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable48,SelfDestructingSolverStorable59,SelfDestructingSolverStorable49 [2024-10-18 14:18:22,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:18:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:18:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-18 14:18:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:18:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506011511] [2024-10-18 14:18:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:18:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:18:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:18:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-18 14:18:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:18:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506011511] [2024-10-18 14:18:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506011511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:18:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72955931] [2024-10-18 14:18:23,478 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-18 14:18:23,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:18:23,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:18:23,479 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:18:23,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-18 14:18:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:18:23,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-18 14:18:23,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:18:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-18 14:18:23,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:18:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-18 14:18:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72955931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:18:24,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:18:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-18 14:18:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963660921] [2024-10-18 14:18:24,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:18:24,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-18 14:18:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:18:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-18 14:18:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-18 14:18:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:18:24,451 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:18:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 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-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-18 14:18:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-18 14:18:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 14:18:26,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-18 14:18:26,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2024-10-18 14:18:26,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 14:18:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:18:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-18 14:18:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:18:26,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723903191] [2024-10-18 14:18:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:18:26,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:18:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:18:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-18 14:18:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:18:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723903191] [2024-10-18 14:18:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723903191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:18:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364429630] [2024-10-18 14:18:33,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 14:18:33,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:18:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:18:33,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:18:33,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-18 14:18:33,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 14:18:33,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:18:33,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-18 14:18:33,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:18:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-18 14:18:42,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:21:37,930 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse70 (* c_~p1~0 4294967256)) (.cse73 (< 40 c_~n2~0)) (.cse107 (< c_~n2~0 43)) (.cse84 (mod (+ (* 4294967253 c_~p1~0) c_~p2~0) 4294967296)) (.cse81 (< 43 c_~n2~0)) (.cse77 (* c_~p1~0 4294967252)) (.cse80 (= c_~n2~0 43)) (.cse109 (= 41 c_~n2~0)) (.cse112 (* 4294967254 c_~p1~0)) (.cse115 (= 42 c_~n2~0)) (.cse118 (mod (+ (* c_~p1~0 4294967255) c_~p2~0) 4294967296)) (.cse108 (< 42 c_~n2~0)) (.cse74 (= 40 c_~n2~0)) (.cse67 (= c_~n2~0 39)) (.cse44 (mod (+ (* c_~p1~0 4294967257) c_~p2~0) 4294967296)) (.cse66 (< 39 c_~n2~0)) (.cse141 (< c_~n2~0 39)) (.cse7 (< 38 c_~n2~0)) (.cse17 (mod (+ (* 4294967259 c_~p1~0) c_~p2~0) 4294967296)) (.cse14 (= c_~n2~0 38)) (.cse8 (= c_~n2~0 37)) (.cse9 (* 4294967258 c_~p1~0)) (.cse142 (= c_~n2~0 36)) (.cse2 (* 4294967260 c_~p1~0)) (.cse0 (< 36 c_~n2~0))) (and (or (let ((.cse3 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or .cse0 (and (forall ((v_z_102 Int)) (let ((.cse1 (+ .cse3 v_z_102))) (or (< 4294967295 .cse1) (= .cse1 (mod (+ .cse2 (* v_z_102 740511604) c_~p2~0) 4294967296)) (< v_z_102 0)))) (forall ((v_z_102 Int)) (let ((.cse4 (+ .cse3 v_z_102)) (.cse5 (mod (+ .cse2 (* v_z_102 740511604) c_~p2~0) 4294967296))) (or (= .cse4 (+ .cse5 4294967296)) (= .cse4 .cse5) (< v_z_102 0) (< 4294967295 v_z_102)))) (forall ((v_z_102 Int)) (let ((.cse6 (+ .cse3 v_z_102))) (or (< .cse6 4294967296) (= .cse6 (+ (mod (+ .cse2 (* v_z_102 740511604) c_~p2~0) 4294967296) 4294967296)) (< 4294967295 v_z_102)))))) (or (let ((.cse27 (+ .cse3 4294967296))) (and (or .cse7 (and (or .cse8 (and (forall ((v_z_97 Int)) (let ((.cse10 (+ .cse3 v_z_97))) (or (< 4294967295 v_z_97) (= (+ (mod (+ (* 3406353374 v_z_97) .cse9 c_~p2~0) 4294967296) 4294967296) .cse10) (< .cse10 4294967296)))) (forall ((v_z_97 Int)) (let ((.cse11 (+ .cse3 v_z_97))) (or (< v_z_97 0) (= (mod (+ (* 3406353374 v_z_97) .cse9 c_~p2~0) 4294967296) .cse11) (< 4294967295 .cse11)))) (forall ((v_z_97 Int)) (let ((.cse12 (mod (+ (* 3406353374 v_z_97) .cse9 c_~p2~0) 4294967296)) (.cse13 (+ .cse3 v_z_97))) (or (< 4294967295 v_z_97) (< v_z_97 0) (= .cse12 .cse13) (= (+ .cse12 4294967296) .cse13)))))) (or .cse14 (and (forall ((v_z_100 Int)) (or (< (+ .cse3 v_z_100) 4294967296) (forall ((v_y_100 Int)) (let ((.cse15 (* 2073432489 v_z_100)) (.cse16 (* v_y_100 4294967296))) (or (< (+ .cse15 .cse16 .cse17) 4294967296) (< 4294967295 (+ .cse15 .cse16)) (= .cse3 (+ .cse16 (* v_z_100 2073432488) .cse17))))) (< 4294967295 v_z_100))) (forall ((v_z_101 Int)) (or (< v_z_101 0) (forall ((v_y_101 Int)) (let ((.cse19 (* 2073432489 v_z_101)) (.cse18 (* v_y_101 4294967296))) (or (< 4294967295 (+ .cse18 .cse19 .cse17)) (< (+ .cse18 .cse19) 0) (= .cse3 (+ .cse18 (* v_z_101 2073432488) .cse17))))) (< 4294967295 (+ .cse3 v_z_101)))) (forall ((v_z_101 Int)) (or (< 4294967295 v_z_101) (forall ((v_y_101 Int)) (let ((.cse21 (* v_y_101 4294967296))) (let ((.cse20 (+ .cse21 (* 2073432489 v_z_101))) (.cse22 (* v_z_101 2073432488))) (or (< 4294967295 .cse20) (< .cse20 0) (= .cse3 (+ .cse21 .cse22 4294967296 .cse17)) (= .cse3 (+ .cse21 .cse22 .cse17)))))) (< (+ .cse3 v_z_101) 4294967296))) (forall ((v_z_101 Int)) (or (< 4294967295 v_z_101) (< v_z_101 0) (forall ((v_y_101 Int)) (let ((.cse25 (* v_z_101 2073432488)) (.cse24 (* v_y_101 4294967296))) (let ((.cse23 (+ .cse24 (* 2073432489 v_z_101))) (.cse26 (+ .cse24 .cse25 .cse17))) (or (< 4294967295 .cse23) (< .cse23 0) (= .cse3 (+ .cse24 .cse25 4294967296 .cse17)) (= .cse3 .cse26) (= .cse26 .cse27))))))) (forall ((v_z_101 Int)) (or (< v_z_101 0) (< 4294967295 (+ .cse3 v_z_101)) (forall ((v_y_101 Int)) (let ((.cse30 (* v_y_101 4294967296))) (let ((.cse28 (+ .cse30 (* 2073432489 v_z_101))) (.cse29 (+ .cse30 (* v_z_101 2073432488) .cse17))) (or (< 4294967295 .cse28) (< .cse28 0) (= .cse3 .cse29) (= .cse29 .cse27))))))) (forall ((v_z_100 Int)) (or (forall ((v_y_100 Int)) (let ((.cse33 (* v_y_100 4294967296))) (let ((.cse32 (* 2073432489 v_z_100)) (.cse31 (+ .cse33 (* v_z_100 2073432488) .cse17))) (or (= .cse27 .cse31) (< (+ .cse32 .cse33 .cse17) 4294967296) (< 4294967295 (+ .cse32 .cse33)) (= .cse3 .cse31))))) (< v_z_100 0) (< 4294967295 v_z_100))) (forall ((v_z_101 Int)) (or (< 4294967295 v_z_101) (forall ((v_y_101 Int)) (let ((.cse35 (* 2073432489 v_z_101)) (.cse34 (* v_y_101 4294967296))) (or (< 4294967295 (+ .cse34 .cse35 .cse17)) (< (+ .cse34 .cse35) 0) (= .cse3 (+ .cse34 (* v_z_101 2073432488) 4294967296 .cse17))))) (< (+ .cse3 v_z_101) 4294967296))) (forall ((v_z_101 Int)) (or (forall ((v_y_101 Int)) (let ((.cse37 (* 2073432489 v_z_101)) (.cse36 (* v_y_101 4294967296)) (.cse38 (* v_z_101 2073432488))) (or (< 4294967295 (+ .cse36 .cse37 .cse17)) (< (+ .cse36 .cse37) 0) (= .cse3 (+ .cse36 .cse38 4294967296 .cse17)) (= .cse3 (+ .cse36 .cse38 .cse17))))) (< 4294967295 v_z_101) (< v_z_101 0))) (forall ((v_z_100 Int)) (or (forall ((v_y_100 Int)) (let ((.cse40 (* 2073432489 v_z_100)) (.cse39 (* v_y_100 4294967296))) (or (= .cse27 (+ .cse39 (* v_z_100 2073432488) .cse17)) (< (+ .cse40 .cse39 .cse17) 4294967296) (< 4294967295 (+ .cse40 .cse39))))) (< v_z_100 0) (< 4294967295 (+ .cse3 v_z_100)))))))) (or (and (or (and (forall ((v_z_96 Int)) (or (forall ((v_y_96 Int)) (let ((.cse42 (* v_y_96 4294967296))) (let ((.cse41 (* 444306963 v_z_96)) (.cse43 (+ .cse42 (* v_z_96 444306962) .cse44))) (or (< 4294967295 (+ .cse41 .cse42)) (= .cse43 .cse27) (< (+ .cse41 .cse42 .cse44) 4294967296) (= .cse43 .cse3))))) (< v_z_96 0) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (< (+ .cse3 v_z_96) 4294967296) (< 4294967295 v_z_96) (forall ((v_y_96 Int)) (let ((.cse46 (* v_y_96 4294967296))) (let ((.cse45 (+ (* 444306963 v_z_96) .cse46)) (.cse47 (* v_z_96 444306962))) (or (< .cse45 0) (= .cse3 (+ .cse46 .cse47 .cse44 4294967296)) (< 4294967295 .cse45) (= (+ .cse46 .cse47 .cse44) .cse3))))))) (forall ((v_z_96 Int)) (or (< v_z_96 0) (forall ((v_y_96 Int)) (let ((.cse48 (* 444306963 v_z_96)) (.cse49 (* v_y_96 4294967296))) (or (< 4294967295 (+ .cse48 .cse49)) (= (+ .cse49 (* v_z_96 444306962) .cse44) .cse27) (< (+ .cse48 .cse49 .cse44) 4294967296)))) (< 4294967295 (+ .cse3 v_z_96)))) (forall ((v_z_95 Int)) (or (forall ((v_y_95 Int)) (let ((.cse50 (* v_y_95 4294967296)) (.cse51 (* 444306963 v_z_95))) (or (= .cse3 (+ .cse50 (* v_z_95 444306962) .cse44 4294967296)) (< 4294967295 (+ .cse50 .cse44 .cse51)) (< (+ .cse50 .cse51) 0)))) (< (+ .cse3 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (forall ((v_y_95 Int)) (let ((.cse53 (* v_z_95 444306962)) (.cse52 (* v_y_95 4294967296)) (.cse54 (* 444306963 v_z_95))) (or (= .cse3 (+ .cse52 .cse53 .cse44 4294967296)) (< 4294967295 (+ .cse52 .cse44 .cse54)) (= .cse3 (+ .cse52 .cse53 .cse44)) (< (+ .cse52 .cse54) 0)))) (< 4294967295 v_z_95) (< v_z_95 0))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse3 v_z_95)) (forall ((v_y_95 Int)) (let ((.cse55 (* v_y_95 4294967296)) (.cse56 (* 444306963 v_z_95))) (or (< 4294967295 (+ .cse55 .cse44 .cse56)) (= .cse3 (+ .cse55 (* v_z_95 444306962) .cse44)) (< (+ .cse55 .cse56) 0)))) (< v_z_95 0))) (forall ((v_z_96 Int)) (or (< v_z_96 0) (< 4294967295 v_z_96) (forall ((v_y_96 Int)) (let ((.cse59 (* v_z_96 444306962)) (.cse58 (* v_y_96 4294967296))) (let ((.cse57 (+ (* 444306963 v_z_96) .cse58)) (.cse60 (+ .cse58 .cse59 .cse44))) (or (< .cse57 0) (= .cse3 (+ .cse58 .cse59 .cse44 4294967296)) (< 4294967295 .cse57) (= .cse60 .cse27) (= .cse60 .cse3))))))) (forall ((v_z_96 Int)) (or (< (+ .cse3 v_z_96) 4294967296) (< 4294967295 v_z_96) (forall ((v_y_96 Int)) (let ((.cse61 (* 444306963 v_z_96)) (.cse62 (* v_y_96 4294967296))) (or (< 4294967295 (+ .cse61 .cse62)) (< (+ .cse61 .cse62 .cse44) 4294967296) (= (+ .cse62 (* v_z_96 444306962) .cse44) .cse3)))))) (forall ((v_z_96 Int)) (or (< v_z_96 0) (< 4294967295 (+ .cse3 v_z_96)) (forall ((v_y_96 Int)) (let ((.cse65 (* v_y_96 4294967296))) (let ((.cse63 (+ (* 444306963 v_z_96) .cse65)) (.cse64 (+ .cse65 (* v_z_96 444306962) .cse44))) (or (< .cse63 0) (< 4294967295 .cse63) (= .cse64 .cse27) (= .cse64 .cse3)))))))) .cse66) (or .cse67 (and (or (and (forall ((v_z_92 Int)) (let ((.cse68 (+ .cse3 v_z_92)) (.cse69 (mod (+ .cse70 (* 1777227848 v_z_92) c_~p2~0) 4294967296))) (or (= .cse68 .cse69) (< 4294967295 v_z_92) (= .cse68 (+ .cse69 4294967296)) (< v_z_92 0)))) (forall ((v_z_92 Int)) (let ((.cse71 (+ .cse3 v_z_92))) (or (< 4294967295 v_z_92) (< .cse71 4294967296) (= .cse71 (+ (mod (+ .cse70 (* 1777227848 v_z_92) c_~p2~0) 4294967296) 4294967296))))) (forall ((v_z_92 Int)) (let ((.cse72 (+ .cse3 v_z_92))) (or (< 4294967295 .cse72) (= .cse72 (mod (+ .cse70 (* 1777227848 v_z_92) c_~p2~0) 4294967296)) (< v_z_92 0))))) .cse73) (or .cse74 (and (or (and (or (and (forall ((v_z_84 Int)) (let ((.cse75 (+ .cse3 v_z_84)) (.cse76 (mod (+ (* v_z_84 2813944092) .cse77 c_~p2~0) 4294967296))) (or (< 4294967295 v_z_84) (= .cse75 (+ 4294967296 .cse76)) (< v_z_84 0) (= .cse75 .cse76)))) (forall ((v_z_84 Int)) (let ((.cse78 (+ .cse3 v_z_84))) (or (< 4294967295 v_z_84) (= .cse78 (+ 4294967296 (mod (+ (* v_z_84 2813944092) .cse77 c_~p2~0) 4294967296))) (< .cse78 4294967296)))) (forall ((v_z_84 Int)) (let ((.cse79 (+ .cse3 v_z_84))) (or (< v_z_84 0) (= .cse79 (mod (+ (* v_z_84 2813944092) .cse77 c_~p2~0) 4294967296)) (< 4294967295 .cse79))))) .cse80) (or .cse81 (and (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse85 (* v_z_89 1481023206)) (.cse86 (* v_y_89 4294967296))) (let ((.cse82 (+ .cse84 .cse85 .cse86)) (.cse83 (+ (* v_z_89 1481023207) .cse86))) (or (= .cse82 .cse3) (< 4294967295 .cse83) (= .cse3 (+ .cse84 .cse85 4294967296 .cse86)) (= .cse82 .cse27) (< .cse83 0))))) (< v_z_89 0))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse3 v_z_90)) (forall ((v_y_90 Int)) (let ((.cse88 (* v_z_90 1481023207)) (.cse87 (* v_y_90 4294967296))) (or (= (+ .cse84 .cse87 (* v_z_90 1481023206)) .cse27) (< (+ .cse84 .cse88 .cse87) 4294967296) (< 4294967295 (+ .cse88 .cse87))))))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse90 (* v_z_91 1481023207)) (.cse89 (* v_y_91 4294967296))) (or (= .cse3 (+ .cse84 .cse89 (* v_z_91 1481023206))) (< 4294967295 (+ .cse84 .cse90 .cse89)) (< (+ .cse90 .cse89) 0)))) (< v_z_91 0) (< 4294967295 (+ .cse3 v_z_91)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_y_89 Int)) (let ((.cse92 (* v_y_89 4294967296))) (let ((.cse91 (* v_z_89 1481023206)) (.cse93 (+ (* v_z_89 1481023207) .cse92))) (or (= (+ .cse84 .cse91 .cse92) .cse3) (< 4294967295 .cse93) (= .cse3 (+ .cse84 .cse91 4294967296 .cse92)) (< .cse93 0))))) (< (+ .cse3 v_z_89) 4294967296))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse95 (* v_z_91 1481023207)) (.cse94 (* v_y_91 4294967296))) (or (= .cse3 (+ .cse84 .cse94 4294967296 (* v_z_91 1481023206))) (< 4294967295 (+ .cse84 .cse95 .cse94)) (< (+ .cse95 .cse94) 0)))) (< 4294967295 v_z_91) (< (+ .cse3 v_z_91) 4294967296))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse98 (* v_y_90 4294967296))) (let ((.cse96 (+ .cse84 .cse98 (* v_z_90 1481023206))) (.cse97 (* v_z_90 1481023207))) (or (= .cse3 .cse96) (= .cse96 .cse27) (< (+ .cse84 .cse97 .cse98) 4294967296) (< 4294967295 (+ .cse97 .cse98)))))))) (forall ((v_z_91 Int)) (or (forall ((v_y_91 Int)) (let ((.cse100 (* v_z_91 1481023206)) (.cse101 (* v_z_91 1481023207)) (.cse99 (* v_y_91 4294967296))) (or (= .cse3 (+ .cse84 .cse99 4294967296 .cse100)) (= .cse3 (+ .cse84 .cse99 .cse100)) (< 4294967295 (+ .cse84 .cse101 .cse99)) (< (+ .cse101 .cse99) 0)))) (< v_z_91 0) (< 4294967295 v_z_91))) (forall ((v_z_90 Int)) (or (< (+ .cse3 v_z_90) 4294967296) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse103 (* v_z_90 1481023207)) (.cse102 (* v_y_90 4294967296))) (or (= .cse3 (+ .cse84 .cse102 (* v_z_90 1481023206))) (< (+ .cse84 .cse103 .cse102) 4294967296) (< 4294967295 (+ .cse103 .cse102))))))) (forall ((v_z_89 Int)) (or (forall ((v_y_89 Int)) (let ((.cse106 (* v_y_89 4294967296))) (let ((.cse104 (+ .cse84 (* v_z_89 1481023206) .cse106)) (.cse105 (+ (* v_z_89 1481023207) .cse106))) (or (= .cse104 .cse3) (< 4294967295 .cse105) (= .cse104 .cse27) (< .cse105 0))))) (< 4294967295 (+ .cse3 v_z_89)) (< v_z_89 0)))))) .cse107) (or .cse108 (and (or .cse109 (and (forall ((v_z_83 Int)) (let ((.cse110 (+ .cse3 v_z_83)) (.cse111 (mod (+ .cse112 (* v_z_83 148102322) c_~p2~0) 4294967296))) (or (= .cse110 .cse111) (< 4294967295 v_z_83) (= .cse110 (+ .cse111 4294967296)) (< v_z_83 0)))) (forall ((v_z_83 Int)) (let ((.cse113 (+ .cse3 v_z_83))) (or (= .cse113 (mod (+ .cse112 (* v_z_83 148102322) c_~p2~0) 4294967296)) (< v_z_83 0) (< 4294967295 .cse113)))) (forall ((v_z_83 Int)) (let ((.cse114 (+ .cse3 v_z_83))) (or (< .cse114 4294967296) (< 4294967295 v_z_83) (= .cse114 (+ (mod (+ .cse112 (* v_z_83 148102322) c_~p2~0) 4294967296) 4294967296))))))) (or .cse115 (and (forall ((v_z_82 Int)) (or (forall ((v_y_82 Int)) (let ((.cse116 (* v_y_82 4294967296)) (.cse117 (* v_z_82 3110148733))) (or (< 4294967295 (+ .cse116 .cse117)) (= .cse3 (+ .cse116 .cse118 (* v_z_82 3110148732))) (< (+ .cse116 .cse118 .cse117) 4294967296)))) (< (+ .cse3 v_z_82) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_79 Int)) (or (< (+ .cse3 v_z_79) 4294967296) (forall ((v_y_79 Int)) (let ((.cse121 (* v_y_79 4294967296))) (let ((.cse120 (* v_z_79 3110148732)) (.cse119 (+ (* v_z_79 3110148733) .cse121))) (or (< .cse119 0) (= .cse3 (+ .cse118 4294967296 .cse120 .cse121)) (= .cse3 (+ .cse118 .cse120 .cse121)) (< 4294967295 .cse119))))) (< 4294967295 v_z_79))) (forall ((v_z_81 Int)) (or (< (+ .cse3 v_z_81) 4294967296) (forall ((v_y_81 Int)) (let ((.cse123 (* v_z_81 3110148733)) (.cse122 (* v_y_81 4294967296))) (or (= .cse3 (+ .cse118 (* v_z_81 3110148732) 4294967296 .cse122)) (< 4294967295 (+ .cse118 .cse123 .cse122)) (< (+ .cse123 .cse122) 0)))) (< 4294967295 v_z_81))) (forall ((v_z_82 Int)) (or (forall ((v_y_82 Int)) (let ((.cse124 (* v_y_82 4294967296)) (.cse125 (* v_z_82 3110148733))) (or (< 4294967295 (+ .cse124 .cse125)) (= .cse27 (+ .cse124 .cse118 (* v_z_82 3110148732))) (< (+ .cse124 .cse118 .cse125) 4294967296)))) (< 4294967295 (+ .cse3 v_z_82)) (< v_z_82 0))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ .cse3 v_z_81)) (forall ((v_y_81 Int)) (let ((.cse126 (* v_z_81 3110148733)) (.cse127 (* v_y_81 4294967296))) (or (< 4294967295 (+ .cse118 .cse126 .cse127)) (= .cse3 (+ .cse118 (* v_z_81 3110148732) .cse127)) (< (+ .cse126 .cse127) 0)))) (< v_z_81 0))) (forall ((v_z_82 Int)) (or (< 4294967295 v_z_82) (< v_z_82 0) (forall ((v_y_82 Int)) (let ((.cse128 (* v_y_82 4294967296))) (let ((.cse130 (+ .cse128 .cse118 (* v_z_82 3110148732))) (.cse129 (* v_z_82 3110148733))) (or (< 4294967295 (+ .cse128 .cse129)) (= .cse27 .cse130) (= .cse3 .cse130) (< (+ .cse128 .cse118 .cse129) 4294967296))))))) (forall ((v_z_81 Int)) (or (forall ((v_y_81 Int)) (let ((.cse131 (* v_z_81 3110148732)) (.cse133 (* v_z_81 3110148733)) (.cse132 (* v_y_81 4294967296))) (or (= .cse3 (+ .cse118 .cse131 4294967296 .cse132)) (< 4294967295 (+ .cse118 .cse133 .cse132)) (= .cse3 (+ .cse118 .cse131 .cse132)) (< (+ .cse133 .cse132) 0)))) (< v_z_81 0) (< 4294967295 v_z_81))) (forall ((v_z_79 Int)) (or (< 4294967295 (+ .cse3 v_z_79)) (< v_z_79 0) (forall ((v_y_79 Int)) (let ((.cse136 (* v_y_79 4294967296))) (let ((.cse134 (+ .cse118 (* v_z_79 3110148732) .cse136)) (.cse135 (+ (* v_z_79 3110148733) .cse136))) (or (= .cse27 .cse134) (< .cse135 0) (= .cse3 .cse134) (< 4294967295 .cse135))))))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (forall ((v_y_79 Int)) (let ((.cse139 (* v_z_79 3110148732)) (.cse140 (* v_y_79 4294967296))) (let ((.cse137 (+ .cse118 .cse139 .cse140)) (.cse138 (+ (* v_z_79 3110148733) .cse140))) (or (= .cse27 .cse137) (< .cse138 0) (= .cse3 (+ .cse118 4294967296 .cse139 .cse140)) (= .cse3 .cse137) (< 4294967295 .cse138))))) (< 4294967295 v_z_79)))))))))))) .cse141))) .cse142))) (not (= 29 c_~n1~0))) (or (let ((.cse144 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (let ((.cse154 (+ 4294967296 .cse144))) (and (or (and (or (and (or (and (forall ((v_z_108 Int)) (let ((.cse143 (+ v_z_108 .cse144))) (or (= .cse143 (+ (mod (+ (* v_z_108 1272582904) .cse70 c_~p2~0) 4294967296) 4294967296)) (< 4294967295 v_z_108) (< .cse143 4294967296)))) (forall ((v_z_108 Int)) (let ((.cse145 (+ v_z_108 .cse144))) (or (= (mod (+ (* v_z_108 1272582904) .cse70 c_~p2~0) 4294967296) .cse145) (< v_z_108 0) (< 4294967295 .cse145)))) (forall ((v_z_108 Int)) (let ((.cse147 (+ v_z_108 .cse144)) (.cse146 (mod (+ (* v_z_108 1272582904) .cse70 c_~p2~0) 4294967296))) (or (= .cse146 .cse147) (= .cse147 (+ .cse146 4294967296)) (< 4294967295 v_z_108) (< v_z_108 0))))) .cse73) (or (and (or .cse107 (and (or (and (forall ((v_z_111 Int)) (or (< (+ v_z_111 .cse144) 4294967296) (forall ((v_y_111 Int)) (let ((.cse149 (* v_z_111 2227020081)) (.cse148 (* v_y_111 4294967296))) (or (= (+ .cse84 (* 2227020080 v_z_111) .cse148 4294967296) .cse144) (< 4294967295 (+ .cse84 .cse149 .cse148)) (< (+ .cse149 .cse148) 0)))) (< 4294967295 v_z_111))) (forall ((v_z_112 Int)) (or (< (+ v_z_112 .cse144) 4294967296) (forall ((v_y_112 Int)) (let ((.cse151 (* v_z_112 2227020081)) (.cse150 (* v_y_112 4294967296))) (or (= (+ .cse84 (* 2227020080 v_z_112) .cse150) .cse144) (< (+ .cse84 .cse151 .cse150) 4294967296) (< 4294967295 (+ .cse151 .cse150))))) (< 4294967295 v_z_112))) (forall ((v_z_111 Int)) (or (< v_z_111 0) (forall ((v_y_111 Int)) (let ((.cse155 (* 2227020080 v_z_111)) (.cse156 (* v_y_111 4294967296))) (let ((.cse152 (+ .cse84 .cse155 .cse156)) (.cse153 (+ (* v_z_111 2227020081) .cse156))) (or (= .cse152 .cse144) (< 4294967295 .cse153) (= .cse154 .cse152) (= (+ .cse84 .cse155 .cse156 4294967296) .cse144) (< .cse153 0))))) (< 4294967295 v_z_111))) (forall ((v_z_111 Int)) (or (< (+ v_z_111 .cse144) 4294967296) (forall ((v_y_111 Int)) (let ((.cse158 (* v_y_111 4294967296))) (let ((.cse157 (* 2227020080 v_z_111)) (.cse159 (+ (* v_z_111 2227020081) .cse158))) (or (= (+ .cse84 .cse157 .cse158) .cse144) (< 4294967295 .cse159) (= (+ .cse84 .cse157 .cse158 4294967296) .cse144) (< .cse159 0))))) (< 4294967295 v_z_111))) (forall ((v_z_111 Int)) (or (< v_z_111 0) (forall ((v_y_111 Int)) (let ((.cse162 (* v_y_111 4294967296))) (let ((.cse160 (+ .cse84 (* 2227020080 v_z_111) .cse162)) (.cse161 (+ (* v_z_111 2227020081) .cse162))) (or (= .cse160 .cse144) (< 4294967295 .cse161) (= .cse154 .cse160) (< .cse161 0))))) (< 4294967295 (+ v_z_111 .cse144)))) (forall ((v_z_111 Int)) (or (< v_z_111 0) (forall ((v_y_111 Int)) (let ((.cse163 (* 2227020080 v_z_111)) (.cse165 (* v_z_111 2227020081)) (.cse164 (* v_y_111 4294967296))) (or (= (+ .cse84 .cse163 .cse164) .cse144) (= (+ .cse84 .cse163 .cse164 4294967296) .cse144) (< 4294967295 (+ .cse84 .cse165 .cse164)) (< (+ .cse165 .cse164) 0)))) (< 4294967295 v_z_111))) (forall ((v_z_111 Int)) (or (< v_z_111 0) (forall ((v_y_111 Int)) (let ((.cse167 (* v_z_111 2227020081)) (.cse166 (* v_y_111 4294967296))) (or (= (+ .cse84 (* 2227020080 v_z_111) .cse166) .cse144) (< 4294967295 (+ .cse84 .cse167 .cse166)) (< (+ .cse167 .cse166) 0)))) (< 4294967295 (+ v_z_111 .cse144)))) (forall ((v_z_112 Int)) (or (< 4294967295 (+ v_z_112 .cse144)) (forall ((v_y_112 Int)) (let ((.cse169 (* v_z_112 2227020081)) (.cse168 (* v_y_112 4294967296))) (or (= (+ .cse84 (* 2227020080 v_z_112) .cse168) .cse154) (< (+ .cse84 .cse169 .cse168) 4294967296) (< 4294967295 (+ .cse169 .cse168))))) (< v_z_112 0))) (forall ((v_z_112 Int)) (or (< 4294967295 v_z_112) (forall ((v_y_112 Int)) (let ((.cse172 (* v_y_112 4294967296))) (let ((.cse170 (+ .cse84 (* 2227020080 v_z_112) .cse172)) (.cse171 (* v_z_112 2227020081))) (or (= .cse170 .cse144) (= .cse170 .cse154) (< (+ .cse84 .cse171 .cse172) 4294967296) (< 4294967295 (+ .cse171 .cse172)))))) (< v_z_112 0)))) .cse81) (or (and (forall ((v_z_113 Int)) (let ((.cse174 (+ v_z_113 .cse144)) (.cse173 (mod (+ .cse77 (* v_z_113 3976821572) c_~p2~0) 4294967296))) (or (< v_z_113 0) (< 4294967295 v_z_113) (= .cse173 .cse174) (= .cse174 (+ .cse173 4294967296))))) (forall ((v_z_113 Int)) (let ((.cse175 (+ v_z_113 .cse144))) (or (< 4294967295 v_z_113) (< .cse175 4294967296) (= .cse175 (+ (mod (+ .cse77 (* v_z_113 3976821572) c_~p2~0) 4294967296) 4294967296))))) (forall ((v_z_113 Int)) (let ((.cse176 (+ v_z_113 .cse144))) (or (< v_z_113 0) (= (mod (+ .cse77 (* v_z_113 3976821572) c_~p2~0) 4294967296) .cse176) (< 4294967295 .cse176))))) .cse80))) (or (and (or .cse109 (and (forall ((v_z_114 Int)) (let ((.cse177 (+ v_z_114 .cse144))) (or (< 4294967295 .cse177) (< v_z_114 0) (= .cse177 (mod (+ (* 477218590 v_z_114) .cse112 c_~p2~0) 4294967296))))) (forall ((v_z_114 Int)) (let ((.cse178 (+ v_z_114 .cse144))) (or (< 4294967295 v_z_114) (= (+ 4294967296 (mod (+ (* 477218590 v_z_114) .cse112 c_~p2~0) 4294967296)) .cse178) (< .cse178 4294967296)))) (forall ((v_z_114 Int)) (let ((.cse180 (mod (+ (* 477218590 v_z_114) .cse112 c_~p2~0) 4294967296)) (.cse179 (+ v_z_114 .cse144))) (or (< v_z_114 0) (< 4294967295 v_z_114) (= .cse179 .cse180) (= (+ 4294967296 .cse180) .cse179)))))) (or .cse115 (and (forall ((v_z_117 Int)) (or (< 4294967295 v_z_117) (< (+ v_z_117 .cse144) 4294967296) (forall ((v_y_117 Int)) (let ((.cse182 (* 3022384395 v_z_117)) (.cse181 (* v_y_117 4294967296))) (or (< 4294967295 (+ .cse181 .cse182 .cse118)) (< (+ .cse181 .cse182) 0) (= (+ .cse181 .cse118 (* 3022384394 v_z_117) 4294967296) .cse144)))))) (forall ((v_z_117 Int)) (or (< 4294967295 v_z_117) (< v_z_117 0) (forall ((v_y_117 Int)) (let ((.cse184 (* 3022384395 v_z_117)) (.cse183 (* v_y_117 4294967296)) (.cse185 (* 3022384394 v_z_117))) (or (< 4294967295 (+ .cse183 .cse184 .cse118)) (= (+ .cse183 .cse118 .cse185) .cse144) (< (+ .cse183 .cse184) 0) (= (+ .cse183 .cse118 .cse185 4294967296) .cse144)))))) (forall ((v_z_121 Int)) (or (< (+ v_z_121 .cse144) 4294967296) (< 4294967295 v_z_121) (forall ((v_y_121 Int)) (let ((.cse186 (* v_y_121 4294967296)) (.cse187 (* 3022384395 v_z_121))) (or (= (+ .cse186 .cse118 (* 3022384394 v_z_121)) .cse144) (< (+ .cse186 .cse187 .cse118) 4294967296) (< 4294967295 (+ .cse186 .cse187))))))) (forall ((v_z_119 Int)) (or (< v_z_119 0) (forall ((v_y_119 Int)) (let ((.cse190 (* v_y_119 4294967296))) (let ((.cse188 (+ .cse190 (* 3022384395 v_z_119))) (.cse189 (+ .cse190 .cse118 (* 3022384394 v_z_119)))) (or (< .cse188 0) (= .cse189 .cse144) (< 4294967295 .cse188) (= .cse154 .cse189))))) (< 4294967295 (+ v_z_119 .cse144)))) (forall ((v_z_117 Int)) (or (< v_z_117 0) (forall ((v_y_117 Int)) (let ((.cse191 (* v_y_117 4294967296)) (.cse192 (* 3022384395 v_z_117))) (or (< 4294967295 (+ .cse191 .cse192 .cse118)) (= (+ .cse191 .cse118 (* 3022384394 v_z_117)) .cse144) (< (+ .cse191 .cse192) 0)))) (< 4294967295 (+ v_z_117 .cse144)))) (forall ((v_z_119 Int)) (or (< v_z_119 0) (forall ((v_y_119 Int)) (let ((.cse196 (* 3022384394 v_z_119)) (.cse195 (* v_y_119 4294967296))) (let ((.cse193 (+ .cse195 (* 3022384395 v_z_119))) (.cse194 (+ .cse195 .cse118 .cse196))) (or (< .cse193 0) (= .cse194 .cse144) (< 4294967295 .cse193) (= (+ .cse195 .cse118 4294967296 .cse196) .cse144) (= .cse154 .cse194))))) (< 4294967295 v_z_119))) (forall ((v_z_121 Int)) (or (forall ((v_y_121 Int)) (let ((.cse198 (* v_y_121 4294967296))) (let ((.cse197 (+ .cse198 .cse118 (* 3022384394 v_z_121))) (.cse199 (* 3022384395 v_z_121))) (or (= .cse197 .cse154) (= .cse197 .cse144) (< (+ .cse198 .cse199 .cse118) 4294967296) (< 4294967295 (+ .cse198 .cse199)))))) (< 4294967295 v_z_121) (< v_z_121 0))) (forall ((v_z_119 Int)) (or (forall ((v_y_119 Int)) (let ((.cse201 (* v_y_119 4294967296))) (let ((.cse200 (+ .cse201 (* 3022384395 v_z_119))) (.cse202 (* 3022384394 v_z_119))) (or (< .cse200 0) (= (+ .cse201 .cse118 .cse202) .cse144) (< 4294967295 .cse200) (= (+ .cse201 .cse118 4294967296 .cse202) .cse144))))) (< (+ v_z_119 .cse144) 4294967296) (< 4294967295 v_z_119))) (forall ((v_z_121 Int)) (or (< v_z_121 0) (forall ((v_y_121 Int)) (let ((.cse203 (* v_y_121 4294967296)) (.cse204 (* 3022384395 v_z_121))) (or (= (+ .cse203 .cse118 (* 3022384394 v_z_121)) .cse154) (< (+ .cse203 .cse204 .cse118) 4294967296) (< 4294967295 (+ .cse203 .cse204))))) (< 4294967295 (+ v_z_121 .cse144))))))) .cse108)) .cse74)) .cse67) (or (and (forall ((v_z_128 Int)) (or (< 4294967295 (+ v_z_128 .cse144)) (< v_z_128 0) (forall ((v_y_128 Int)) (let ((.cse205 (* v_y_128 4294967296)) (.cse206 (* 3817748709 v_z_128))) (or (< (+ .cse205 .cse44 .cse206) 4294967296) (= (+ .cse205 (* v_z_128 3817748708) .cse44) .cse154) (< 4294967295 (+ .cse205 .cse206))))))) (forall ((v_z_126 Int)) (or (< v_z_126 0) (< 4294967295 (+ v_z_126 .cse144)) (forall ((v_y_126 Int)) (let ((.cse209 (* v_y_126 4294967296))) (let ((.cse207 (+ (* v_z_126 3817748708) .cse209 .cse44)) (.cse208 (+ (* 3817748709 v_z_126) .cse209))) (or (= .cse154 .cse207) (= .cse207 .cse144) (< 4294967295 .cse208) (< .cse208 0))))))) (forall ((v_z_124 Int)) (or (forall ((v_y_124 Int)) (let ((.cse210 (* 3817748709 v_z_124)) (.cse212 (* v_z_124 3817748708)) (.cse211 (* v_y_124 4294967296))) (or (< (+ .cse210 .cse211) 0) (< 4294967295 (+ .cse210 .cse211 .cse44)) (= (+ .cse212 .cse211 .cse44) .cse144) (= .cse144 (+ .cse212 .cse211 .cse44 4294967296))))) (< v_z_124 0) (< 4294967295 v_z_124))) (forall ((v_z_124 Int)) (or (< v_z_124 0) (forall ((v_y_124 Int)) (let ((.cse213 (* 3817748709 v_z_124)) (.cse214 (* v_y_124 4294967296))) (or (< (+ .cse213 .cse214) 0) (< 4294967295 (+ .cse213 .cse214 .cse44)) (= (+ (* v_z_124 3817748708) .cse214 .cse44) .cse144)))) (< 4294967295 (+ v_z_124 .cse144)))) (forall ((v_z_126 Int)) (or (< 4294967295 v_z_126) (< (+ v_z_126 .cse144) 4294967296) (forall ((v_y_126 Int)) (let ((.cse216 (* v_y_126 4294967296))) (let ((.cse215 (* v_z_126 3817748708)) (.cse217 (+ (* 3817748709 v_z_126) .cse216))) (or (= (+ .cse215 .cse216 .cse44 4294967296) .cse144) (= (+ .cse215 .cse216 .cse44) .cse144) (< 4294967295 .cse217) (< .cse217 0))))))) (forall ((v_z_124 Int)) (or (forall ((v_y_124 Int)) (let ((.cse218 (* 3817748709 v_z_124)) (.cse219 (* v_y_124 4294967296))) (or (< (+ .cse218 .cse219) 0) (< 4294967295 (+ .cse218 .cse219 .cse44)) (= .cse144 (+ (* v_z_124 3817748708) .cse219 .cse44 4294967296))))) (< 4294967295 v_z_124) (< (+ v_z_124 .cse144) 4294967296))) (forall ((v_z_128 Int)) (or (< 4294967295 v_z_128) (< (+ v_z_128 .cse144) 4294967296) (forall ((v_y_128 Int)) (let ((.cse220 (* v_y_128 4294967296)) (.cse221 (* 3817748709 v_z_128))) (or (= (+ .cse220 (* v_z_128 3817748708) .cse44) .cse144) (< (+ .cse220 .cse44 .cse221) 4294967296) (< 4294967295 (+ .cse220 .cse221))))))) (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse223 (* v_y_128 4294967296))) (let ((.cse222 (+ .cse223 (* v_z_128 3817748708) .cse44)) (.cse224 (* 3817748709 v_z_128))) (or (= .cse222 .cse144) (< (+ .cse223 .cse44 .cse224) 4294967296) (= .cse222 .cse154) (< 4294967295 (+ .cse223 .cse224)))))))) (forall ((v_z_126 Int)) (or (< v_z_126 0) (forall ((v_y_126 Int)) (let ((.cse226 (* v_z_126 3817748708)) (.cse227 (* v_y_126 4294967296))) (let ((.cse225 (+ .cse226 .cse227 .cse44)) (.cse228 (+ (* 3817748709 v_z_126) .cse227))) (or (= .cse154 .cse225) (= (+ .cse226 .cse227 .cse44 4294967296) .cse144) (= .cse225 .cse144) (< 4294967295 .cse228) (< .cse228 0))))) (< 4294967295 v_z_126)))) .cse66)) .cse141) (or .cse7 (and (or (and (forall ((v_z_105 Int)) (or (< v_z_105 0) (< 4294967295 v_z_105) (forall ((v_y_105 Int)) (let ((.cse229 (* v_z_105 318145727)) (.cse231 (* 318145726 v_z_105)) (.cse230 (* v_y_105 4294967296))) (or (< (+ .cse229 .cse230) 0) (= (+ .cse231 .cse17 .cse230) .cse144) (< 4294967295 (+ .cse229 .cse17 .cse230)) (= (+ .cse231 4294967296 .cse17 .cse230) .cse144)))))) (forall ((v_z_106 Int)) (or (< v_z_106 0) (< 4294967295 v_z_106) (forall ((v_y_106 Int)) (let ((.cse235 (* 318145726 v_z_106)) (.cse234 (* v_y_106 4294967296))) (let ((.cse232 (+ .cse234 (* v_z_106 318145727))) (.cse233 (+ .cse234 .cse235 .cse17))) (or (< .cse232 0) (= .cse233 .cse144) (< 4294967295 .cse232) (= .cse233 .cse154) (= (+ .cse234 4294967296 .cse235 .cse17) .cse144))))))) (forall ((v_z_106 Int)) (or (< v_z_106 0) (forall ((v_y_106 Int)) (let ((.cse238 (* v_y_106 4294967296))) (let ((.cse236 (+ .cse238 (* v_z_106 318145727))) (.cse237 (+ .cse238 (* 318145726 v_z_106) .cse17))) (or (< .cse236 0) (= .cse237 .cse144) (< 4294967295 .cse236) (= .cse237 .cse154))))) (< 4294967295 (+ v_z_106 .cse144)))) (forall ((v_z_105 Int)) (or (forall ((v_y_105 Int)) (let ((.cse239 (* v_z_105 318145727)) (.cse240 (* v_y_105 4294967296))) (or (< (+ .cse239 .cse240) 0) (< 4294967295 (+ .cse239 .cse17 .cse240)) (= (+ (* 318145726 v_z_105) 4294967296 .cse17 .cse240) .cse144)))) (< 4294967295 v_z_105) (< (+ v_z_105 .cse144) 4294967296))) (forall ((v_z_106 Int)) (or (< v_z_106 0) (< 4294967295 (+ v_z_106 .cse144)) (forall ((v_y_106 Int)) (let ((.cse242 (* v_z_106 318145727)) (.cse241 (* v_y_106 4294967296))) (or (< (+ .cse241 .cse242 .cse17) 4294967296) (< 4294967295 (+ .cse241 .cse242)) (= (+ .cse241 (* 318145726 v_z_106) .cse17) .cse154)))))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_y_106 Int)) (let ((.cse244 (* v_y_106 4294967296))) (let ((.cse243 (+ .cse244 (* v_z_106 318145727))) (.cse245 (* 318145726 v_z_106))) (or (< .cse243 0) (= (+ .cse244 .cse245 .cse17) .cse144) (< 4294967295 .cse243) (= (+ .cse244 4294967296 .cse245 .cse17) .cse144))))) (< (+ v_z_106 .cse144) 4294967296))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_y_106 Int)) (let ((.cse246 (* v_y_106 4294967296)) (.cse247 (* v_z_106 318145727))) (or (< (+ .cse246 .cse247 .cse17) 4294967296) (= (+ .cse246 (* 318145726 v_z_106) .cse17) .cse144) (< 4294967295 (+ .cse246 .cse247))))) (< (+ v_z_106 .cse144) 4294967296))) (forall ((v_z_105 Int)) (or (< 4294967295 (+ v_z_105 .cse144)) (< v_z_105 0) (forall ((v_y_105 Int)) (let ((.cse248 (* v_z_105 318145727)) (.cse249 (* v_y_105 4294967296))) (or (< (+ .cse248 .cse249) 0) (= (+ (* 318145726 v_z_105) .cse17 .cse249) .cse144) (< 4294967295 (+ .cse248 .cse17 .cse249))))))) (forall ((v_z_106 Int)) (or (< v_z_106 0) (< 4294967295 v_z_106) (forall ((v_y_106 Int)) (let ((.cse250 (* v_y_106 4294967296))) (let ((.cse251 (* v_z_106 318145727)) (.cse252 (+ .cse250 (* 318145726 v_z_106) .cse17))) (or (< (+ .cse250 .cse251 .cse17) 4294967296) (= .cse252 .cse144) (< 4294967295 (+ .cse250 .cse251)) (= .cse252 .cse154)))))))) .cse14) (or .cse8 (and (forall ((v_z_107 Int)) (let ((.cse254 (mod (+ (* 2067947218 v_z_107) .cse9 c_~p2~0) 4294967296)) (.cse253 (+ v_z_107 .cse144))) (or (= .cse253 .cse254) (< 4294967295 v_z_107) (< v_z_107 0) (= (+ 4294967296 .cse254) .cse253)))) (forall ((v_z_107 Int)) (let ((.cse255 (+ v_z_107 .cse144))) (or (= .cse255 (mod (+ (* 2067947218 v_z_107) .cse9 c_~p2~0) 4294967296)) (< v_z_107 0) (< 4294967295 .cse255)))) (forall ((v_z_107 Int)) (let ((.cse256 (+ v_z_107 .cse144))) (or (< 4294967295 v_z_107) (= (+ 4294967296 (mod (+ (* 2067947218 v_z_107) .cse9 c_~p2~0) 4294967296)) .cse256) (< .cse256 4294967296)))))))))) .cse142) (or (and (forall ((v_z_129 Int)) (let ((.cse257 (+ v_z_129 .cse144))) (or (= .cse257 (mod (+ .cse2 (* 2863311532 v_z_129) c_~p2~0) 4294967296)) (< 4294967295 .cse257) (< v_z_129 0)))) (forall ((v_z_129 Int)) (let ((.cse258 (+ v_z_129 .cse144))) (or (< .cse258 4294967296) (< 4294967295 v_z_129) (= (+ 4294967296 (mod (+ .cse2 (* 2863311532 v_z_129) c_~p2~0) 4294967296)) .cse258)))) (forall ((v_z_129 Int)) (let ((.cse260 (mod (+ .cse2 (* 2863311532 v_z_129) c_~p2~0) 4294967296)) (.cse259 (+ v_z_129 .cse144))) (or (= .cse259 .cse260) (< 4294967295 v_z_129) (= (+ 4294967296 .cse260) .cse259) (< v_z_129 0))))) .cse0))) (not (= c_~n1~0 27))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-18 14:23:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-18 14:23:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364429630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:23:28,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:23:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-18 14:23:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38567965] [2024-10-18 14:23:28,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:23:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-18 14:23:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:23:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-18 14:23:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=21928, Unknown=5, NotChecked=324, Total=27060 [2024-10-18 14:23:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:23:28,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:23:28,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 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-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 14:23:28,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:25:31,133 WARN L286 SmtUtils]: Spent 24.40s on a formula simplification. DAG size of input: 269 DAG size of output: 132 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:26:07,384 WARN L286 SmtUtils]: Spent 34.89s on a formula simplification. DAG size of input: 269 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:26:08,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:26:54,257 WARN L286 SmtUtils]: Spent 43.35s on a formula simplification. DAG size of input: 199 DAG size of output: 119 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:27:17,963 WARN L286 SmtUtils]: Spent 23.11s on a formula simplification. DAG size of input: 271 DAG size of output: 131 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:28:54,178 WARN L286 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 216 DAG size of output: 126 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:29:27,742 WARN L286 SmtUtils]: Spent 29.52s on a formula simplification. DAG size of input: 200 DAG size of output: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:29:52,501 WARN L286 SmtUtils]: Spent 21.57s on a formula simplification. DAG size of input: 286 DAG size of output: 144 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15