./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 213 -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 213 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 23:39:25,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 23:39:25,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 23:39:25,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 23:39:25,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 23:39:25,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 23:39:25,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 23:39:25,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 23:39:25,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 23:39:25,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 23:39:25,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 23:39:25,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 23:39:25,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 23:39:25,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 23:39:25,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 23:39:25,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 23:39:25,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 23:39:25,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 23:39:25,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 23:39:25,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 23:39:25,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 23:39:25,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 23:39:25,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 23:39:25,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 23:39:25,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 23:39:25,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 23:39:25,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 23:39:25,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 23:39:25,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 23:39:25,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 23:39:25,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 23:39:25,194 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 23:39:25,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 23:39:25,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 23:39:25,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 23:39:25,195 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 23:39:25,196 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 -> 213 [2024-10-17 23:39:25,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 23:39:25,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 23:39:25,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 23:39:25,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 23:39:25,395 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 23:39:25,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 23:39:26,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 23:39:26,694 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 23:39:26,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 23:39:26,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1d1ac8393/4170cf2e36114339917e36d8b2ad341f/FLAGc77c7d857 [2024-10-17 23:39:26,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1d1ac8393/4170cf2e36114339917e36d8b2ad341f [2024-10-17 23:39:26,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 23:39:26,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 23:39:26,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 23:39:26,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 23:39:26,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 23:39:26,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3108865e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26, skipping insertion in model container [2024-10-17 23:39:26,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 23:39:26,885 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 23:39:26,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 23:39:26,908 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 23:39:26,948 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 23:39:26,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 23:39:26,964 INFO L204 MainTranslator]: Completed translation [2024-10-17 23:39:26,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26 WrapperNode [2024-10-17 23:39:26,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 23:39:26,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 23:39:26,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 23:39:26,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 23:39:26,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,988 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-17 23:39:26,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 23:39:26,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 23:39:26,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 23:39:26,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 23:39:26,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:26,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 23:39:27,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 23:39:27,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 23:39:27,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 23:39:27,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (1/1) ... [2024-10-17 23:39:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 23:39:27,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:27,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 23:39:27,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 23:39:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 23:39:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 23:39:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 23:39:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 23:39:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 23:39:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 23:39:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 23:39:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 23:39:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 23:39:27,075 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 23:39:27,173 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 23:39:27,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 23:39:27,339 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 23:39:27,340 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 23:39:27,460 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 23:39:27,460 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 23:39:27,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:39:27 BoogieIcfgContainer [2024-10-17 23:39:27,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 23:39:27,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 23:39:27,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 23:39:27,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 23:39:27,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:39:26" (1/3) ... [2024-10-17 23:39:27,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e30929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:39:27, skipping insertion in model container [2024-10-17 23:39:27,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:39:26" (2/3) ... [2024-10-17 23:39:27,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e30929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:39:27, skipping insertion in model container [2024-10-17 23:39:27,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:39:27" (3/3) ... [2024-10-17 23:39:27,466 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-17 23:39:27,478 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 23:39:27,478 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 23:39:27,478 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 23:39:27,523 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 23:39:27,550 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 23:39:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 23:39:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:27,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 23:39:27,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 23:39:27,611 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 23:39:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:27,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 23:39:27,631 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;@5bb301d6, 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=213, mConComCheckerConditionCriterion=false [2024-10-17 23:39:27,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 23:39:29,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:29,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-17 23:39:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959650562] [2024-10-17 23:39:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-17 23:39:29,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:39:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959650562] [2024-10-17 23:39:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959650562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 23:39:29,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 23:39:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 23:39:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028969029] [2024-10-17 23:39:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 23:39:29,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 23:39:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:39:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 23:39:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-17 23:39:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:30,016 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:39:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:39:30,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 23:39:30,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458479, now seen corresponding path program 1 times [2024-10-17 23:39:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 23:39:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 23:39:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-17 23:39:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885096629] [2024-10-17 23:39:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 23:39:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:39:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885096629] [2024-10-17 23:39:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885096629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:39:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7268314] [2024-10-17 23:39:36,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 23:39:36,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:36,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:36,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:39:36,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 23:39:36,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 23:39:36,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:39:36,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 23:39:36,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:39:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-17 23:39:36,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 23:39:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7268314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 23:39:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 23:39:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-17 23:39:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71753088] [2024-10-17 23:39:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 23:39:36,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 23:39:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:39:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 23:39:36,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-17 23:39:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:36,341 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:39:36,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:39:36,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:36,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:36,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 23:39:36,822 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,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-10-17 23:39:36,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:36,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-17 23:39:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:36,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914844989] [2024-10-17 23:39:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 23:39:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:39:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914844989] [2024-10-17 23:39:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914844989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:39:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477746429] [2024-10-17 23:39:37,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 23:39:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:37,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:39:37,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 23:39:37,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-17 23:39:37,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:39:37,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 23:39:37,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:39:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 23:39:37,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 23:39:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 23:39:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477746429] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 23:39:37,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 23:39:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-17 23:39:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900348872] [2024-10-17 23:39:37,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 23:39:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 23:39:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:39:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 23:39:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-17 23:39:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:37,518 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:39:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:39:37,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:37,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:37,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:39:38,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 23:39:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:38,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164558, now seen corresponding path program 1 times [2024-10-17 23:39:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:38,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:39:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1493601795, now seen corresponding path program 1 times [2024-10-17 23:39:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:38,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:39:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 999052768, now seen corresponding path program 1 times [2024-10-17 23:39:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 23:39:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 23:39:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-17 23:39:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:39,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699877476] [2024-10-17 23:39:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-17 23:39:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:39:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699877476] [2024-10-17 23:39:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699877476] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:39:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62068073] [2024-10-17 23:39:44,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 23:39:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:44,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:44,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:39:44,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 23:39:44,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 23:39:44,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:39:44,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 23:39:44,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:39:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-17 23:39:44,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 23:39:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62068073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 23:39:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 23:39:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-17 23:39:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257616550] [2024-10-17 23:39:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 23:39:44,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 23:39:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:39:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 23:39:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-17 23:39:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:44,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:39:44,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:39:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:39:44,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:39:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:44,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 23:39:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:44,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164581, now seen corresponding path program 1 times [2024-10-17 23:39:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:45,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:39:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash 25582887, now seen corresponding path program 1 times [2024-10-17 23:39:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 23:39:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:46,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 23:39:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-17 23:39:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948525495] [2024-10-17 23:39:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:39:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 23:39:47,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:39:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948525495] [2024-10-17 23:39:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948525495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:39:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778808579] [2024-10-17 23:39:47,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-17 23:39:47,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:39:47,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:39:47,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:39:47,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 23:39:47,468 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-17 23:39:47,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:39:47,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 23:39:47,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:39:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-17 23:39:47,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 23:39:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 23:39:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778808579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 23:39:47,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 23:39:47,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-17 23:39:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991399064] [2024-10-17 23:39:47,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 23:39:47,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 23:39:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:39:47,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 23:39:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-17 23:39:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:47,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:39:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:39:47,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:47,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:47,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:39:47,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:47,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:39:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:39:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:39:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 23:39:48,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 23:39:48,560 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2024-10-17 23:39:48,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:39:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash -595742168, now seen corresponding path program 1 times [2024-10-17 23:39:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:48,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:39:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 83246355, now seen corresponding path program 1 times [2024-10-17 23:39:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:49,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:39:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:39:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:39:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-17 23:39:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:39:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221094227] [2024-10-17 23:39:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:39:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:39:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:40:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 23:40:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:40:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221094227] [2024-10-17 23:40:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221094227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:40:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543060634] [2024-10-17 23:40:02,503 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-17 23:40:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:40:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:40:02,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:40:02,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 23:40:02,882 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-17 23:40:02,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:40:02,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-17 23:40:02,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:40:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-17 23:40:22,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 23:40:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 23:40:30,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543060634] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 23:40:30,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 23:40:30,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-17 23:40:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706573001] [2024-10-17 23:40:30,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 23:40:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-17 23:40:30,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:40:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-17 23:40:30,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-17 23:40:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:40:30,223 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:40:30,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:40:30,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:40:30,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:40:30,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:40:30,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:40:30,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 23:40:30,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:40:58,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 23:41:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-17 23:41:50,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 23:41:50,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-10-17 23:41:50,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:41:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:41:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-17 23:41:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:41:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903088054] [2024-10-17 23:41:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:41:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:41:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:41:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 23:41:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:41:51,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903088054] [2024-10-17 23:41:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903088054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:41:51,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680639568] [2024-10-17 23:41:51,206 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-17 23:41:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:41:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:41:51,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:41:51,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 23:41:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:41:51,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-17 23:41:51,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:41:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 23:41:51,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 23:41:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-17 23:41:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680639568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 23:41:52,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 23:41:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-17 23:41:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278667203] [2024-10-17 23:41:52,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 23:41:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-17 23:41:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:41:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-17 23:41:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-17 23:41:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:41:52,112 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:41:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-17 23:41:52,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 23:41:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-17 23:41:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 23:41:53,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-17 23:41:54,068 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,SelfDestructingSolverStorable17 [2024-10-17 23:41:54,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 23:41:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 916806539, now seen corresponding path program 1 times [2024-10-17 23:41:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:41:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:41:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:41:54,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 23:41:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 23:41:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 23:41:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-17 23:41:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 23:41:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115225328] [2024-10-17 23:41:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 23:41:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 23:41:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 23:42:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-17 23:42:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 23:42:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115225328] [2024-10-17 23:42:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115225328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 23:42:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126463053] [2024-10-17 23:42:01,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 23:42:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 23:42:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 23:42:01,364 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 23:42:01,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 23:42:01,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 23:42:01,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 23:42:01,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 23:42:01,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 23:42:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-17 23:42:11,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 23:46:33,180 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (* 36 c_~p1~0)) (.cse2 (* (- 36) c_~p1~0)) (.cse5 (< 36 c_~n2~0)) (.cse48 (* c_~p1~0 (- 39))) (.cse47 (* 39 c_~p1~0)) (.cse51 (< 39 c_~n2~0)) (.cse45 (< 40 c_~n2~0)) (.cse41 (* (- 40) c_~p1~0)) (.cse42 (* 40 c_~p1~0)) (.cse40 (= 40 c_~n2~0)) (.cse18 (< 42 c_~n2~0)) (.cse24 (= 42 c_~n2~0)) (.cse25 (* 41 c_~p1~0)) (.cse26 (* (- 41) c_~p1~0)) (.cse19 (= 41 c_~n2~0)) (.cse21 (* 42 c_~p1~0)) (.cse20 (* c_~p1~0 (- 42))) (.cse29 (< c_~n2~0 43)) (.cse30 (* c_~p1~0 (- 43))) (.cse31 (* c_~p1~0 43)) (.cse34 (< 43 c_~n2~0)) (.cse36 (* 44 c_~p1~0)) (.cse37 (* (- 44) c_~p1~0)) (.cse35 (= c_~n2~0 43)) (.cse46 (= c_~n2~0 39)) (.cse17 (< c_~n2~0 39)) (.cse6 (< 38 c_~n2~0)) (.cse13 (* c_~p1~0 37)) (.cse12 (* (- 37) c_~p1~0)) (.cse16 (= c_~n2~0 38)) (.cse8 (* c_~p1~0 38)) (.cse9 (* (- 38) c_~p1~0)) (.cse7 (= c_~n2~0 37)) (.cse52 (= c_~n2~0 36))) (and (or (let ((.cse1 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_75 Int)) (or (= (+ (* v_z_75 47985151859) c_~p2~0) (+ .cse0 .cse1 (* (div (+ (* v_z_75 47985151860) c_~p2~0 .cse2) 4294967296) 4294967296))) (< v_z_75 0) (< 4294967295 (+ .cse1 v_z_75)))) (forall ((v_z_75 Int)) (let ((.cse3 (* v_z_75 47985151859)) (.cse4 (+ .cse0 .cse1 (* (div (+ (* v_z_75 47985151860) c_~p2~0 .cse2) 4294967296) 4294967296)))) (or (< 4294967295 v_z_75) (= (+ .cse3 c_~p2~0) .cse4) (= (+ .cse3 4294967296 c_~p2~0) .cse4) (< v_z_75 0)))) (forall ((v_z_75 Int)) (or (< 4294967295 v_z_75) (= (+ (* v_z_75 47985151859) 4294967296 c_~p2~0) (+ .cse0 .cse1 (* (div (+ (* v_z_75 47985151860) c_~p2~0 .cse2) 4294967296) 4294967296))) (< (+ .cse1 v_z_75) 4294967296)))) .cse5) (or (and (or .cse6 (and (or .cse7 (and (forall ((v_z_68 Int)) (or (= (+ .cse8 .cse1 (* (div (+ (* 50650993630 v_z_68) .cse9 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_68 50650993629) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_68) 4294967296) (< 4294967295 v_z_68))) (forall ((v_z_68 Int)) (or (< 4294967295 (+ .cse1 v_z_68)) (< v_z_68 0) (= (+ .cse8 .cse1 (* (div (+ (* 50650993630 v_z_68) .cse9 c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_68 50650993629) c_~p2~0)))) (forall ((v_z_68 Int)) (let ((.cse10 (+ .cse8 .cse1 (* (div (+ (* 50650993630 v_z_68) .cse9 c_~p2~0) 4294967296) 4294967296))) (.cse11 (* v_z_68 50650993629))) (or (= .cse10 (+ .cse11 4294967296 c_~p2~0)) (< 4294967295 v_z_68) (< v_z_68 0) (= .cse10 (+ .cse11 c_~p2~0))))))) (or (and (forall ((v_z_67 Int)) (or (< 4294967295 v_z_67) (= (+ (* v_z_67 49318072744) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ (* v_z_67 49318072745) .cse12 c_~p2~0) 4294967296)) .cse1 .cse13)) (< (+ .cse1 v_z_67) 4294967296))) (forall ((v_z_67 Int)) (or (< 4294967295 (+ .cse1 v_z_67)) (= (+ (* v_z_67 49318072744) c_~p2~0) (+ (* 4294967296 (div (+ (* v_z_67 49318072745) .cse12 c_~p2~0) 4294967296)) .cse1 .cse13)) (< v_z_67 0))) (forall ((v_z_67 Int)) (let ((.cse14 (* v_z_67 49318072744)) (.cse15 (+ (* 4294967296 (div (+ (* v_z_67 49318072745) .cse12 c_~p2~0) 4294967296)) .cse1 .cse13))) (or (< 4294967295 v_z_67) (= (+ .cse14 4294967296 c_~p2~0) .cse15) (= (+ .cse14 c_~p2~0) .cse15) (< v_z_67 0))))) .cse16))) (or .cse17 (and (or (and (or (and (or .cse18 (and (or .cse19 (and (forall ((v_z_73 Int)) (or (= (+ .cse1 (* (div (+ .cse20 (* 55982677170 v_z_73) c_~p2~0) 4294967296) 4294967296) .cse21) (+ (* 55982677169 v_z_73) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_73) 4294967296) (< 4294967295 v_z_73))) (forall ((v_z_73 Int)) (let ((.cse22 (+ .cse1 (* (div (+ .cse20 (* 55982677170 v_z_73) c_~p2~0) 4294967296) 4294967296) .cse21)) (.cse23 (* 55982677169 v_z_73))) (or (< v_z_73 0) (= .cse22 (+ .cse23 4294967296 c_~p2~0)) (< 4294967295 v_z_73) (= .cse22 (+ .cse23 c_~p2~0))))) (forall ((v_z_73 Int)) (or (< 4294967295 (+ .cse1 v_z_73)) (< v_z_73 0) (= (+ .cse1 (* (div (+ .cse20 (* 55982677170 v_z_73) c_~p2~0) 4294967296) 4294967296) .cse21) (+ (* 55982677169 v_z_73) c_~p2~0)))))) (or .cse24 (and (forall ((v_z_74 Int)) (or (< v_z_74 0) (< 4294967295 (+ .cse1 v_z_74)) (= (+ (* 54649756284 v_z_74) c_~p2~0) (+ .cse25 .cse1 (* (div (+ (* 54649756285 v_z_74) .cse26 c_~p2~0) 4294967296) 4294967296))))) (forall ((v_z_74 Int)) (let ((.cse27 (* 54649756284 v_z_74)) (.cse28 (+ .cse25 .cse1 (* (div (+ (* 54649756285 v_z_74) .cse26 c_~p2~0) 4294967296) 4294967296)))) (or (< v_z_74 0) (= (+ .cse27 c_~p2~0) .cse28) (= (+ .cse27 4294967296 c_~p2~0) .cse28) (< 4294967295 v_z_74)))) (forall ((v_z_74 Int)) (or (< (+ .cse1 v_z_74) 4294967296) (= (+ (* 54649756284 v_z_74) 4294967296 c_~p2~0) (+ .cse25 .cse1 (* (div (+ (* 54649756285 v_z_74) .cse26 c_~p2~0) 4294967296) 4294967296))) (< 4294967295 v_z_74))))))) (or .cse29 (and (or (and (forall ((v_z_71 Int)) (or (< 4294967295 (+ .cse1 v_z_71)) (= (+ (* v_z_71 57315598054) c_~p2~0) (+ .cse1 (* (div (+ .cse30 (* 57315598055 v_z_71) c_~p2~0) 4294967296) 4294967296) .cse31)) (< v_z_71 0))) (forall ((v_z_71 Int)) (or (< 4294967295 v_z_71) (< (+ .cse1 v_z_71) 4294967296) (= (+ (* v_z_71 57315598054) 4294967296 c_~p2~0) (+ .cse1 (* (div (+ .cse30 (* 57315598055 v_z_71) c_~p2~0) 4294967296) 4294967296) .cse31)))) (forall ((v_z_71 Int)) (let ((.cse32 (* v_z_71 57315598054)) (.cse33 (+ .cse1 (* (div (+ .cse30 (* 57315598055 v_z_71) c_~p2~0) 4294967296) 4294967296) .cse31))) (or (< 4294967295 v_z_71) (= (+ .cse32 c_~p2~0) .cse33) (< v_z_71 0) (= (+ .cse32 4294967296 c_~p2~0) .cse33))))) .cse34) (or .cse35 (and (forall ((v_z_72 Int)) (or (= (+ (* v_z_72 58648518939) 4294967296 c_~p2~0) (+ .cse1 .cse36 (* (div (+ .cse37 c_~p2~0 (* v_z_72 58648518940)) 4294967296) 4294967296))) (< (+ .cse1 v_z_72) 4294967296) (< 4294967295 v_z_72))) (forall ((v_z_72 Int)) (or (< v_z_72 0) (< 4294967295 (+ .cse1 v_z_72)) (= (+ (* v_z_72 58648518939) c_~p2~0) (+ .cse1 .cse36 (* (div (+ .cse37 c_~p2~0 (* v_z_72 58648518940)) 4294967296) 4294967296))))) (forall ((v_z_72 Int)) (let ((.cse38 (* v_z_72 58648518939)) (.cse39 (+ .cse1 .cse36 (* (div (+ .cse37 c_~p2~0 (* v_z_72 58648518940)) 4294967296) 4294967296)))) (or (< v_z_72 0) (= (+ .cse38 4294967296 c_~p2~0) .cse39) (< 4294967295 v_z_72) (= (+ .cse38 c_~p2~0) .cse39))))))))) .cse40) (or (and (forall ((v_z_70 Int)) (or (< (+ .cse1 v_z_70) 4294967296) (< 4294967295 v_z_70) (= (+ .cse1 (* (div (+ (* v_z_70 53316835400) c_~p2~0 .cse41) 4294967296) 4294967296) .cse42) (+ (* v_z_70 53316835399) 4294967296 c_~p2~0)))) (forall ((v_z_70 Int)) (or (< v_z_70 0) (< 4294967295 (+ .cse1 v_z_70)) (= (+ (* v_z_70 53316835399) c_~p2~0) (+ .cse1 (* (div (+ (* v_z_70 53316835400) c_~p2~0 .cse41) 4294967296) 4294967296) .cse42)))) (forall ((v_z_70 Int)) (let ((.cse44 (* v_z_70 53316835399)) (.cse43 (+ .cse1 (* (div (+ (* v_z_70 53316835400) c_~p2~0 .cse41) 4294967296) 4294967296) .cse42))) (or (< 4294967295 v_z_70) (< v_z_70 0) (= .cse43 (+ .cse44 4294967296 c_~p2~0)) (= (+ .cse44 c_~p2~0) .cse43))))) .cse45)) .cse46) (or (and (forall ((v_z_69 Int)) (or (= (+ (* v_z_69 51983914514) c_~p2~0) (+ .cse1 .cse47 (* (div (+ .cse48 (* 51983914515 v_z_69) c_~p2~0) 4294967296) 4294967296))) (< 4294967295 (+ .cse1 v_z_69)) (< v_z_69 0))) (forall ((v_z_69 Int)) (let ((.cse50 (+ .cse1 .cse47 (* (div (+ .cse48 (* 51983914515 v_z_69) c_~p2~0) 4294967296) 4294967296))) (.cse49 (* v_z_69 51983914514))) (or (= (+ .cse49 c_~p2~0) .cse50) (= .cse50 (+ .cse49 4294967296 c_~p2~0)) (< v_z_69 0) (< 4294967295 v_z_69)))) (forall ((v_z_69 Int)) (or (= (+ .cse1 .cse47 (* (div (+ .cse48 (* 51983914515 v_z_69) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_69 51983914514) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_69) 4294967296) (< 4294967295 v_z_69)))) .cse51)))) .cse52))) (not (= 29 c_~n1~0))) (or (let ((.cse53 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or (and (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse53) 4294967296) (= (+ (* v_z_84 62992853675) 4294967296 c_~p2~0) (+ .cse0 (* (div (+ (* 62992853676 v_z_84) c_~p2~0 .cse2) 4294967296) 4294967296) .cse53)))) (forall ((v_z_84 Int)) (or (= (+ .cse0 (* (div (+ (* 62992853676 v_z_84) c_~p2~0 .cse2) 4294967296) 4294967296) .cse53) (+ (* v_z_84 62992853675) c_~p2~0)) (< v_z_84 0) (< 4294967295 (+ v_z_84 .cse53)))) (forall ((v_z_84 Int)) (let ((.cse55 (* v_z_84 62992853675)) (.cse54 (+ .cse0 (* (div (+ (* 62992853676 v_z_84) c_~p2~0 .cse2) 4294967296) 4294967296) .cse53))) (or (< 4294967295 v_z_84) (= .cse54 (+ .cse55 c_~p2~0)) (< v_z_84 0) (= (+ .cse55 4294967296 c_~p2~0) .cse54))))) .cse5) (or (and (or (and (or (and (forall ((v_z_81 Int)) (or (= (+ (* 68242258148 v_z_81) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse48 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse47 .cse53)) (< 4294967295 v_z_81) (< (+ v_z_81 .cse53) 4294967296))) (forall ((v_z_81 Int)) (let ((.cse56 (* 68242258148 v_z_81)) (.cse57 (+ (* 4294967296 (div (+ .cse48 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse47 .cse53))) (or (= (+ .cse56 4294967296 c_~p2~0) .cse57) (< v_z_81 0) (< 4294967295 v_z_81) (= (+ .cse56 c_~p2~0) .cse57)))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ v_z_81 .cse53)) (< v_z_81 0) (= (+ (* 68242258148 v_z_81) c_~p2~0) (+ (* 4294967296 (div (+ .cse48 (* v_z_81 68242258149) c_~p2~0) 4294967296)) .cse47 .cse53))))) .cse51) (or (and (or .cse45 (and (forall ((v_z_76 Int)) (or (< (+ v_z_76 .cse53) 4294967296) (< 4294967295 v_z_76) (= (+ (* (div (+ (* v_z_76 69992059640) c_~p2~0 .cse41) 4294967296) 4294967296) .cse53 .cse42) (+ 4294967296 (* 69992059639 v_z_76) c_~p2~0)))) (forall ((v_z_76 Int)) (or (= (+ (* 69992059639 v_z_76) c_~p2~0) (+ (* (div (+ (* v_z_76 69992059640) c_~p2~0 .cse41) 4294967296) 4294967296) .cse53 .cse42)) (< 4294967295 (+ v_z_76 .cse53)) (< v_z_76 0))) (forall ((v_z_76 Int)) (let ((.cse59 (+ (* (div (+ (* v_z_76 69992059640) c_~p2~0 .cse41) 4294967296) 4294967296) .cse53 .cse42)) (.cse58 (* 69992059639 v_z_76))) (or (= (+ .cse58 c_~p2~0) .cse59) (< 4294967295 v_z_76) (< v_z_76 0) (= .cse59 (+ 4294967296 .cse58 c_~p2~0))))))) (or .cse40 (and (or .cse18 (and (or .cse24 (and (forall ((v_z_78 Int)) (or (= (+ 4294967296 (* v_z_78 71741861130) c_~p2~0) (+ .cse25 (* (div (+ (* v_z_78 71741861131) .cse26 c_~p2~0) 4294967296) 4294967296) .cse53)) (< (+ v_z_78 .cse53) 4294967296) (< 4294967295 v_z_78))) (forall ((v_z_78 Int)) (let ((.cse61 (+ .cse25 (* (div (+ (* v_z_78 71741861131) .cse26 c_~p2~0) 4294967296) 4294967296) .cse53)) (.cse60 (* v_z_78 71741861130))) (or (= (+ 4294967296 .cse60 c_~p2~0) .cse61) (< 4294967295 v_z_78) (= .cse61 (+ .cse60 c_~p2~0)) (< v_z_78 0)))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ v_z_78 .cse53)) (= (+ .cse25 (* (div (+ (* v_z_78 71741861131) .cse26 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_78 71741861130) c_~p2~0)) (< v_z_78 0))))) (or .cse19 (and (forall ((v_z_77 Int)) (let ((.cse62 (+ .cse21 (* (div (+ (* 73491662622 v_z_77) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53)) (.cse63 (* v_z_77 73491662621))) (or (= .cse62 (+ .cse63 4294967296 c_~p2~0)) (< 4294967295 v_z_77) (< v_z_77 0) (= .cse62 (+ .cse63 c_~p2~0))))) (forall ((v_z_77 Int)) (or (< v_z_77 0) (= (+ .cse21 (* (div (+ (* 73491662622 v_z_77) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_77 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_77 .cse53)))) (forall ((v_z_77 Int)) (or (= (+ .cse21 (* (div (+ (* 73491662622 v_z_77) .cse20 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_77 73491662621) 4294967296 c_~p2~0)) (< 4294967295 v_z_77) (< (+ v_z_77 .cse53) 4294967296))))))) (or .cse29 (and (or (and (forall ((v_z_79 Int)) (or (< v_z_79 0) (= (+ (* (div (+ .cse30 (* v_z_79 75241464113) c_~p2~0) 4294967296) 4294967296) .cse31 .cse53) (+ (* v_z_79 75241464112) c_~p2~0)) (< 4294967295 (+ v_z_79 .cse53)))) (forall ((v_z_79 Int)) (or (< (+ v_z_79 .cse53) 4294967296) (= (+ 4294967296 (* v_z_79 75241464112) c_~p2~0) (+ (* (div (+ .cse30 (* v_z_79 75241464113) c_~p2~0) 4294967296) 4294967296) .cse31 .cse53)) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (let ((.cse65 (+ (* (div (+ .cse30 (* v_z_79 75241464113) c_~p2~0) 4294967296) 4294967296) .cse31 .cse53)) (.cse64 (* v_z_79 75241464112))) (or (< v_z_79 0) (= (+ 4294967296 .cse64 c_~p2~0) .cse65) (= .cse65 (+ .cse64 c_~p2~0)) (< 4294967295 v_z_79))))) .cse34) (or (and (forall ((v_z_80 Int)) (or (= (+ .cse36 (* (div (+ (* v_z_80 76991265604) .cse37 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_80 76991265603) 4294967296 c_~p2~0)) (< 4294967295 v_z_80) (< (+ v_z_80 .cse53) 4294967296))) (forall ((v_z_80 Int)) (let ((.cse66 (+ .cse36 (* (div (+ (* v_z_80 76991265604) .cse37 c_~p2~0) 4294967296) 4294967296) .cse53)) (.cse67 (* v_z_80 76991265603))) (or (= .cse66 (+ .cse67 c_~p2~0)) (= .cse66 (+ .cse67 4294967296 c_~p2~0)) (< 4294967295 v_z_80) (< v_z_80 0)))) (forall ((v_z_80 Int)) (or (< 4294967295 (+ v_z_80 .cse53)) (= (+ .cse36 (* (div (+ (* v_z_80 76991265604) .cse37 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_80 76991265603) c_~p2~0)) (< v_z_80 0)))) .cse35)))))) .cse46)) .cse17) (or .cse6 (and (or (and (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse53)) (= (+ .cse13 (* 4294967296 (div (+ (* v_z_83 64742655167) .cse12 c_~p2~0) 4294967296)) .cse53) (+ (* v_z_83 64742655166) c_~p2~0)) (< v_z_83 0))) (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (= (+ .cse13 (* 4294967296 (div (+ (* v_z_83 64742655167) .cse12 c_~p2~0) 4294967296)) .cse53) (+ 4294967296 (* v_z_83 64742655166) c_~p2~0)) (< (+ v_z_83 .cse53) 4294967296))) (forall ((v_z_83 Int)) (let ((.cse68 (+ .cse13 (* 4294967296 (div (+ (* v_z_83 64742655167) .cse12 c_~p2~0) 4294967296)) .cse53)) (.cse69 (* v_z_83 64742655166))) (or (< 4294967295 v_z_83) (= .cse68 (+ 4294967296 .cse69 c_~p2~0)) (= .cse68 (+ .cse69 c_~p2~0)) (< v_z_83 0))))) .cse16) (or (and (forall ((v_z_82 Int)) (or (= (+ .cse8 (* (div (+ (* 66492456658 v_z_82) .cse9 c_~p2~0) 4294967296) 4294967296) .cse53) (+ (* v_z_82 66492456657) c_~p2~0)) (< 4294967295 (+ v_z_82 .cse53)) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (= (+ (* v_z_82 66492456657) 4294967296 c_~p2~0) (+ .cse8 (* (div (+ (* 66492456658 v_z_82) .cse9 c_~p2~0) 4294967296) 4294967296) .cse53)) (< (+ v_z_82 .cse53) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (let ((.cse71 (* v_z_82 66492456657)) (.cse70 (+ .cse8 (* (div (+ (* 66492456658 v_z_82) .cse9 c_~p2~0) 4294967296) 4294967296) .cse53))) (or (= .cse70 (+ .cse71 c_~p2~0)) (= (+ .cse71 4294967296 c_~p2~0) .cse70) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse7)))) .cse52))) (not (= c_~n1~0 27))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-17 23:47:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 969 refuted. 4 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-17 23:47:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126463053] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 23:47:01,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 23:47:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-17 23:47:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081372344] [2024-10-17 23:47:01,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 23:47:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-17 23:47:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 23:47:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-17 23:47:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21928, Unknown=6, NotChecked=324, Total=27060 [2024-10-17 23:47:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:47:01,031 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 23:47:01,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 23:47:01,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 23:49:30,974 WARN L286 SmtUtils]: Spent 30.32s on a formula simplification. DAG size of input: 306 DAG size of output: 150 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 23:50:14,619 WARN L286 SmtUtils]: Spent 38.11s on a formula simplification. DAG size of input: 306 DAG size of output: 201 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 23:50:16,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:50:18,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:50:20,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:50:49,803 WARN L286 SmtUtils]: Spent 25.68s on a formula simplification. DAG size of input: 229 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 23:51:07,158 WARN L286 SmtUtils]: Spent 15.07s on a formula simplification. DAG size of input: 303 DAG size of output: 134 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 23:51:09,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:11,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:13,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:17,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:19,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:22,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:24,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:51:26,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:52:02,498 WARN L286 SmtUtils]: Spent 29.74s on a formula simplification. DAG size of input: 194 DAG size of output: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 23:52:04,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 23:53:26,837 WARN L286 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 238 DAG size of output: 174 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15