./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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-17 16:35:56,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 16:35:56,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 16:35:56,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 16:35:56,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 16:35:56,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 16:35:56,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 16:35:56,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 16:35:56,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 16:35:56,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 16:35:56,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 16:35:56,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 16:35:56,400 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 16:35:56,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 16:35:56,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 16:35:56,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 16:35:56,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 16:35:56,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 16:35:56,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 16:35:56,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 16:35:56,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 16:35:56,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 16:35:56,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 16:35:56,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 16:35:56,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 16:35:56,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 16:35:56,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 16:35:56,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 16:35:56,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 16:35:56,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 16:35:56,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 16:35:56,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 16:35:56,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 16:35:56,410 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 16:35:56,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 16:35:56,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 16:35:56,413 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 16:35:56,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 16:35:56,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 16:35:56,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 16:35:56,415 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 16:35:56,416 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-17 16:35:56,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 16:35:56,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 16:35:56,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 16:35:56,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 16:35:56,714 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 16:35:56,715 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-17 16:35:58,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 16:35:58,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 16:35:58,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 16:35:58,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/37f4e1f9b/18f90152a1be4bbd8d59c85ce82750ce/FLAG4a1f0b4b3 [2024-10-17 16:35:58,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/37f4e1f9b/18f90152a1be4bbd8d59c85ce82750ce [2024-10-17 16:35:58,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 16:35:58,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 16:35:58,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 16:35:58,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 16:35:58,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 16:35:58,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cd3d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58, skipping insertion in model container [2024-10-17 16:35:58,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 16:35:58,695 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-17 16:35:58,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 16:35:58,710 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 16:35:58,736 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-17 16:35:58,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 16:35:58,753 INFO L204 MainTranslator]: Completed translation [2024-10-17 16:35:58,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58 WrapperNode [2024-10-17 16:35:58,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 16:35:58,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 16:35:58,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 16:35:58,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 16:35:58,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,791 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-17 16:35:58,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 16:35:58,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 16:35:58,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 16:35:58,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 16:35:58,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 16:35:58,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 16:35:58,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 16:35:58,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 16:35:58,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (1/1) ... [2024-10-17 16:35:58,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 16:35:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:35:58,860 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-17 16:35:58,864 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-17 16:35:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 16:35:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 16:35:58,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 16:35:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 16:35:58,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 16:35:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 16:35:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 16:35:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 16:35:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 16:35:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 16:35:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 16:35:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 16:35:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 16:35:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 16:35:58,909 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 16:35:58,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 16:35:58,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 16:35:59,211 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 16:35:59,211 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 16:35:59,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 16:35:59,409 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 16:35:59,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:35:59 BoogieIcfgContainer [2024-10-17 16:35:59,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 16:35:59,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 16:35:59,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 16:35:59,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 16:35:59,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 04:35:58" (1/3) ... [2024-10-17 16:35:59,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0e1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:35:59, skipping insertion in model container [2024-10-17 16:35:59,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:58" (2/3) ... [2024-10-17 16:35:59,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0e1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:35:59, skipping insertion in model container [2024-10-17 16:35:59,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:35:59" (3/3) ... [2024-10-17 16:35:59,423 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-17 16:35:59,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 16:35:59,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 16:35:59,444 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 16:35:59,511 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 16:35:59,561 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 16:35:59,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 16:35:59,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:35:59,563 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-17 16:35:59,565 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-17 16:35:59,645 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 16:35:59,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:35:59,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 16:35:59,670 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;@1e7f5cd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 16:35:59,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 16:36:01,981 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-17 16:36:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-17 16:36:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:02,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-17 16:36:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:04,473 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-17 16:36:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:05,494 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-17 16:36:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-17 16:36:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:05,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1928252765, now seen corresponding path program 1 times [2024-10-17 16:36:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 16:36:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 16:36:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1526022233, now seen corresponding path program 1 times [2024-10-17 16:36:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 16:36:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 16:36:09,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:36:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-17 16:36:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:36:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935227175] [2024-10-17 16:36:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:09,977 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-17 16:36:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:36:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935227175] [2024-10-17 16:36:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935227175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 16:36:09,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 16:36:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 16:36:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584922093] [2024-10-17 16:36:09,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 16:36:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 16:36:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:36:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 16:36:10,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-17 16:36:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:10,016 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:36:10,017 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-17 16:36:10,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:10,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-17 16:36:10,422 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-17 16:36:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656764, now seen corresponding path program 1 times [2024-10-17 16:36:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:10,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458473, now seen corresponding path program 1 times [2024-10-17 16:36:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:13,940 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-17 16:36:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:15,925 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-17 16:36:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179361, now seen corresponding path program 1 times [2024-10-17 16:36:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:16,631 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-17 16:36:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:16,981 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-17 16:36:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:36:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-17 16:36:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:36:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208616179] [2024-10-17 16:36:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:19,277 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-17 16:36:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:36:19,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208616179] [2024-10-17 16:36:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208616179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:36:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806248133] [2024-10-17 16:36:19,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 16:36:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:36:19,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:36:19,293 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-17 16:36:19,295 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-17 16:36:19,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 16:36:19,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:36:19,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 16:36:19,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:36:19,559 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-17 16:36:19,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 16:36:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806248133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 16:36:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 16:36:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-17 16:36:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58771063] [2024-10-17 16:36:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 16:36:19,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 16:36:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:36:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 16:36:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-17 16:36:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:19,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:36:19,568 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-17 16:36:19,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:19,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:20,033 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-17 16:36:20,219 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-10-17 16:36:20,221 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-17 16:36:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656771, now seen corresponding path program 1 times [2024-10-17 16:36:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:20,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458464, now seen corresponding path program 1 times [2024-10-17 16:36:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:22,389 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-17 16:36:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:24,221 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-17 16:36:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179370, now seen corresponding path program 1 times [2024-10-17 16:36:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:24,750 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-17 16:36:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:25,078 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-17 16:36:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:36:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-17 16:36:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:36:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048658227] [2024-10-17 16:36:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:25,605 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-17 16:36:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:36:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048658227] [2024-10-17 16:36:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048658227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:36:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775560017] [2024-10-17 16:36:25,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 16:36:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:36:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:36:25,609 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-17 16:36:25,611 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-17 16:36:25,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-17 16:36:25,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:36:25,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 16:36:25,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:36:25,876 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-17 16:36:25,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 16:36:26,023 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-17 16:36:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775560017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 16:36:26,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 16:36:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-17 16:36:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577827898] [2024-10-17 16:36:26,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 16:36:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 16:36:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:36:26,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 16:36:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-17 16:36:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:26,033 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:36:26,033 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-17 16:36:26,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:26,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:26,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:36:27,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-17 16:36:27,234 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,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-17 16:36:27,235 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-17 16:36:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164568, now seen corresponding path program 1 times [2024-10-17 16:36:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:27,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446633, now seen corresponding path program 1 times [2024-10-17 16:36:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:27,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371769, now seen corresponding path program 1 times [2024-10-17 16:36:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:27,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1493601783, now seen corresponding path program 1 times [2024-10-17 16:36:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:28,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash 148797668, now seen corresponding path program 1 times [2024-10-17 16:36:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 16:36:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 16:36:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -356756191, now seen corresponding path program 1 times [2024-10-17 16:36:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 16:36:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 16:36:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1946192339, now seen corresponding path program 1 times [2024-10-17 16:36:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 16:36:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 16:36:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 999052783, now seen corresponding path program 1 times [2024-10-17 16:36:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 16:36:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 16:36:32,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:36:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-17 16:36:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:36:32,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381832956] [2024-10-17 16:36:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:38,428 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-17 16:36:38,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:36:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381832956] [2024-10-17 16:36:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381832956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:36:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550430116] [2024-10-17 16:36:38,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 16:36:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:36:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:36:38,431 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-17 16:36:38,432 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-17 16:36:38,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 16:36:38,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:36:38,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 16:36:38,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:36:38,690 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-17 16:36:38,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 16:36:38,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550430116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 16:36:38,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 16:36:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-17 16:36:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161392060] [2024-10-17 16:36:38,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 16:36:38,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 16:36:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:36:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 16:36:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-17 16:36:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:38,694 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:36:38,694 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-17 16:36:38,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:38,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:38,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:36:38,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:36:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:36:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:36:39,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-17 16:36:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-17 16:36:39,354 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-17 16:36:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164596, now seen corresponding path program 1 times [2024-10-17 16:36:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:39,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash -749118961, now seen corresponding path program 1 times [2024-10-17 16:36:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:39,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -396186417, now seen corresponding path program 1 times [2024-10-17 16:36:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215620, now seen corresponding path program 1 times [2024-10-17 16:36:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 368111905, now seen corresponding path program 1 times [2024-10-17 16:36:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:40,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -595742186, now seen corresponding path program 1 times [2024-10-17 16:36:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:41,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -955123052, now seen corresponding path program 1 times [2024-10-17 16:36:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:41,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash 83246338, now seen corresponding path program 1 times [2024-10-17 16:36:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:42,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:36:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:36:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497023, now seen corresponding path program 1 times [2024-10-17 16:36:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:36:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 16:36:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:36:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:36:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 16:37:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash 25582910, now seen corresponding path program 1 times [2024-10-17 16:37:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 16:37:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 16:37:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1702001674, now seen corresponding path program 1 times [2024-10-17 16:37:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 16:37:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 35 proven. 537 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-17 16:37:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2146642938, now seen corresponding path program 1 times [2024-10-17 16:37:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 16:37:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 28 proven. 532 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 16:37:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:37:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-17 16:37:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:37:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421191767] [2024-10-17 16:37:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:37:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:37:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:37:59,086 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-17 16:37:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:37:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421191767] [2024-10-17 16:37:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421191767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:37:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061172069] [2024-10-17 16:37:59,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-17 16:37:59,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:37:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:37:59,088 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-17 16:37:59,089 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-17 16:37:59,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-17 16:37:59,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:37:59,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 16:37:59,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:37:59,458 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-17 16:37:59,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 16:37:59,551 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-17 16:37:59,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061172069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 16:37:59,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 16:37:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-17 16:37:59,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603088225] [2024-10-17 16:37:59,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 16:37:59,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 16:37:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:37:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 16:37:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-17 16:37:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:37:59,554 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:37:59,555 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-17 16:37:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:37:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:37:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:37:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:37:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:38:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:38:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:38:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:38:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:38:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 16:38:00,446 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-17 16:38:00,627 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,SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-10-17 16:38:00,627 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-17 16:38:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164644, now seen corresponding path program 1 times [2024-10-17 16:38:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:00,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -749118913, now seen corresponding path program 1 times [2024-10-17 16:38:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:00,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash -396186369, now seen corresponding path program 1 times [2024-10-17 16:38:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:01,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215572, now seen corresponding path program 1 times [2024-10-17 16:38:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 368111953, now seen corresponding path program 1 times [2024-10-17 16:38:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:01,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash -595742138, now seen corresponding path program 1 times [2024-10-17 16:38:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -955123004, now seen corresponding path program 1 times [2024-10-17 16:38:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 83246386, now seen corresponding path program 1 times [2024-10-17 16:38:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:02,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:38:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:38:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1650496975, now seen corresponding path program 1 times [2024-10-17 16:38:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:38:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 16:38:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:38:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 16:38:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2054584073, now seen corresponding path program 1 times [2024-10-17 16:38:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:38:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 16:38:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:38:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 46 proven. 502 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-17 16:38:49,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:38:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-17 16:38:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:38:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124887602] [2024-10-17 16:38:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:38:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:38:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:39:03,020 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-17 16:39:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:39:03,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124887602] [2024-10-17 16:39:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124887602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:39:03,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181670638] [2024-10-17 16:39:03,020 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-17 16:39:03,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:39:03,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:39:03,023 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-17 16:39:03,024 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-17 16:39:03,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-17 16:39:03,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:39:03,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-17 16:39:03,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:39:30,662 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-17 16:39:30,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 16:39:39,757 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-17 16:39:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181670638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 16:39:39,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 16:39:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-17 16:39:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455634194] [2024-10-17 16:39:39,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 16:39:39,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-17 16:39:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:39:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-17 16:39:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-17 16:39:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:39:39,790 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:39:39,792 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-17 16:39:39,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:39:39,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:39:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:39:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:39:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 16:39:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:39:43,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 16:41:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-17 16:41:18,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 16:41:18,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable63,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-17 16:41:18,675 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-17 16:41:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash 916806546, now seen corresponding path program 1 times [2024-10-17 16:41:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:41:18,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:41:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:41:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 740751600, now seen corresponding path program 1 times [2024-10-17 16:41:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 16:41:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 16:41:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:41:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-17 16:41:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:41:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805569527] [2024-10-17 16:41:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:20,786 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-17 16:41:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:41:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805569527] [2024-10-17 16:41:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805569527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:41:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88690847] [2024-10-17 16:41:20,787 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-17 16:41:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:41:20,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:41:20,789 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-17 16:41:20,790 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-17 16:41:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:20,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-17 16:41:20,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:41:21,029 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-17 16:41:21,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 16:41:21,786 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-17 16:41:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88690847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 16:41:21,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 16:41:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-17 16:41:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470882598] [2024-10-17 16:41:21,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 16:41:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-17 16:41:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:41:21,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-17 16:41:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-17 16:41:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:41:21,790 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:41:21,791 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-17 16:41:21,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:21,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:21,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:41:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 16:41:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-17 16:41:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-17 16:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 16:41:24,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 16:41:24,509 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,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2024-10-17 16:41:24,509 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-17 16:41:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash 916806574, now seen corresponding path program 1 times [2024-10-17 16:41:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:41:24,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 16:41:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 16:41:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1814554615, now seen corresponding path program 1 times [2024-10-17 16:41:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 16:41:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 16:41:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2049167267, now seen corresponding path program 1 times [2024-10-17 16:41:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 16:41:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:41:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 16:41:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 16:41:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-17 16:41:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 16:41:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524856793] [2024-10-17 16:41:55,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 16:41:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 16:41:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 16:42:03,272 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-17 16:42:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 16:42:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524856793] [2024-10-17 16:42:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524856793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 16:42:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874422615] [2024-10-17 16:42:03,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 16:42:03,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 16:42:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 16:42:03,275 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-17 16:42:03,276 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-17 16:42:03,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 16:42:03,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 16:42:03,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 16:42:03,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 16:42:15,248 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-17 16:42:15,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 16:47:19,542 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (* 36 c_~p1~0)) (.cse1 (* (- 36) c_~p1~0)) (.cse5 (< 36 c_~n2~0)) (.cse50 (* c_~p1~0 (- 39))) (.cse49 (* 39 c_~p1~0)) (.cse51 (< 39 c_~n2~0)) (.cse20 (< c_~n2~0 43)) (.cse26 (* 44 c_~p1~0)) (.cse27 (* (- 44) c_~p1~0)) (.cse30 (= c_~n2~0 43)) (.cse25 (* c_~p1~0 43)) (.cse24 (* c_~p1~0 (- 43))) (.cse21 (< 43 c_~n2~0)) (.cse41 (< 42 c_~n2~0)) (.cse36 (= 42 c_~n2~0)) (.cse38 (* 41 c_~p1~0)) (.cse37 (* (- 41) c_~p1~0)) (.cse35 (= 41 c_~n2~0)) (.cse31 (* 42 c_~p1~0)) (.cse32 (* c_~p1~0 (- 42))) (.cse19 (= 40 c_~n2~0)) (.cse42 (* (- 40) c_~p1~0)) (.cse43 (* 40 c_~p1~0)) (.cse46 (< 40 c_~n2~0)) (.cse18 (= c_~n2~0 39)) (.cse52 (< c_~n2~0 39)) (.cse8 (= c_~n2~0 38)) (.cse10 (* (- 37) c_~p1~0)) (.cse9 (* c_~p1~0 37)) (.cse13 (= c_~n2~0 37)) (.cse14 (* c_~p1~0 38)) (.cse15 (* (- 38) c_~p1~0)) (.cse7 (< 38 c_~n2~0)) (.cse6 (= c_~n2~0 36))) (and (or (let ((.cse2 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_95 Int)) (or (= (+ (* v_z_95 47985151859) 4294967296 c_~p2~0) (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (< (+ .cse2 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse2 v_z_95)) (= (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2) (+ (* v_z_95 47985151859) c_~p2~0)) (< v_z_95 0))) (forall ((v_z_95 Int)) (let ((.cse4 (+ .cse0 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse1) 4294967296) 4294967296) .cse2)) (.cse3 (* v_z_95 47985151859))) (or (= (+ .cse3 4294967296 c_~p2~0) .cse4) (= .cse4 (+ .cse3 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse5) (or .cse6 (and (or .cse7 (and (or .cse8 (and (forall ((v_z_88 Int)) (or (< (+ .cse2 v_z_88) 4294967296) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) 4294967296 c_~p2~0)) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse11 (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296)))) (.cse12 (* v_z_88 49318072744))) (or (= .cse11 (+ .cse12 4294967296 c_~p2~0)) (< v_z_88 0) (= .cse11 (+ .cse12 c_~p2~0)) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (< v_z_88 0) (= (+ .cse2 .cse9 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_88)))))) (or .cse13 (and (forall ((v_z_87 Int)) (or (< 4294967295 (+ .cse2 v_z_87)) (= (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))) (+ (* v_z_87 50650993629) c_~p2~0)) (< v_z_87 0))) (forall ((v_z_87 Int)) (let ((.cse17 (* v_z_87 50650993629)) (.cse16 (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296))))) (or (= .cse16 (+ .cse17 c_~p2~0)) (= (+ .cse17 4294967296 c_~p2~0) .cse16) (< v_z_87 0) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 50650993629) 4294967296 c_~p2~0) (+ .cse14 .cse2 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse15 c_~p2~0) 4294967296)))) (< (+ .cse2 v_z_87) 4294967296) (< 4294967295 v_z_87))))))) (or (and (or .cse18 (and (or .cse19 (and (or .cse20 (and (or .cse21 (and (forall ((v_z_91 Int)) (let ((.cse22 (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25)) (.cse23 (* v_z_91 57315598054))) (or (= .cse22 (+ .cse23 c_~p2~0)) (< v_z_91 0) (< 4294967295 v_z_91) (= .cse22 (+ 4294967296 .cse23 c_~p2~0))))) (forall ((v_z_91 Int)) (or (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ (* v_z_91 57315598054) c_~p2~0)) (< v_z_91 0) (< 4294967295 (+ .cse2 v_z_91)))) (forall ((v_z_91 Int)) (or (< 4294967295 v_z_91) (= (+ .cse2 (* (div (+ .cse24 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse25) (+ 4294967296 (* v_z_91 57315598054) c_~p2~0)) (< (+ .cse2 v_z_91) 4294967296))))) (or (and (forall ((v_z_90 Int)) (or (< (+ .cse2 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) 4294967296 c_~p2~0)))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse2 v_z_90)) (= (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse28 (+ .cse2 .cse26 (* (div (+ (* v_z_90 58648518940) .cse27 c_~p2~0) 4294967296) 4294967296))) (.cse29 (* v_z_90 58648518939))) (or (< v_z_90 0) (= .cse28 (+ .cse29 c_~p2~0)) (< 4294967295 v_z_90) (= .cse28 (+ .cse29 4294967296 c_~p2~0)))))) .cse30))) (or (and (or (and (forall ((v_z_93 Int)) (or (< (+ .cse2 v_z_93) 4294967296) (< 4294967295 v_z_93) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* 55982677169 v_z_93) c_~p2~0)))) (forall ((v_z_93 Int)) (let ((.cse33 (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296))) (.cse34 (* 55982677169 v_z_93))) (or (< v_z_93 0) (< 4294967295 v_z_93) (= .cse33 (+ 4294967296 .cse34 c_~p2~0)) (= .cse33 (+ .cse34 c_~p2~0))))) (forall ((v_z_93 Int)) (or (< v_z_93 0) (< 4294967295 (+ .cse2 v_z_93)) (= (+ .cse2 .cse31 (* (div (+ (* 55982677170 v_z_93) .cse32 c_~p2~0) 4294967296) 4294967296)) (+ (* 55982677169 v_z_93) c_~p2~0))))) .cse35) (or .cse36 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse39 (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2)) (.cse40 (* 54649756284 v_z_92))) (or (= .cse39 (+ .cse40 c_~p2~0)) (= .cse39 (+ .cse40 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse37 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse38 .cse2) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse2 v_z_92) 4294967296)))))) .cse41))) (or (and (forall ((v_z_94 Int)) (or (= (+ (* v_z_94 53316835399) 4294967296 c_~p2~0) (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (< (+ .cse2 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43) (+ (* v_z_94 53316835399) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_94)))) (forall ((v_z_94 Int)) (let ((.cse45 (+ .cse2 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse42) 4294967296)) .cse43)) (.cse44 (* v_z_94 53316835399))) (or (< v_z_94 0) (= (+ .cse44 4294967296 c_~p2~0) .cse45) (= .cse45 (+ .cse44 c_~p2~0)) (< 4294967295 v_z_94))))) .cse46))) (or (and (forall ((v_z_89 Int)) (let ((.cse47 (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296))) (.cse48 (* v_z_89 51983914514))) (or (= .cse47 (+ .cse48 c_~p2~0)) (< 4294967295 v_z_89) (= .cse47 (+ 4294967296 .cse48 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* v_z_89 51983914514) c_~p2~0)) (< (+ .cse2 v_z_89) 4294967296))) (forall ((v_z_89 Int)) (or (= (+ .cse2 .cse49 (* (div (+ (* 51983914515 v_z_89) .cse50 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_89 51983914514) c_~p2~0)) (< 4294967295 (+ .cse2 v_z_89)) (< v_z_89 0)))) .cse51)) .cse52))))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse55 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_78 Int)) (let ((.cse53 (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55)) (.cse54 (* v_z_78 62992853675))) (or (= .cse53 (+ c_~p2~0 .cse54)) (< 4294967295 v_z_78) (= .cse53 (+ 4294967296 c_~p2~0 .cse54)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse55) 4294967296) (< 4294967295 v_z_78) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ 4294967296 c_~p2~0 (* v_z_78 62992853675))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse55)) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse1) 4294967296) 4294967296) .cse55) (+ c_~p2~0 (* v_z_78 62992853675))) (< v_z_78 0)))) .cse5) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse55) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse56 (* 68242258148 v_z_81)) (.cse57 (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))) (or (= (+ .cse56 4294967296 c_~p2~0) .cse57) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse56 c_~p2~0) .cse57)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse55)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse50 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse49 .cse55))))) .cse51) (or (and (or (and (or .cse20 (and (or (and (forall ((v_z_85 Int)) (or (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) c_~p2~0)) (< 4294967295 (+ v_z_85 .cse55)) (< v_z_85 0))) (forall ((v_z_85 Int)) (let ((.cse58 (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55)) (.cse59 (* v_z_85 76991265603))) (or (= .cse58 (+ .cse59 c_~p2~0)) (< 4294967295 v_z_85) (< v_z_85 0) (= .cse58 (+ .cse59 4294967296 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse26 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse27 c_~p2~0) 4294967296)) .cse55) (+ (* v_z_85 76991265603) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse55) 4294967296)))) .cse30) (or (and (forall ((v_z_86 Int)) (let ((.cse60 (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse61 (* v_z_86 75241464112))) (or (< v_z_86 0) (= .cse60 (+ .cse61 c_~p2~0)) (= .cse60 (+ .cse61 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse55)) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse55) 4294967296) (= (+ .cse25 (* (div (+ (* v_z_86 75241464113) .cse24 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_86 75241464112) 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) .cse21))) (or .cse41 (and (or .cse36 (and (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (< (+ v_z_83 .cse55) 4294967296) (= (+ (* v_z_83 71741861130) 4294967296 c_~p2~0) (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)))) (forall ((v_z_83 Int)) (let ((.cse63 (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse62 (* v_z_83 71741861130))) (or (< 4294967295 v_z_83) (= (+ .cse62 4294967296 c_~p2~0) .cse63) (< v_z_83 0) (= .cse63 (+ .cse62 c_~p2~0))))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse55)) (< v_z_83 0) (= (+ .cse38 (* (div (+ (* v_z_83 71741861131) .cse37 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_83 71741861130) c_~p2~0)))))) (or .cse35 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse55) 4294967296) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ 4294967296 (* v_z_84 73491662621) c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse64 (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse65 (* v_z_84 73491662621))) (or (< 4294967295 v_z_84) (< v_z_84 0) (= .cse64 (+ 4294967296 .cse65 c_~p2~0)) (= .cse64 (+ .cse65 c_~p2~0))))) (forall ((v_z_84 Int)) (or (< v_z_84 0) (= (+ .cse31 (* (div (+ .cse32 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_84 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_84 .cse55))))))))) .cse19) (or (and (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse55)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43) (+ (* 69992059639 v_z_82) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse55) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse66 (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse42) 4294967296) 4294967296) .cse55 .cse43)) (.cse67 (* 69992059639 v_z_82))) (or (= .cse66 (+ .cse67 c_~p2~0)) (= .cse66 (+ .cse67 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse46)) .cse18)) .cse52) (or (and (or .cse8 (and (forall ((v_z_80 Int)) (let ((.cse69 (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (.cse68 (* v_z_80 64742655166))) (or (< 4294967295 v_z_80) (= (+ .cse68 c_~p2~0) .cse69) (< v_z_80 0) (= .cse69 (+ .cse68 4294967296 c_~p2~0))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse55)) (= (+ (* v_z_80 64742655166) c_~p2~0) (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55)) (< v_z_80 0))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ (* (div (+ (* v_z_80 64742655167) .cse10 c_~p2~0) 4294967296) 4294967296) .cse9 .cse55) (+ (* v_z_80 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse55) 4294967296))))) (or .cse13 (and (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse55) 4294967296) (= (+ (* v_z_79 66492456657) 4294967296 c_~p2~0) (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_79 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse55)))) (forall ((v_z_79 Int)) (let ((.cse71 (+ .cse14 (* (div (+ (* 66492456658 v_z_79) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse70 (* v_z_79 66492456657))) (or (< v_z_79 0) (= (+ .cse70 4294967296 c_~p2~0) .cse71) (= .cse71 (+ .cse70 c_~p2~0)) (< 4294967295 v_z_79))))))) .cse7)) .cse6)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-17 16:47:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 969 refuted. 4 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-17 16:47:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874422615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 16:47:49,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 16:47:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-17 16:47:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774249837] [2024-10-17 16:47:49,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 16:47:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-17 16:47:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 16:47:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-17 16:47:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21925, Unknown=9, NotChecked=324, Total=27060 [2024-10-17 16:47:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:47:49,222 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 16:47:49,222 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-17 16:47:49,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:47:49,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:47:49,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 16:47:49,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 16:47:49,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 16:47:49,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-17 16:47:49,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 16:47:49,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 16:48:18,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 1 c_~n1~0)) (.cse0 (<= c_~n1~0 0)) (.cse74 (= c_~n2~0 c_~n1~0))) (and (or (and (= c_thread1Thread1of1ForFork1_~cond~0 0) .cse0) (and (= c_thread1Thread1of1ForFork1_~cond~0 1) .cse1)) (or (and (= c_thread2Thread1of1ForFork3_~cond~1 1) .cse1) (and .cse0 (= c_thread2Thread1of1ForFork3_~cond~1 0))) (or (let ((.cse2 (* 36 c_~p1~0)) (.cse3 (* (- 36) c_~p1~0)) (.cse7 (< 36 c_~n2~0)) (.cse52 (* c_~p1~0 (- 39))) (.cse51 (* 39 c_~p1~0)) (.cse53 (< 39 c_~n2~0)) (.cse22 (< c_~n2~0 43)) (.cse28 (* 44 c_~p1~0)) (.cse29 (* (- 44) c_~p1~0)) (.cse32 (= c_~n2~0 43)) (.cse27 (* c_~p1~0 43)) (.cse26 (* c_~p1~0 (- 43))) (.cse23 (< 43 c_~n2~0)) (.cse43 (< 42 c_~n2~0)) (.cse38 (= 42 c_~n2~0)) (.cse40 (* 41 c_~p1~0)) (.cse39 (* (- 41) c_~p1~0)) (.cse37 (= 41 c_~n2~0)) (.cse33 (* 42 c_~p1~0)) (.cse34 (* c_~p1~0 (- 42))) (.cse21 (= 40 c_~n2~0)) (.cse44 (* (- 40) c_~p1~0)) (.cse45 (* 40 c_~p1~0)) (.cse48 (< 40 c_~n2~0)) (.cse20 (= c_~n2~0 39)) (.cse54 (< c_~n2~0 39)) (.cse10 (= c_~n2~0 38)) (.cse12 (* (- 37) c_~p1~0)) (.cse11 (* c_~p1~0 37)) (.cse15 (= c_~n2~0 37)) (.cse16 (* c_~p1~0 38)) (.cse17 (* (- 38) c_~p1~0)) (.cse9 (< 38 c_~n2~0)) (.cse8 (= c_~n2~0 36))) (and (or (let ((.cse4 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_95 Int)) (or (= (+ (* v_z_95 47985151859) 4294967296 c_~p2~0) (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4)) (< (+ .cse4 v_z_95) 4294967296) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse4 v_z_95)) (= (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4) (+ (* v_z_95 47985151859) c_~p2~0)) (< v_z_95 0))) (forall ((v_z_95 Int)) (let ((.cse6 (+ .cse2 (* (div (+ (* v_z_95 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse4)) (.cse5 (* v_z_95 47985151859))) (or (= (+ .cse5 4294967296 c_~p2~0) .cse6) (= .cse6 (+ .cse5 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse7) (or .cse8 (and (or .cse9 (and (or .cse10 (and (forall ((v_z_88 Int)) (or (< (+ .cse4 v_z_88) 4294967296) (= (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) 4294967296 c_~p2~0)) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse13 (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296)))) (.cse14 (* v_z_88 49318072744))) (or (= .cse13 (+ .cse14 4294967296 c_~p2~0)) (< v_z_88 0) (= .cse13 (+ .cse14 c_~p2~0)) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (< v_z_88 0) (= (+ .cse4 .cse11 (* 4294967296 (div (+ (* v_z_88 49318072745) .cse12 c_~p2~0) 4294967296))) (+ (* v_z_88 49318072744) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_88)))))) (or .cse15 (and (forall ((v_z_87 Int)) (or (< 4294967295 (+ .cse4 v_z_87)) (= (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296))) (+ (* v_z_87 50650993629) c_~p2~0)) (< v_z_87 0))) (forall ((v_z_87 Int)) (let ((.cse19 (* v_z_87 50650993629)) (.cse18 (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296))))) (or (= .cse18 (+ .cse19 c_~p2~0)) (= (+ .cse19 4294967296 c_~p2~0) .cse18) (< v_z_87 0) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 50650993629) 4294967296 c_~p2~0) (+ .cse16 .cse4 (* 4294967296 (div (+ (* 50650993630 v_z_87) .cse17 c_~p2~0) 4294967296)))) (< (+ .cse4 v_z_87) 4294967296) (< 4294967295 v_z_87))))))) (or (and (or .cse20 (and (or .cse21 (and (or .cse22 (and (or .cse23 (and (forall ((v_z_91 Int)) (let ((.cse24 (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27)) (.cse25 (* v_z_91 57315598054))) (or (= .cse24 (+ .cse25 c_~p2~0)) (< v_z_91 0) (< 4294967295 v_z_91) (= .cse24 (+ 4294967296 .cse25 c_~p2~0))))) (forall ((v_z_91 Int)) (or (= (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27) (+ (* v_z_91 57315598054) c_~p2~0)) (< v_z_91 0) (< 4294967295 (+ .cse4 v_z_91)))) (forall ((v_z_91 Int)) (or (< 4294967295 v_z_91) (= (+ .cse4 (* (div (+ .cse26 (* 57315598055 v_z_91) c_~p2~0) 4294967296) 4294967296) .cse27) (+ 4294967296 (* v_z_91 57315598054) c_~p2~0)) (< (+ .cse4 v_z_91) 4294967296))))) (or (and (forall ((v_z_90 Int)) (or (< (+ .cse4 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) 4294967296 c_~p2~0)))) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse4 v_z_90)) (= (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 58648518939) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse30 (+ .cse4 .cse28 (* (div (+ (* v_z_90 58648518940) .cse29 c_~p2~0) 4294967296) 4294967296))) (.cse31 (* v_z_90 58648518939))) (or (< v_z_90 0) (= .cse30 (+ .cse31 c_~p2~0)) (< 4294967295 v_z_90) (= .cse30 (+ .cse31 4294967296 c_~p2~0)))))) .cse32))) (or (and (or (and (forall ((v_z_93 Int)) (or (< (+ .cse4 v_z_93) 4294967296) (< 4294967295 v_z_93) (= (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* 55982677169 v_z_93) c_~p2~0)))) (forall ((v_z_93 Int)) (let ((.cse35 (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296))) (.cse36 (* 55982677169 v_z_93))) (or (< v_z_93 0) (< 4294967295 v_z_93) (= .cse35 (+ 4294967296 .cse36 c_~p2~0)) (= .cse35 (+ .cse36 c_~p2~0))))) (forall ((v_z_93 Int)) (or (< v_z_93 0) (< 4294967295 (+ .cse4 v_z_93)) (= (+ .cse4 .cse33 (* (div (+ (* 55982677170 v_z_93) .cse34 c_~p2~0) 4294967296) 4294967296)) (+ (* 55982677169 v_z_93) c_~p2~0))))) .cse37) (or .cse38 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse41 (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4)) (.cse42 (* 54649756284 v_z_92))) (or (= .cse41 (+ .cse42 c_~p2~0)) (= .cse41 (+ .cse42 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse39 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse40 .cse4) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse4 v_z_92) 4294967296)))))) .cse43))) (or (and (forall ((v_z_94 Int)) (or (= (+ (* v_z_94 53316835399) 4294967296 c_~p2~0) (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45)) (< (+ .cse4 v_z_94) 4294967296) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45) (+ (* v_z_94 53316835399) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_94)))) (forall ((v_z_94 Int)) (let ((.cse47 (+ .cse4 (* 4294967296 (div (+ (* v_z_94 53316835400) c_~p2~0 .cse44) 4294967296)) .cse45)) (.cse46 (* v_z_94 53316835399))) (or (< v_z_94 0) (= (+ .cse46 4294967296 c_~p2~0) .cse47) (= .cse47 (+ .cse46 c_~p2~0)) (< 4294967295 v_z_94))))) .cse48))) (or (and (forall ((v_z_89 Int)) (let ((.cse49 (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296))) (.cse50 (* v_z_89 51983914514))) (or (= .cse49 (+ .cse50 c_~p2~0)) (< 4294967295 v_z_89) (= .cse49 (+ 4294967296 .cse50 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (= (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 (* v_z_89 51983914514) c_~p2~0)) (< (+ .cse4 v_z_89) 4294967296))) (forall ((v_z_89 Int)) (or (= (+ .cse4 .cse51 (* (div (+ (* 51983914515 v_z_89) .cse52 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_89 51983914514) c_~p2~0)) (< 4294967295 (+ .cse4 v_z_89)) (< v_z_89 0)))) .cse53)) .cse54))))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse57 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_78 Int)) (let ((.cse55 (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57)) (.cse56 (* v_z_78 62992853675))) (or (= .cse55 (+ c_~p2~0 .cse56)) (< 4294967295 v_z_78) (= .cse55 (+ 4294967296 c_~p2~0 .cse56)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< (+ v_z_78 .cse57) 4294967296) (< 4294967295 v_z_78) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57) (+ 4294967296 c_~p2~0 (* v_z_78 62992853675))))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse57)) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_78) c_~p2~0 .cse3) 4294967296) 4294967296) .cse57) (+ c_~p2~0 (* v_z_78 62992853675))) (< v_z_78 0)))) .cse7) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse57) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse58 (* 68242258148 v_z_81)) (.cse59 (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57))) (or (= (+ .cse58 4294967296 c_~p2~0) .cse59) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse58 c_~p2~0) .cse59)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse57)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse52 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse51 .cse57))))) .cse53) (or (and (or (and (or .cse22 (and (or (and (forall ((v_z_85 Int)) (or (= (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57) (+ (* v_z_85 76991265603) c_~p2~0)) (< 4294967295 (+ v_z_85 .cse57)) (< v_z_85 0))) (forall ((v_z_85 Int)) (let ((.cse60 (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57)) (.cse61 (* v_z_85 76991265603))) (or (= .cse60 (+ .cse61 c_~p2~0)) (< 4294967295 v_z_85) (< v_z_85 0) (= .cse60 (+ .cse61 4294967296 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse28 (* 4294967296 (div (+ (* v_z_85 76991265604) .cse29 c_~p2~0) 4294967296)) .cse57) (+ (* v_z_85 76991265603) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse57) 4294967296)))) .cse32) (or (and (forall ((v_z_86 Int)) (let ((.cse62 (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse63 (* v_z_86 75241464112))) (or (< v_z_86 0) (= .cse62 (+ .cse63 c_~p2~0)) (= .cse62 (+ .cse63 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse57)) (= (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_86 75241464112) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse57) 4294967296) (= (+ .cse27 (* (div (+ (* v_z_86 75241464113) .cse26 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_86 75241464112) 4294967296 c_~p2~0)) (< 4294967295 v_z_86)))) .cse23))) (or .cse43 (and (or .cse38 (and (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (< (+ v_z_83 .cse57) 4294967296) (= (+ (* v_z_83 71741861130) 4294967296 c_~p2~0) (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57)))) (forall ((v_z_83 Int)) (let ((.cse65 (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse64 (* v_z_83 71741861130))) (or (< 4294967295 v_z_83) (= (+ .cse64 4294967296 c_~p2~0) .cse65) (< v_z_83 0) (= .cse65 (+ .cse64 c_~p2~0))))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse57)) (< v_z_83 0) (= (+ .cse40 (* (div (+ (* v_z_83 71741861131) .cse39 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_83 71741861130) c_~p2~0)))))) (or .cse37 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse57) 4294967296) (= (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57) (+ 4294967296 (* v_z_84 73491662621) c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse66 (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse67 (* v_z_84 73491662621))) (or (< 4294967295 v_z_84) (< v_z_84 0) (= .cse66 (+ 4294967296 .cse67 c_~p2~0)) (= .cse66 (+ .cse67 c_~p2~0))))) (forall ((v_z_84 Int)) (or (< v_z_84 0) (= (+ .cse33 (* (div (+ .cse34 (* 73491662622 v_z_84) c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_84 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_84 .cse57))))))))) .cse21) (or (and (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45) (+ (* 69992059639 v_z_82) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse57)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45) (+ (* 69992059639 v_z_82) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse57) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse68 (+ (* (div (+ (* v_z_82 69992059640) c_~p2~0 .cse44) 4294967296) 4294967296) .cse57 .cse45)) (.cse69 (* 69992059639 v_z_82))) (or (= .cse68 (+ .cse69 c_~p2~0)) (= .cse68 (+ .cse69 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse48)) .cse20)) .cse54) (or (and (or .cse10 (and (forall ((v_z_80 Int)) (let ((.cse71 (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57)) (.cse70 (* v_z_80 64742655166))) (or (< 4294967295 v_z_80) (= (+ .cse70 c_~p2~0) .cse71) (< v_z_80 0) (= .cse71 (+ .cse70 4294967296 c_~p2~0))))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse57)) (= (+ (* v_z_80 64742655166) c_~p2~0) (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57)) (< v_z_80 0))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ (* (div (+ (* v_z_80 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse11 .cse57) (+ (* v_z_80 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse57) 4294967296))))) (or .cse15 (and (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse57) 4294967296) (= (+ (* v_z_79 66492456657) 4294967296 c_~p2~0) (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57) (+ (* v_z_79 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse57)))) (forall ((v_z_79 Int)) (let ((.cse73 (+ .cse16 (* (div (+ (* 66492456658 v_z_79) .cse17 c_~p2~0) 4294967296) 4294967296) .cse57)) (.cse72 (* v_z_79 66492456657))) (or (< v_z_79 0) (= (+ .cse72 4294967296 c_~p2~0) .cse73) (= .cse73 (+ .cse72 c_~p2~0)) (< 4294967295 v_z_79))))))) .cse9)) .cse8)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) .cse74 (= (mod c_~p1~0 4294967296) (mod c_~p2~0 4294967296)) (or (< c_~n2~0 2) .cse74))) is different from false Killed by 15