./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 05:47:01,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 05:47:01,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 05:47:01,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 05:47:01,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 05:47:01,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 05:47:01,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 05:47:01,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 05:47:01,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 05:47:01,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 05:47:01,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 05:47:01,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 05:47:01,481 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 05:47:01,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 05:47:01,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 05:47:01,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 05:47:01,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 05:47:01,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 05:47:01,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 05:47:01,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 05:47:01,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 05:47:01,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 05:47:01,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 05:47:01,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 05:47:01,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 05:47:01,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 05:47:01,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 05:47:01,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 05:47:01,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 05:47:01,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 05:47:01,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 05:47:01,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 05:47:01,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 05:47:01,488 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 05:47:01,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 05:47:01,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 05:47:01,488 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 05:47:01,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 05:47:01,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 05:47:01,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 05:47:01,492 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 05:47:01,492 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-17 05:47:01,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 05:47:01,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 05:47:01,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 05:47:01,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 05:47:01,733 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 05:47:01,734 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-17 05:47:03,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 05:47:03,244 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 05:47:03,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-17 05:47:03,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c49bcfc9b/f98ea08e16114d8197f5794dd7b543ae/FLAGd6d345fc7 [2024-10-17 05:47:03,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c49bcfc9b/f98ea08e16114d8197f5794dd7b543ae [2024-10-17 05:47:03,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 05:47:03,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 05:47:03,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 05:47:03,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 05:47:03,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 05:47:03,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ddc986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03, skipping insertion in model container [2024-10-17 05:47:03,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 05:47:03,479 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-17 05:47:03,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 05:47:03,497 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 05:47:03,519 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-17 05:47:03,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 05:47:03,542 INFO L204 MainTranslator]: Completed translation [2024-10-17 05:47:03,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03 WrapperNode [2024-10-17 05:47:03,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 05:47:03,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 05:47:03,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 05:47:03,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 05:47:03,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,572 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-17 05:47:03,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 05:47:03,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 05:47:03,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 05:47:03,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 05:47:03,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 05:47:03,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 05:47:03,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 05:47:03,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 05:47:03,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (1/1) ... [2024-10-17 05:47:03,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 05:47:03,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:47:03,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 05:47:03,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 05:47:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 05:47:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 05:47:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 05:47:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 05:47:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 05:47:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 05:47:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 05:47:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 05:47:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 05:47:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 05:47:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 05:47:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 05:47:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 05:47:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 05:47:03,704 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 05:47:03,799 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 05:47:03,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 05:47:04,036 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 05:47:04,037 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 05:47:04,183 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 05:47:04,184 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 05:47:04,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:47:04 BoogieIcfgContainer [2024-10-17 05:47:04,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 05:47:04,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 05:47:04,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 05:47:04,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 05:47:04,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:47:03" (1/3) ... [2024-10-17 05:47:04,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2a356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:47:04, skipping insertion in model container [2024-10-17 05:47:04,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:47:03" (2/3) ... [2024-10-17 05:47:04,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2a356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:47:04, skipping insertion in model container [2024-10-17 05:47:04,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:47:04" (3/3) ... [2024-10-17 05:47:04,192 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-17 05:47:04,206 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 05:47:04,206 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 05:47:04,206 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 05:47:04,270 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 05:47:04,313 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 05:47:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 05:47:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:47:04,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 05:47:04,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 05:47:04,413 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 05:47:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 05:47:04,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 05:47:04,446 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;@3d00ff99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 05:47:04,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 05:47:05,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 05:47:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 594699485, now seen corresponding path program 1 times [2024-10-17 05:47:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:06,028 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-17 05:47:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:06,209 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-17 05:47:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573676, now seen corresponding path program 1 times [2024-10-17 05:47:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:06,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 05:47:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1354789931, now seen corresponding path program 1 times [2024-10-17 05:47:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:06,685 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-17 05:47:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:06,887 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-17 05:47:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781478, now seen corresponding path program 1 times [2024-10-17 05:47:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:06,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 05:47:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1524197780, now seen corresponding path program 1 times [2024-10-17 05:47:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:07,374 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-17 05:47:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:07,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-17 05:47:07,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 05:47:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash -73013975, now seen corresponding path program 1 times [2024-10-17 05:47:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 05:47:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431165205] [2024-10-17 05:47:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:08,064 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-17 05:47:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 05:47:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431165205] [2024-10-17 05:47:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431165205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 05:47:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335628537] [2024-10-17 05:47:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 05:47:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:47:08,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 05:47:08,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 05:47:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:08,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-17 05:47:08,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 05:47:08,496 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-17 05:47:08,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 05:47:08,909 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-17 05:47:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335628537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 05:47:08,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 05:47:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2024-10-17 05:47:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636420284] [2024-10-17 05:47:08,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 05:47:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-17 05:47:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 05:47:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-17 05:47:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-10-17 05:47:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:47:08,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 05:47:08,952 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-17 05:47:08,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:47:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-17 05:47:10,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 05:47:10,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-17 05:47:10,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 05:47:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1353993418, now seen corresponding path program 1 times [2024-10-17 05:47:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:10,825 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-17 05:47:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:11,056 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-17 05:47:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1213107327, now seen corresponding path program 1 times [2024-10-17 05:47:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:11,428 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-17 05:47:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:11,691 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-17 05:47:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337852, now seen corresponding path program 1 times [2024-10-17 05:47:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:12,053 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-17 05:47:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:12,315 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-17 05:47:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash -180050683, now seen corresponding path program 1 times [2024-10-17 05:47:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 181 proven. 72 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-17 05:47:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 181 proven. 72 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-17 05:47:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 881578425, now seen corresponding path program 1 times [2024-10-17 05:47:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 181 proven. 72 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-17 05:47:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 181 proven. 72 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-17 05:47:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 05:47:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2096618437, now seen corresponding path program 2 times [2024-10-17 05:47:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 05:47:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712458206] [2024-10-17 05:47:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:14,433 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-17 05:47:14,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 05:47:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712458206] [2024-10-17 05:47:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712458206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 05:47:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421465360] [2024-10-17 05:47:14,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 05:47:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 05:47:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:47:14,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 05:47:14,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 05:47:14,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 05:47:14,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 05:47:14,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-17 05:47:14,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 05:47:15,158 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-17 05:47:15,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 05:47:16,119 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-17 05:47:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421465360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 05:47:16,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 05:47:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2024-10-17 05:47:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478683223] [2024-10-17 05:47:16,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 05:47:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-17 05:47:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 05:47:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-17 05:47:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2024-10-17 05:47:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:47:16,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 05:47:16,127 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-17 05:47:16,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-17 05:47:16,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:47:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-17 05:47:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-17 05:47:34,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 05:47:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-17 05:47:34,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 05:47:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash 805131384, now seen corresponding path program 1 times [2024-10-17 05:47:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:35,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 05:47:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 05:47:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1292452251, now seen corresponding path program 1 times [2024-10-17 05:47:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 0 proven. 1451 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2024-10-17 05:47:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 0 proven. 1451 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2024-10-17 05:47:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1246655532, now seen corresponding path program 1 times [2024-10-17 05:47:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 0 proven. 3421 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-17 05:47:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 0 proven. 3421 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-17 05:47:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 05:47:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -453510420, now seen corresponding path program 3 times [2024-10-17 05:47:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 05:47:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223100423] [2024-10-17 05:47:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:47:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:47:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:47:42,587 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-17 05:47:42,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 05:47:42,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223100423] [2024-10-17 05:47:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223100423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 05:47:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421021181] [2024-10-17 05:47:42,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 05:47:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 05:47:42,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:47:42,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 05:47:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 05:47:43,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-10-17 05:47:43,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 05:47:43,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-17 05:47:43,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 05:47:44,370 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-17 05:47:44,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 05:47:46,312 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-17 05:47:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421021181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 05:47:46,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 05:47:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41, 41] total 83 [2024-10-17 05:47:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370313397] [2024-10-17 05:47:46,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 05:47:46,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-17 05:47:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 05:47:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-17 05:47:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=5557, Unknown=0, NotChecked=0, Total=6806 [2024-10-17 05:47:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:47:46,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 05:47:46,323 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-17 05:47:46,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-17 05:47:46,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-17 05:47:46,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:48:14,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:48:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-17 05:48:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-17 05:48:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-17 05:48:15,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 05:48:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 05:48:15,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 05:48:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash -660890726, now seen corresponding path program 1 times [2024-10-17 05:48:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5660 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-17 05:48:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5660 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-17 05:48:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash -851872074, now seen corresponding path program 1 times [2024-10-17 05:48:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-17 05:48:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-17 05:48:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1815675565, now seen corresponding path program 1 times [2024-10-17 05:48:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5679 backedges. 17 proven. 5591 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-17 05:48:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5679 backedges. 17 proven. 5591 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-17 05:48:31,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 05:48:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -684919156, now seen corresponding path program 4 times [2024-10-17 05:48:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 05:48:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981089844] [2024-10-17 05:48:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 05:48:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 05:48:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 05:48:34,298 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-17 05:48:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 05:48:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981089844] [2024-10-17 05:48:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981089844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 05:48:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651285190] [2024-10-17 05:48:34,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 05:48:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 05:48:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 05:48:34,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 05:48:34,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 05:48:34,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 05:48:34,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 05:48:34,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-17 05:48:34,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 05:48:38,408 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-17 05:48:38,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 05:48:46,923 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-17 05:48:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651285190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 05:48:46,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 05:48:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 61, 61] total 168 [2024-10-17 05:48:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177829601] [2024-10-17 05:48:46,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 05:48:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2024-10-17 05:48:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 05:48:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2024-10-17 05:48:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2751, Invalid=25305, Unknown=0, NotChecked=0, Total=28056 [2024-10-17 05:48:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:48:46,937 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 05:48:46,938 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-17 05:48:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-17 05:48:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-17 05:48:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-17 05:48:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 05:49:14,861 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-17 05:50:30,754 WARN L286 SmtUtils]: Spent 30.97s 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-17 05:53:15,085 WARN L286 SmtUtils]: Spent 1.29m 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-17 05:53:17,095 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-17 05:55:35,288 WARN L286 SmtUtils]: Spent 1.03m 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-17 05:55:37,468 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-17 05:55:39,542 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-17 05:55:41,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:44,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:45,925 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-17 05:55:48,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:49,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:51,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:55,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:55:58,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:56:00,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:56:03,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:56:06,941 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-17 05:56:09,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:56:11,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:56:13,283 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-17 05:56:16,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:32,530 WARN L286 SmtUtils]: Spent 1.10m 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-17 05:58:34,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:36,086 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-17 05:58:38,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:39,641 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-17 05:58:41,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:43,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:45,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:47,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:49,130 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-17 05:58:50,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:53,218 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-17 05:58:55,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:58:57,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:00,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:01,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:04,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:07,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:10,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:11,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:13,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:17,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:18,057 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-17 05:59:19,897 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-17 05:59:22,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:25,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:28,419 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-17 05:59:29,615 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-17 05:59:32,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:34,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:36,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:38,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:40,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:42,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:44,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:46,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:48,007 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-17 05:59:50,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:52,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 05:59:56,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:04,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:06,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:08,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:11,500 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-17 06:00:13,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:15,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:17,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:20,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:22,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:25,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:26,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:28,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:29,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:31,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:33,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:35,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:36,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:38,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:40,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:44,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:46,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:48,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:50,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:54,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:00:56,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:02,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:04,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-17 06:01:06,663 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-17 06:01:09,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:11,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:15,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:17,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:18,591 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-17 06:01:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 06:01:23,248 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 [] Killed by 15