./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 17:33:39,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 17:33:39,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 17:33:39,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 17:33:39,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 17:33:39,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 17:33:39,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 17:33:39,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 17:33:39,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 17:33:39,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 17:33:39,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 17:33:39,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 17:33:39,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 17:33:39,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 17:33:39,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 17:33:39,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 17:33:39,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 17:33:39,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 17:33:39,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 17:33:39,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 17:33:39,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 17:33:39,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 17:33:39,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 17:33:39,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 17:33:39,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 17:33:39,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 17:33:39,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 17:33:39,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 17:33:39,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 17:33:39,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 17:33:39,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 17:33:39,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 17:33:39,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 17:33:39,333 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 17:33:39,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 17:33:39,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 17:33:39,338 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 17:33:39,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 17:33:39,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 17:33:39,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 17:33:39,339 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 17:33:39,340 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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-18 17:33:39,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 17:33:39,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 17:33:39,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 17:33:39,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 17:33:39,610 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 17:33:39,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-18 17:33:41,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 17:33:41,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 17:33:41,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-18 17:33:41,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ba29e1430/96c47e599bc849cb8a43915414b10d15/FLAGe0b7464a9 [2024-10-18 17:33:41,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ba29e1430/96c47e599bc849cb8a43915414b10d15 [2024-10-18 17:33:41,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 17:33:41,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 17:33:41,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 17:33:41,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 17:33:41,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 17:33:41,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1630f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41, skipping insertion in model container [2024-10-18 17:33:41,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 17:33:41,425 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/popl20-mult-4.wvr.c[2664,2677] [2024-10-18 17:33:41,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 17:33:41,437 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 17:33:41,458 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/popl20-mult-4.wvr.c[2664,2677] [2024-10-18 17:33:41,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 17:33:41,479 INFO L204 MainTranslator]: Completed translation [2024-10-18 17:33:41,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41 WrapperNode [2024-10-18 17:33:41,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 17:33:41,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 17:33:41,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 17:33:41,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 17:33:41,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,506 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-18 17:33:41,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 17:33:41,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 17:33:41,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 17:33:41,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 17:33:41,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 17:33:41,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 17:33:41,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 17:33:41,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 17:33:41,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (1/1) ... [2024-10-18 17:33:41,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 17:33:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:33:41,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 17:33:41,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 17:33:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 17:33:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 17:33:41,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 17:33:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-18 17:33:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-18 17:33:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 17:33:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 17:33:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 17:33:41,622 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 17:33:41,730 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 17:33:41,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 17:33:41,908 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 17:33:41,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 17:33:42,054 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 17:33:42,055 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-18 17:33:42,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 05:33:42 BoogieIcfgContainer [2024-10-18 17:33:42,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 17:33:42,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 17:33:42,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 17:33:42,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 17:33:42,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 05:33:41" (1/3) ... [2024-10-18 17:33:42,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98415bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 05:33:42, skipping insertion in model container [2024-10-18 17:33:42,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 05:33:41" (2/3) ... [2024-10-18 17:33:42,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98415bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 05:33:42, skipping insertion in model container [2024-10-18 17:33:42,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 05:33:42" (3/3) ... [2024-10-18 17:33:42,064 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-18 17:33:42,079 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 17:33:42,079 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 17:33:42,080 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 17:33:42,155 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 17:33:42,190 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 17:33:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 17:33:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:33:42,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 17:33:42,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 17:33:42,277 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 17:33:42,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:33:42,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 17:33:42,305 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;@57a5fb7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 17:33:42,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-18 17:33:43,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 17:33:43,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:33:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash -73013975, now seen corresponding path program 1 times [2024-10-18 17:33:43,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:33:43,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127645804] [2024-10-18 17:33:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 107 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-18 17:33:44,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:33:44,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127645804] [2024-10-18 17:33:44,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127645804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:33:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100804610] [2024-10-18 17:33:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:44,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:33:44,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:33:44,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 17:33:44,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 17:33:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:44,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-18 17:33:44,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:33:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-18 17:33:44,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:33:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-18 17:33:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100804610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:33:45,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:33:45,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2024-10-18 17:33:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289964612] [2024-10-18 17:33:45,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:33:45,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-18 17:33:45,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:33:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -297348609, now seen corresponding path program 1 times [2024-10-18 17:33:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:45,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -535005413, now seen corresponding path program 1 times [2024-10-18 17:33:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 594699487, now seen corresponding path program 1 times [2024-10-18 17:33:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:45,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1255813051, now seen corresponding path program 1 times [2024-10-18 17:33:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash -338209895, now seen corresponding path program 1 times [2024-10-18 17:33:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573672, now seen corresponding path program 1 times [2024-10-18 17:33:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1397756825, now seen corresponding path program 1 times [2024-10-18 17:33:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:47,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1013534283, now seen corresponding path program 1 times [2024-10-18 17:33:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1354789937, now seen corresponding path program 1 times [2024-10-18 17:33:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash -951186645, now seen corresponding path program 1 times [2024-10-18 17:33:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 170531337, now seen corresponding path program 1 times [2024-10-18 17:33:48,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:48,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 991502142, now seen corresponding path program 1 times [2024-10-18 17:33:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 17:33:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash 671793353, now seen corresponding path program 1 times [2024-10-18 17:33:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:48,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1348254632, now seen corresponding path program 1 times [2024-10-18 17:33:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781467, now seen corresponding path program 1 times [2024-10-18 17:33:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781466, now seen corresponding path program 1 times [2024-10-18 17:33:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1407489175, now seen corresponding path program 1 times [2024-10-18 17:33:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1407489174, now seen corresponding path program 1 times [2024-10-18 17:33:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -682493436, now seen corresponding path program 1 times [2024-10-18 17:33:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 317537963, now seen corresponding path program 1 times [2024-10-18 17:33:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1022930791, now seen corresponding path program 1 times [2024-10-18 17:33:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1022930792, now seen corresponding path program 1 times [2024-10-18 17:33:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305718, now seen corresponding path program 1 times [2024-10-18 17:33:51,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305719, now seen corresponding path program 1 times [2024-10-18 17:33:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1524197760, now seen corresponding path program 1 times [2024-10-18 17:33:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1524197759, now seen corresponding path program 1 times [2024-10-18 17:33:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -5492360, now seen corresponding path program 1 times [2024-10-18 17:33:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash -5492359, now seen corresponding path program 1 times [2024-10-18 17:33:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash -170265741, now seen corresponding path program 1 times [2024-10-18 17:33:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash -983273286, now seen corresponding path program 1 times [2024-10-18 17:33:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 17:33:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-18 17:33:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2024-10-18 17:33:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:33:54,681 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:33:54,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 17:33:54,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:33:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 17:33:55,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 17:33:56,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable0,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 17:33:56,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 17:33:56,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:33:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2096618437, now seen corresponding path program 2 times [2024-10-18 17:33:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:33:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378267643] [2024-10-18 17:33:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 366 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-18 17:33:56,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:33:56,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378267643] [2024-10-18 17:33:56,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378267643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:33:56,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26312473] [2024-10-18 17:33:56,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 17:33:56,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:33:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:33:56,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 17:33:56,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 17:33:56,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 17:33:56,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:33:56,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-18 17:33:56,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:33:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-18 17:33:57,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:33:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-18 17:33:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26312473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:33:58,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:33:58,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2024-10-18 17:33:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565437729] [2024-10-18 17:33:58,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:33:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-18 17:33:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:33:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 940308564, now seen corresponding path program 1 times [2024-10-18 17:33:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:58,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:33:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:33:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 870814672, now seen corresponding path program 1 times [2024-10-18 17:33:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-18 17:33:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-18 17:33:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash 550797113, now seen corresponding path program 1 times [2024-10-18 17:33:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-18 17:33:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-18 17:33:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1064701355, now seen corresponding path program 1 times [2024-10-18 17:33:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:33:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:33:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:33:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1353993449, now seen corresponding path program 1 times [2024-10-18 17:33:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:33:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:33:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash -975878923, now seen corresponding path program 1 times [2024-10-18 17:34:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1701700397, now seen corresponding path program 1 times [2024-10-18 17:34:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1213107294, now seen corresponding path program 1 times [2024-10-18 17:34:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1048377043, now seen corresponding path program 1 times [2024-10-18 17:34:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 834594181, now seen corresponding path program 1 times [2024-10-18 17:34:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 102613051, now seen corresponding path program 1 times [2024-10-18 17:34:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1113965467, now seen corresponding path program 1 times [2024-10-18 17:34:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:02,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1074045084, now seen corresponding path program 1 times [2024-10-18 17:34:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337890, now seen corresponding path program 1 times [2024-10-18 17:34:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337891, now seen corresponding path program 1 times [2024-10-18 17:34:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1365266619, now seen corresponding path program 1 times [2024-10-18 17:34:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:04,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1365266618, now seen corresponding path program 1 times [2024-10-18 17:34:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash 626405025, now seen corresponding path program 1 times [2024-10-18 17:34:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:05,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2056283481, now seen corresponding path program 1 times [2024-10-18 17:34:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 17:34:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1975582151, now seen corresponding path program 1 times [2024-10-18 17:34:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-18 17:34:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-18 17:34:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-18 17:34:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2061, Unknown=0, NotChecked=0, Total=2352 [2024-10-18 17:34:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:34:06,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:34:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.617021276595745) internal successors, (311), 47 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 17:34:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-18 17:34:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:34:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 17:34:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-18 17:34:26,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-18 17:34:26,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable70,SelfDestructingSolverStorable92,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable53,SelfDestructingSolverStorable75,SelfDestructingSolverStorable54,SelfDestructingSolverStorable76,SelfDestructingSolverStorable55,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable78,SelfDestructingSolverStorable57,SelfDestructingSolverStorable79,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable60,SelfDestructingSolverStorable82,SelfDestructingSolverStorable61,SelfDestructingSolverStorable83,SelfDestructingSolverStorable62,SelfDestructingSolverStorable84,SelfDestructingSolverStorable63,SelfDestructingSolverStorable85,SelfDestructingSolverStorable64,SelfDestructingSolverStorable86,SelfDestructingSolverStorable65,SelfDestructingSolverStorable87,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable88,SelfDestructingSolverStorable67,SelfDestructingSolverStorable89,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-10-18 17:34:26,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 17:34:26,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:34:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash -453510420, now seen corresponding path program 3 times [2024-10-18 17:34:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:34:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784155639] [2024-10-18 17:34:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 553 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2024-10-18 17:34:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:34:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784155639] [2024-10-18 17:34:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784155639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:34:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191444854] [2024-10-18 17:34:27,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 17:34:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:34:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:34:27,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 17:34:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 17:34:28,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-10-18 17:34:28,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:34:28,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-18 17:34:28,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:34:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-18 17:34:29,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:34:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-18 17:34:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191444854] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:34:30,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:34:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41, 41] total 83 [2024-10-18 17:34:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053070830] [2024-10-18 17:34:30,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:34:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-18 17:34:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:34:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 881249824, now seen corresponding path program 1 times [2024-10-18 17:34:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2024-10-18 17:34:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2024-10-18 17:34:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash -711717936, now seen corresponding path program 1 times [2024-10-18 17:34:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-18 17:34:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-18 17:34:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 286974437, now seen corresponding path program 1 times [2024-10-18 17:34:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3073 backedges. 0 proven. 1272 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-18 17:34:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3073 backedges. 0 proven. 1272 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-18 17:34:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1134350753, now seen corresponding path program 1 times [2024-10-18 17:34:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:34:39,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:34:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:34:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 805131436, now seen corresponding path program 1 times [2024-10-18 17:34:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 17:34:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 17:34:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -810732767, now seen corresponding path program 1 times [2024-10-18 17:34:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:34:43,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:34:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:34:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -85552321, now seen corresponding path program 1 times [2024-10-18 17:34:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:43,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 17:34:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:34:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:34:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:34:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 17:34:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-18 17:34:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=6395, Unknown=0, NotChecked=0, Total=7656 [2024-10-18 17:34:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:34:47,122 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:34:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 6.204819277108434) internal successors, (515), 83 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 17:34:47,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-18 17:34:47,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-18 17:34:47,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:35:12,068 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 155 DAG size of output: 148 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:35:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 17:35:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-18 17:35:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-18 17:35:17,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-18 17:35:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-10-18 17:35:17,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-18 17:35:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 17:35:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -684919156, now seen corresponding path program 4 times [2024-10-18 17:35:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 17:35:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727852345] [2024-10-18 17:35:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:35:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 873 proven. 3210 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-18 17:35:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 17:35:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727852345] [2024-10-18 17:35:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727852345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 17:35:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246879859] [2024-10-18 17:35:20,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 17:35:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 17:35:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 17:35:20,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 17:35:20,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 17:35:20,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 17:35:20,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 17:35:20,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-18 17:35:20,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 17:35:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 17:35:24,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 17:35:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 17:35:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246879859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 17:35:33,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 17:35:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 61, 61] total 168 [2024-10-18 17:35:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566281296] [2024-10-18 17:35:33,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 17:35:33,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2024-10-18 17:35:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 17:35:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1255891012, now seen corresponding path program 1 times [2024-10-18 17:35:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:35:33,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 17:35:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 17:35:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash -926806304, now seen corresponding path program 1 times [2024-10-18 17:35:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:35:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 0 proven. 1659 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-18 17:35:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:35:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 0 proven. 1659 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-18 17:35:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 190806037, now seen corresponding path program 1 times [2024-10-18 17:35:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:35:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-18 17:35:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 17:35:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 17:35:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 17:35:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-18 17:35:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2024-10-18 17:35:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=28376, Unknown=0, NotChecked=0, Total=31152 [2024-10-18 17:35:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:35:42,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 17:35:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 5.684523809523809) internal successors, (955), 168 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 17:35:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 17:35:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-18 17:35:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-18 17:35:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 17:36:09,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (.cse10 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse13 (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse11 (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse5 (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse14 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse20 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (.cse16 (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse3 (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse29 (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296)) (.cse22 (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse25 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse15 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse31 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (.cse26 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse38 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (.cse21 (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (.cse9 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (.cse36 (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse35 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (.cse45 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse34 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (.cse33 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse44 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse30 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse46 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (.cse51 (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse4 (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse24 (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse41 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse50 (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse37 (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296)) (.cse19 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse52 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse42 (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse40 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse43 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse47 (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296)) (.cse32 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (.cse23 (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse49 (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse17 (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296)) (.cse12 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (.cse39 (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296)) (.cse18 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (.cse27 (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296)) (.cse53 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 .cse3) (< .cse4 .cse5) (< .cse6 .cse7) (< .cse8 .cse9) (< .cse2 .cse1) (< .cse10 .cse11) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 28) 4294967296) .cse12) (< .cse10 .cse13) (< .cse6 .cse13) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse9) (< .cse14 .cse11) (< .cse15 .cse16) (< .cse17 .cse18) (< .cse19 .cse20) (< .cse21 .cse5) (< .cse14 .cse22) (< .cse23 .cse24) (< .cse25 .cse20) (< .cse26 .cse16) (< .cse27 .cse28) (< .cse29 .cse3) (< .cse30 .cse31) (< .cse29 .cse32) (< .cse33 .cse22) (< .cse25 (+ (mod |c_thread2Thread1of1ForFork2_~i~1#1| 4294967296) 1)) (< .cse15 .cse34) (< .cse35 .cse31) (< .cse26 .cse36) (< .cse37 .cse38) (< .cse39 .cse38) (< .cse21 .cse28) (< .cse40 .cse9) (< .cse41 .cse42) (< .cse19 .cse43) (< .cse44 .cse36) (< .cse35 .cse7) (< .cse45 .cse46) (< .cse47 .cse48) (< .cse45 .cse34) (< .cse33 .cse48) (< .cse0 .cse49) (< .cse8 .cse50) (< .cse44 .cse51) (< .cse30 .cse46) (< .cse52 .cse51) (< .cse4 .cse24) (< .cse41 .cse50) (< .cse37 .cse53) (< .cse19 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse52 .cse42) (< .cse40 .cse43) (< .cse47 .cse32) (< .cse23 .cse49) (< .cse17 .cse12) (< .cse39 .cse18) (< .cse27 .cse53))) is different from false [2024-10-18 17:37:10,876 WARN L286 SmtUtils]: Spent 21.63s on a formula simplification. DAG size of input: 152 DAG size of output: 130 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:39:56,920 WARN L286 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 194 DAG size of output: 168 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:39:58,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (< (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (< (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296) (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296) (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (< (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (< (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (< (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (< (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296) (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296) (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1)))) is different from false [2024-10-18 17:42:14,061 WARN L286 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 184 DAG size of output: 158 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:42:17,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:19,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:21,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:22,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:24,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:26,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:28,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:31,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:36,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:37,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:39,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:41,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:42,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:45,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:48,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:50,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:52,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:54,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:42:55,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:25,641 WARN L286 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 186 DAG size of output: 160 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 17:45:27,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:29,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:31,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:35,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:36,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:38,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:42,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:44,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:46,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:48,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:50,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:51,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:53,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:54,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:57,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:45:59,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:01,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:03,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:05,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:08,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:09,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:10,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:12,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:13,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:15,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:18,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:19,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:21,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:23,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:25,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:26,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:28,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:30,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:32,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:33,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:34,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:36,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:39,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:41,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:43,318 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-18 17:46:45,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:46,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:47,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:49,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:54,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:56,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:58,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:46:59,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:03,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:08,499 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-18 17:47:10,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:13,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:16,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:20,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:22,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:24,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:26,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:30,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:32,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:35,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:36,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:38,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:43,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:46,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:48,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:49,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:51,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:52,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:54,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 17:47:55,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15