./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 RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -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 RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 03:09:29,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 03:09:29,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 03:09:29,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 03:09:29,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 03:09:29,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 03:09:29,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 03:09:29,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 03:09:29,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 03:09:29,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 03:09:29,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 03:09:29,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 03:09:29,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 03:09:29,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 03:09:29,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 03:09:29,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 03:09:29,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 03:09:29,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 03:09:29,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 03:09:29,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 03:09:29,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 03:09:29,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 03:09:29,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 03:09:29,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 03:09:29,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 03:09:29,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 03:09:29,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 03:09:29,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 03:09:29,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 03:09:29,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 03:09:29,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:09:29,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 03:09:29,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 03:09:29,259 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 03:09:29,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 03:09:29,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 03:09:29,260 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 03:09:29,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 03:09:29,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 03:09:29,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 03:09:29,260 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 03:09:29,260 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 546 [2024-10-18 03:09:29,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 03:09:29,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 03:09:29,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 03:09:29,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 03:09:29,480 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 03:09:29,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-18 03:09:30,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 03:09:30,793 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 03:09:30,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-18 03:09:30,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cdc5d4203/e74e64e4426b4bc5bd7b80a8055eeec4/FLAG296af2c23 [2024-10-18 03:09:30,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cdc5d4203/e74e64e4426b4bc5bd7b80a8055eeec4 [2024-10-18 03:09:30,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 03:09:30,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 03:09:30,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 03:09:30,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 03:09:30,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 03:09:30,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:09:30" (1/1) ... [2024-10-18 03:09:30,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6775762f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:30, skipping insertion in model container [2024-10-18 03:09:30,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:09:30" (1/1) ... [2024-10-18 03:09:30,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 03:09:30,999 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-18 03:09:31,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:09:31,009 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 03:09:31,027 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-18 03:09:31,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:09:31,040 INFO L204 MainTranslator]: Completed translation [2024-10-18 03:09:31,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31 WrapperNode [2024-10-18 03:09:31,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 03:09:31,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 03:09:31,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 03:09:31,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 03:09:31,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,072 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-18 03:09:31,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 03:09:31,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 03:09:31,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 03:09:31,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 03:09:31,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 03:09:31,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 03:09:31,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 03:09:31,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 03:09:31,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (1/1) ... [2024-10-18 03:09:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:09:31,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:09:31,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 03:09:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 03:09:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 03:09:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 03:09:31,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 03:09:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 03:09:31,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 03:09:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-18 03:09:31,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-18 03:09:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-18 03:09:31,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-18 03:09:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 03:09:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 03:09:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 03:09:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 03:09:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 03:09:31,160 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 03:09:31,232 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 03:09:31,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 03:09:31,394 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 03:09:31,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 03:09:31,516 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 03:09:31,516 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-18 03:09:31,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:09:31 BoogieIcfgContainer [2024-10-18 03:09:31,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 03:09:31,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 03:09:31,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 03:09:31,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 03:09:31,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 03:09:30" (1/3) ... [2024-10-18 03:09:31,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6902302e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:09:31, skipping insertion in model container [2024-10-18 03:09:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:09:31" (2/3) ... [2024-10-18 03:09:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6902302e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:09:31, skipping insertion in model container [2024-10-18 03:09:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:09:31" (3/3) ... [2024-10-18 03:09:31,524 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-18 03:09:31,536 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 03:09:31,536 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 03:09:31,536 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 03:09:31,584 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 03:09:31,616 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:09:31,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:09:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:09:31,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 03:09:31,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 03:09:31,687 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:09:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:09:31,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 03:09:31,704 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;@70d4e225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 03:09:31,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-18 03:09:33,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:09:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1928252762, now seen corresponding path program 1 times [2024-10-18 03:09:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:34,130 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-18 03:09:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:34,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:34,393 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-18 03:09:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:09:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-18 03:09:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:09:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430520347] [2024-10-18 03:09:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-18 03:09:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:09:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430520347] [2024-10-18 03:09:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430520347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:09:34,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:09:34,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 03:09:34,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444909479] [2024-10-18 03:09:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:09:34,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 03:09:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:09:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-18 03:09:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-18 03:09:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:34,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:09:34,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:09:34,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:35,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-18 03:09:35,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:09:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:09:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-18 03:09:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:09:35,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979072043] [2024-10-18 03:09:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-18 03:09:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:09:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979072043] [2024-10-18 03:09:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979072043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:09:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491089955] [2024-10-18 03:09:37,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 03:09:37,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:09:37,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:09:37,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 03:09:37,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 03:09:37,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:09:37,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 03:09:37,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:09:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-18 03:09:37,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:09:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491089955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:09:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 03:09:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-18 03:09:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610649581] [2024-10-18 03:09:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:09:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 03:09:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:09:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 03:09:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-18 03:09:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:37,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:09:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:09:37,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:37,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:37,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 03:09:38,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:38,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:09:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179361, now seen corresponding path program 1 times [2024-10-18 03:09:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-18 03:09:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-18 03:09:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:09:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-18 03:09:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:09:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123524496] [2024-10-18 03:09:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 03:09:39,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:09:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123524496] [2024-10-18 03:09:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123524496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:09:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672852778] [2024-10-18 03:09:39,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 03:09:39,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:39,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:09:39,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:09:39,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 03:09:39,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-18 03:09:39,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:09:39,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-18 03:09:39,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:09:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 03:09:39,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:09:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-18 03:09:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672852778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:09:39,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:09:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-18 03:09:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540726145] [2024-10-18 03:09:39,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:09:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 03:09:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:09:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 03:09:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-18 03:09:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:39,563 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:09:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:09:39,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:39,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:39,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:09:40,331 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-18 03:09:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:40,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:09:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371780, now seen corresponding path program 1 times [2024-10-18 03:09:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:09:40,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:09:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:09:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash 148797656, now seen corresponding path program 1 times [2024-10-18 03:09:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:41,442 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-18 03:09:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:41,685 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-18 03:09:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:09:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-18 03:09:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:09:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406450364] [2024-10-18 03:09:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-18 03:09:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:09:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406450364] [2024-10-18 03:09:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406450364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:09:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037659685] [2024-10-18 03:09:46,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 03:09:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:09:46,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:09:46,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 03:09:47,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 03:09:47,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:09:47,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 03:09:47,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:09:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-18 03:09:47,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:09:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037659685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:09:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 03:09:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-18 03:09:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281049803] [2024-10-18 03:09:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:09:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 03:09:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:09:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 03:09:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-18 03:09:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:47,135 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:09:47,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:09:47,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:47,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:47,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:09:47,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:09:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:09:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:09:47,505 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-18 03:09:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:09:47,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:09:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash -396186434, now seen corresponding path program 1 times [2024-10-18 03:09:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:09:48,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:09:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:09:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497045, now seen corresponding path program 1 times [2024-10-18 03:09:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:09:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:09:59,966 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-18 03:09:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:09:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:09,493 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-18 03:10:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash 25582888, now seen corresponding path program 1 times [2024-10-18 03:10:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:10,203 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-18 03:10:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:10,658 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-18 03:10:10,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:10:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-18 03:10:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:10:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888412076] [2024-10-18 03:10:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-18 03:10:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:10:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888412076] [2024-10-18 03:10:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888412076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:10:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104813161] [2024-10-18 03:10:11,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-18 03:10:11,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:10:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:10:11,310 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:10:11,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 03:10:11,521 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-18 03:10:11,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:10:11,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 03:10:11,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:10:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-18 03:10:11,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:10:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-18 03:10:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104813161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:10:11,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:10:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-18 03:10:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220572711] [2024-10-18 03:10:11,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:10:11,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 03:10:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:10:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 03:10:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-18 03:10:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:10:11,738 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:10:11,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:10:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:10:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:10:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:10:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:10:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 03:10:12,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-18 03:10:12,632 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,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-10-18 03:10:12,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:10:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash -595742167, now seen corresponding path program 1 times [2024-10-18 03:10:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:10:13,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:10:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:10:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497006, now seen corresponding path program 1 times [2024-10-18 03:10:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:22,328 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-18 03:10:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:31,376 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-18 03:10:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:10:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-18 03:10:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:10:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429050405] [2024-10-18 03:10:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:10:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:10:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:10:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-18 03:10:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:10:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429050405] [2024-10-18 03:10:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429050405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:10:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613673292] [2024-10-18 03:10:44,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-18 03:10:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:10:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:10:44,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:10:44,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-18 03:10:44,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-18 03:10:44,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:10:44,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-18 03:10:44,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:10:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-18 03:10:58,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:11:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-18 03:11:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613673292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:11:05,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:11:05,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-18 03:11:05,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762414824] [2024-10-18 03:11:05,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:11:05,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-18 03:11:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:11:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-18 03:11:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-18 03:11:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:11:05,736 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:11:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 03:11:05,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:12:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:12:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 03:12:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-18 03:12:07,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 03:12:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-18 03:12:07,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:12:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash 740751567, now seen corresponding path program 1 times [2024-10-18 03:12:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:08,072 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-18 03:12:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:08,576 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-18 03:12:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:12:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-18 03:12:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:12:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921663070] [2024-10-18 03:12:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-18 03:12:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:12:09,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921663070] [2024-10-18 03:12:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921663070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:12:09,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586370208] [2024-10-18 03:12:09,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-18 03:12:09,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:12:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:12:09,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:12:09,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-18 03:12:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:09,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-18 03:12:09,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:12:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-18 03:12:09,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:12:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-18 03:12:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586370208] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:12:09,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:12:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-18 03:12:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120066055] [2024-10-18 03:12:09,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:12:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-18 03:12:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:12:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-18 03:12:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-18 03:12:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:12:09,999 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:12:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-18 03:12:09,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-18 03:12:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 03:12:11,713 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-18 03:12:11,899 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,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23 [2024-10-18 03:12:11,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 03:12:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2049167302, now seen corresponding path program 1 times [2024-10-18 03:12:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:20,473 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-18 03:12:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:26,842 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-18 03:12:26,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:12:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-18 03:12:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:12:26,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221401942] [2024-10-18 03:12:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:12:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:12:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:12:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-18 03:12:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:12:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221401942] [2024-10-18 03:12:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221401942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:12:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345037492] [2024-10-18 03:12:33,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 03:12:33,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:12:33,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:12:33,694 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 03:12:33,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-18 03:12:33,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 03:12:33,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 03:12:33,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-18 03:12:33,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:12:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-18 03:12:41,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:17:34,822 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* 36 c_~p1~0)) (.cse3 (* (- 36) c_~p1~0)) (.cse0 (< 36 c_~n2~0)) (.cse47 (* c_~p1~0 (- 39))) (.cse46 (* 39 c_~p1~0)) (.cse50 (< 39 c_~n2~0)) (.cse17 (= 40 c_~n2~0)) (.cse29 (< 42 c_~n2~0)) (.cse32 (* 41 c_~p1~0)) (.cse31 (* (- 41) c_~p1~0)) (.cse30 (= 42 c_~n2~0)) (.cse36 (* c_~p1~0 (- 42))) (.cse35 (* 42 c_~p1~0)) (.cse39 (= 41 c_~n2~0)) (.cse18 (< c_~n2~0 43)) (.cse23 (= c_~n2~0 43)) (.cse19 (* 44 c_~p1~0)) (.cse20 (* (- 44) c_~p1~0)) (.cse28 (< 43 c_~n2~0)) (.cse27 (* c_~p1~0 43)) (.cse26 (* c_~p1~0 (- 43))) (.cse40 (* (- 40) c_~p1~0)) (.cse41 (* 40 c_~p1~0)) (.cse44 (< 40 c_~n2~0)) (.cse45 (= c_~n2~0 39)) (.cse51 (< c_~n2~0 39)) (.cse16 (< 38 c_~n2~0)) (.cse6 (= c_~n2~0 37)) (.cse9 (* c_~p1~0 38)) (.cse10 (* (- 38) c_~p1~0)) (.cse11 (= c_~n2~0 38)) (.cse13 (* c_~p1~0 37)) (.cse12 (* (- 37) c_~p1~0)) (.cse52 (= c_~n2~0 36))) (and (or (let ((.cse1 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or .cse0 (and (forall ((v_z_89 Int)) (or (< 4294967295 (+ .cse1 v_z_89)) (= (+ .cse2 (* (div (+ (* v_z_89 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse1) (+ (* v_z_89 47985151859) c_~p2~0)) (< v_z_89 0))) (forall ((v_z_89 Int)) (let ((.cse4 (+ .cse2 (* (div (+ (* v_z_89 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse1)) (.cse5 (* v_z_89 47985151859))) (or (= .cse4 (+ .cse5 4294967296 c_~p2~0)) (< 4294967295 v_z_89) (= .cse4 (+ .cse5 c_~p2~0)) (< v_z_89 0)))) (forall ((v_z_89 Int)) (or (= (+ .cse2 (* (div (+ (* v_z_89 47985151860) c_~p2~0 .cse3) 4294967296) 4294967296) .cse1) (+ (* v_z_89 47985151859) 4294967296 c_~p2~0)) (< 4294967295 v_z_89) (< (+ .cse1 v_z_89) 4294967296))))) (or (and (or (and (or .cse6 (and (forall ((v_z_96 Int)) (let ((.cse7 (+ .cse9 .cse1 (* 4294967296 (div (+ (* 50650993630 v_z_96) .cse10 c_~p2~0) 4294967296)))) (.cse8 (* v_z_96 50650993629))) (or (= .cse7 (+ .cse8 4294967296 c_~p2~0)) (< v_z_96 0) (= .cse7 (+ .cse8 c_~p2~0)) (< 4294967295 v_z_96)))) (forall ((v_z_96 Int)) (or (= (+ .cse9 .cse1 (* 4294967296 (div (+ (* 50650993630 v_z_96) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_96 50650993629) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_96) 4294967296) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (< v_z_96 0) (= (+ .cse9 .cse1 (* 4294967296 (div (+ (* 50650993630 v_z_96) .cse10 c_~p2~0) 4294967296))) (+ (* v_z_96 50650993629) c_~p2~0)) (< 4294967295 (+ .cse1 v_z_96)))))) (or .cse11 (and (forall ((v_z_97 Int)) (or (< 4294967295 v_z_97) (= (+ (* v_z_97 49318072744) 4294967296 c_~p2~0) (+ (* (div (+ (* v_z_97 49318072745) .cse12 c_~p2~0) 4294967296) 4294967296) .cse1 .cse13)) (< (+ .cse1 v_z_97) 4294967296))) (forall ((v_z_97 Int)) (let ((.cse14 (* v_z_97 49318072744)) (.cse15 (+ (* (div (+ (* v_z_97 49318072745) .cse12 c_~p2~0) 4294967296) 4294967296) .cse1 .cse13))) (or (< 4294967295 v_z_97) (= (+ .cse14 4294967296 c_~p2~0) .cse15) (< v_z_97 0) (= (+ .cse14 c_~p2~0) .cse15)))) (forall ((v_z_97 Int)) (or (< v_z_97 0) (= (+ (* v_z_97 49318072744) c_~p2~0) (+ (* (div (+ (* v_z_97 49318072745) .cse12 c_~p2~0) 4294967296) 4294967296) .cse1 .cse13)) (< 4294967295 (+ .cse1 v_z_97))))))) .cse16) (or (and (or (and (or .cse17 (and (or .cse18 (and (or (and (forall ((v_z_94 Int)) (or (< v_z_94 0) (= (+ .cse1 .cse19 (* (div (+ (* v_z_94 58648518940) .cse20 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_94 58648518939) c_~p2~0)) (< 4294967295 (+ .cse1 v_z_94)))) (forall ((v_z_94 Int)) (or (< (+ .cse1 v_z_94) 4294967296) (= (+ (* v_z_94 58648518939) 4294967296 c_~p2~0) (+ .cse1 .cse19 (* (div (+ (* v_z_94 58648518940) .cse20 c_~p2~0) 4294967296) 4294967296))) (< 4294967295 v_z_94))) (forall ((v_z_94 Int)) (let ((.cse22 (* v_z_94 58648518939)) (.cse21 (+ .cse1 .cse19 (* (div (+ (* v_z_94 58648518940) .cse20 c_~p2~0) 4294967296) 4294967296)))) (or (< v_z_94 0) (= .cse21 (+ .cse22 c_~p2~0)) (= (+ .cse22 4294967296 c_~p2~0) .cse21) (< 4294967295 v_z_94))))) .cse23) (or (and (forall ((v_z_93 Int)) (let ((.cse24 (* v_z_93 57315598054)) (.cse25 (+ .cse1 (* 4294967296 (div (+ .cse26 c_~p2~0 (* 57315598055 v_z_93)) 4294967296)) .cse27))) (or (= (+ .cse24 c_~p2~0) .cse25) (= (+ .cse24 4294967296 c_~p2~0) .cse25) (< v_z_93 0) (< 4294967295 v_z_93)))) (forall ((v_z_93 Int)) (or (= (+ (* v_z_93 57315598054) c_~p2~0) (+ .cse1 (* 4294967296 (div (+ .cse26 c_~p2~0 (* 57315598055 v_z_93)) 4294967296)) .cse27)) (< v_z_93 0) (< 4294967295 (+ .cse1 v_z_93)))) (forall ((v_z_93 Int)) (or (< (+ .cse1 v_z_93) 4294967296) (= (+ (* v_z_93 57315598054) 4294967296 c_~p2~0) (+ .cse1 (* 4294967296 (div (+ .cse26 c_~p2~0 (* 57315598055 v_z_93)) 4294967296)) .cse27)) (< 4294967295 v_z_93)))) .cse28))) (or .cse29 (and (or .cse30 (and (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse31 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse32 .cse1) (+ (* 54649756284 v_z_92) c_~p2~0)) (< 4294967295 (+ .cse1 v_z_92)) (< v_z_92 0))) (forall ((v_z_92 Int)) (let ((.cse33 (+ (* (div (+ .cse31 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse32 .cse1)) (.cse34 (* 54649756284 v_z_92))) (or (= .cse33 (+ .cse34 c_~p2~0)) (= .cse33 (+ .cse34 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< v_z_92 0)))) (forall ((v_z_92 Int)) (or (= (+ (* (div (+ .cse31 (* 54649756285 v_z_92) c_~p2~0) 4294967296) 4294967296) .cse32 .cse1) (+ (* 54649756284 v_z_92) 4294967296 c_~p2~0)) (< 4294967295 v_z_92) (< (+ .cse1 v_z_92) 4294967296))))) (or (and (forall ((v_z_91 Int)) (or (= (+ c_~p2~0 (* 55982677169 v_z_91)) (+ .cse1 .cse35 (* 4294967296 (div (+ (* 55982677170 v_z_91) .cse36 c_~p2~0) 4294967296)))) (< v_z_91 0) (< 4294967295 (+ .cse1 v_z_91)))) (forall ((v_z_91 Int)) (let ((.cse38 (+ .cse1 .cse35 (* 4294967296 (div (+ (* 55982677170 v_z_91) .cse36 c_~p2~0) 4294967296)))) (.cse37 (* 55982677169 v_z_91))) (or (= (+ c_~p2~0 .cse37) .cse38) (= .cse38 (+ 4294967296 c_~p2~0 .cse37)) (< v_z_91 0) (< 4294967295 v_z_91)))) (forall ((v_z_91 Int)) (or (= (+ .cse1 .cse35 (* 4294967296 (div (+ (* 55982677170 v_z_91) .cse36 c_~p2~0) 4294967296))) (+ 4294967296 c_~p2~0 (* 55982677169 v_z_91))) (< 4294967295 v_z_91) (< (+ .cse1 v_z_91) 4294967296)))) .cse39))))) (or (and (forall ((v_z_95 Int)) (or (< 4294967295 (+ .cse1 v_z_95)) (= (+ (* v_z_95 53316835399) c_~p2~0) (+ .cse1 (* 4294967296 (div (+ (* v_z_95 53316835400) c_~p2~0 .cse40) 4294967296)) .cse41)) (< v_z_95 0))) (forall ((v_z_95 Int)) (or (< (+ .cse1 v_z_95) 4294967296) (= (+ .cse1 (* 4294967296 (div (+ (* v_z_95 53316835400) c_~p2~0 .cse40) 4294967296)) .cse41) (+ 4294967296 (* v_z_95 53316835399) c_~p2~0)) (< 4294967295 v_z_95))) (forall ((v_z_95 Int)) (let ((.cse43 (+ .cse1 (* 4294967296 (div (+ (* v_z_95 53316835400) c_~p2~0 .cse40) 4294967296)) .cse41)) (.cse42 (* v_z_95 53316835399))) (or (= (+ .cse42 c_~p2~0) .cse43) (= .cse43 (+ 4294967296 .cse42 c_~p2~0)) (< 4294967295 v_z_95) (< v_z_95 0))))) .cse44)) .cse45) (or (and (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 (+ .cse1 v_z_90)) (= (+ .cse1 .cse46 (* (div (+ .cse47 (* 51983914515 v_z_90) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 51983914514) c_~p2~0)))) (forall ((v_z_90 Int)) (let ((.cse48 (+ .cse1 .cse46 (* (div (+ .cse47 (* 51983914515 v_z_90) c_~p2~0) 4294967296) 4294967296))) (.cse49 (* v_z_90 51983914514))) (or (< v_z_90 0) (< 4294967295 v_z_90) (= .cse48 (+ .cse49 c_~p2~0)) (= .cse48 (+ .cse49 4294967296 c_~p2~0))))) (forall ((v_z_90 Int)) (or (< (+ .cse1 v_z_90) 4294967296) (< 4294967295 v_z_90) (= (+ .cse1 .cse46 (* (div (+ .cse47 (* 51983914515 v_z_90) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_90 51983914514) 4294967296 c_~p2~0))))) .cse50)) .cse51)) .cse52))) (not (= 29 c_~n1~0))) (or (not (= c_~n1~0 27)) (let ((.cse53 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_80) c_~p2~0 .cse3) 4294967296) 4294967296) .cse53) (+ (* v_z_80 62992853675) 4294967296 c_~p2~0)) (< (+ v_z_80 .cse53) 4294967296))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse53)) (< v_z_80 0) (= (+ .cse2 (* (div (+ (* 62992853676 v_z_80) c_~p2~0 .cse3) 4294967296) 4294967296) .cse53) (+ (* v_z_80 62992853675) c_~p2~0)))) (forall ((v_z_80 Int)) (let ((.cse54 (+ .cse2 (* (div (+ (* 62992853676 v_z_80) c_~p2~0 .cse3) 4294967296) 4294967296) .cse53)) (.cse55 (* v_z_80 62992853675))) (or (< 4294967295 v_z_80) (= .cse54 (+ .cse55 4294967296 c_~p2~0)) (< v_z_80 0) (= .cse54 (+ .cse55 c_~p2~0)))))) .cse0) (or (and (or (and (or (and (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse53)) (= (+ (* (div (+ .cse47 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse46 .cse53) (+ (* 68242258148 v_z_86) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse53) 4294967296) (= (+ (* (div (+ .cse47 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse46 .cse53) (+ (* 68242258148 v_z_86) 4294967296 c_~p2~0)) (< 4294967295 v_z_86))) (forall ((v_z_86 Int)) (let ((.cse56 (+ (* (div (+ .cse47 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse46 .cse53)) (.cse57 (* 68242258148 v_z_86))) (or (< v_z_86 0) (= .cse56 (+ .cse57 c_~p2~0)) (= .cse56 (+ .cse57 4294967296 c_~p2~0)) (< 4294967295 v_z_86))))) .cse50) (or (and (or .cse17 (and (or .cse29 (and (or (and (forall ((v_z_82 Int)) (or (< 4294967295 (+ v_z_82 .cse53)) (= (+ .cse32 (* (div (+ (* v_z_82 71741861131) .cse31 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_82 71741861130) c_~p2~0)) (< v_z_82 0))) (forall ((v_z_82 Int)) (let ((.cse58 (+ .cse32 (* (div (+ (* v_z_82 71741861131) .cse31 c_~p2~0) 4294967296) 4294967296) .cse53)) (.cse59 (* v_z_82 71741861130))) (or (= .cse58 (+ .cse59 4294967296 c_~p2~0)) (< 4294967295 v_z_82) (= .cse58 (+ .cse59 c_~p2~0)) (< v_z_82 0)))) (forall ((v_z_82 Int)) (or (= (+ .cse32 (* (div (+ (* v_z_82 71741861131) .cse31 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_82 71741861130) 4294967296 c_~p2~0)) (< (+ v_z_82 .cse53) 4294967296) (< 4294967295 v_z_82)))) .cse30) (or (and (forall ((v_z_83 Int)) (let ((.cse60 (* v_z_83 73491662621)) (.cse61 (+ (* 4294967296 (div (+ (* 73491662622 v_z_83) .cse36 c_~p2~0) 4294967296)) .cse35 .cse53))) (or (= (+ 4294967296 .cse60 c_~p2~0) .cse61) (< 4294967295 v_z_83) (= (+ .cse60 c_~p2~0) .cse61) (< v_z_83 0)))) (forall ((v_z_83 Int)) (or (= (+ 4294967296 (* v_z_83 73491662621) c_~p2~0) (+ (* 4294967296 (div (+ (* 73491662622 v_z_83) .cse36 c_~p2~0) 4294967296)) .cse35 .cse53)) (< 4294967295 v_z_83) (< (+ v_z_83 .cse53) 4294967296))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse53)) (= (+ (* v_z_83 73491662621) c_~p2~0) (+ (* 4294967296 (div (+ (* 73491662622 v_z_83) .cse36 c_~p2~0) 4294967296)) .cse35 .cse53)) (< v_z_83 0)))) .cse39))) (or .cse18 (and (or .cse23 (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse53) 4294967296) (= (+ 4294967296 c_~p2~0 (* v_z_84 76991265603)) (+ .cse19 (* (div (+ (* v_z_84 76991265604) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53)))) (forall ((v_z_84 Int)) (let ((.cse63 (* v_z_84 76991265603)) (.cse62 (+ .cse19 (* (div (+ (* v_z_84 76991265604) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53))) (or (= .cse62 (+ c_~p2~0 .cse63)) (< 4294967295 v_z_84) (< v_z_84 0) (= (+ 4294967296 c_~p2~0 .cse63) .cse62)))) (forall ((v_z_84 Int)) (or (= (+ .cse19 (* (div (+ (* v_z_84 76991265604) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53) (+ c_~p2~0 (* v_z_84 76991265603))) (< v_z_84 0) (< 4294967295 (+ v_z_84 .cse53)))))) (or .cse28 (and (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ .cse27 .cse53 (* (div (+ .cse26 (* v_z_85 75241464113) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_85 75241464112) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse53) 4294967296))) (forall ((v_z_85 Int)) (or (< 4294967295 (+ v_z_85 .cse53)) (< v_z_85 0) (= (+ .cse27 .cse53 (* (div (+ .cse26 (* v_z_85 75241464113) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_85 75241464112) c_~p2~0)))) (forall ((v_z_85 Int)) (let ((.cse64 (+ .cse27 .cse53 (* (div (+ .cse26 (* v_z_85 75241464113) c_~p2~0) 4294967296) 4294967296))) (.cse65 (* v_z_85 75241464112))) (or (< 4294967295 v_z_85) (< v_z_85 0) (= .cse64 (+ .cse65 4294967296 c_~p2~0)) (= .cse64 (+ .cse65 c_~p2~0))))))))))) (or (and (forall ((v_z_81 Int)) (or (= (+ (* (div (+ (* v_z_81 69992059640) c_~p2~0 .cse40) 4294967296) 4294967296) .cse53 .cse41) (+ (* 69992059639 v_z_81) c_~p2~0)) (< 4294967295 (+ v_z_81 .cse53)) (< v_z_81 0))) (forall ((v_z_81 Int)) (let ((.cse66 (+ (* (div (+ (* v_z_81 69992059640) c_~p2~0 .cse40) 4294967296) 4294967296) .cse53 .cse41)) (.cse67 (* 69992059639 v_z_81))) (or (= .cse66 (+ .cse67 c_~p2~0)) (< v_z_81 0) (< 4294967295 v_z_81) (= .cse66 (+ .cse67 4294967296 c_~p2~0))))) (forall ((v_z_81 Int)) (or (< 4294967295 v_z_81) (< (+ v_z_81 .cse53) 4294967296) (= (+ (* (div (+ (* v_z_81 69992059640) c_~p2~0 .cse40) 4294967296) 4294967296) .cse53 .cse41) (+ (* 69992059639 v_z_81) 4294967296 c_~p2~0))))) .cse44)) .cse45)) .cse51) (or .cse16 (and (or .cse6 (and (forall ((v_z_88 Int)) (or (= (+ (* v_z_88 66492456657) 4294967296 c_~p2~0) (+ .cse9 .cse53 (* 4294967296 (div (+ (* 66492456658 v_z_88) .cse10 c_~p2~0) 4294967296)))) (< (+ v_z_88 .cse53) 4294967296) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse68 (* v_z_88 66492456657)) (.cse69 (+ .cse9 .cse53 (* 4294967296 (div (+ (* 66492456658 v_z_88) .cse10 c_~p2~0) 4294967296))))) (or (= (+ .cse68 c_~p2~0) .cse69) (= (+ .cse68 4294967296 c_~p2~0) .cse69) (< v_z_88 0) (< 4294967295 v_z_88)))) (forall ((v_z_88 Int)) (or (= (+ (* v_z_88 66492456657) c_~p2~0) (+ .cse9 .cse53 (* 4294967296 (div (+ (* 66492456658 v_z_88) .cse10 c_~p2~0) 4294967296)))) (< v_z_88 0) (< 4294967295 (+ v_z_88 .cse53)))))) (or .cse11 (and (forall ((v_z_87 Int)) (let ((.cse70 (* v_z_87 64742655166)) (.cse71 (+ .cse13 (* (div (+ (* v_z_87 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse53))) (or (= (+ .cse70 c_~p2~0) .cse71) (< v_z_87 0) (= (+ 4294967296 .cse70 c_~p2~0) .cse71) (< 4294967295 v_z_87)))) (forall ((v_z_87 Int)) (or (< (+ v_z_87 .cse53) 4294967296) (= (+ 4294967296 (* v_z_87 64742655166) c_~p2~0) (+ .cse13 (* (div (+ (* v_z_87 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse53)) (< 4294967295 v_z_87))) (forall ((v_z_87 Int)) (or (= (+ (* v_z_87 64742655166) c_~p2~0) (+ .cse13 (* (div (+ (* v_z_87 64742655167) .cse12 c_~p2~0) 4294967296) 4294967296) .cse53)) (< v_z_87 0) (< 4294967295 (+ v_z_87 .cse53))))))))) .cse52)))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-18 03:18:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 970 refuted. 3 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-18 03:18:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345037492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:18:02,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:18:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-18 03:18:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491479728] [2024-10-18 03:18:02,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:18:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-18 03:18:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:18:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-18 03:18:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21925, Unknown=9, NotChecked=324, Total=27060 [2024-10-18 03:18:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:18:02,151 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:18:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 03:18:02,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:18:02,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:18:02,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:18:02,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:18:02,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-18 03:18:02,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-18 03:18:02,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 03:18:02,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:20:36,284 WARN L286 SmtUtils]: Spent 25.76s on a formula simplification. DAG size of input: 298 DAG size of output: 142 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 03:20:38,890 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-18 03:21:20,440 WARN L286 SmtUtils]: Spent 32.97s on a formula simplification. DAG size of input: 298 DAG size of output: 196 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 03:21:22,519 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-18 03:21:25,523 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-18 03:21:27,536 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-18 03:21:45,960 WARN L286 SmtUtils]: Spent 14.16s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 03:22:03,114 WARN L286 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 298 DAG size of output: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 03:22:05,125 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-18 03:22:07,141 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-18 03:22:09,537 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-18 03:22:11,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 03:22:13,247 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-18 03:22:15,513 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-18 03:22:17,517 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-18 03:22:19,552 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-18 03:22:20,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 03:22:22,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 03:22:24,306 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-18 03:22:59,137 WARN L286 SmtUtils]: Spent 30.76s on a formula simplification. DAG size of input: 189 DAG size of output: 179 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 03:23:01,149 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-18 03:23:02,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15