./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.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 SYMBOLIC_RELATION -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/parallel-misc-2.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 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e --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 SYMBOLIC_RELATION -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 08:53:36,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 08:53:36,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 08:53:36,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 08:53:36,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 08:53:36,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 08:53:36,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 08:53:36,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 08:53:36,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 08:53:36,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 08:53:36,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 08:53:36,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 08:53:36,275 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 08:53:36,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 08:53:36,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 08:53:36,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 08:53:36,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 08:53:36,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 08:53:36,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 08:53:36,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 08:53:36,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 08:53:36,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 08:53:36,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 08:53:36,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 08:53:36,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 08:53:36,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 08:53:36,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 08:53:36,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 08:53:36,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 08:53:36,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 08:53:36,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 08:53:36,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 08:53:36,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 08:53:36,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 08:53:36,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 08:53:36,285 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 08:53:36,286 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 -> 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e 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 -> SYMBOLIC_RELATION [2024-10-17 08:53:36,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 08:53:36,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 08:53:36,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 08:53:36,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 08:53:36,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 08:53:36,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-10-17 08:53:38,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 08:53:38,218 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 08:53:38,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-10-17 08:53:38,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/743e4965e/75348b20bc8749e6855cb52b1d3092d8/FLAG0c4140817 [2024-10-17 08:53:38,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/743e4965e/75348b20bc8749e6855cb52b1d3092d8 [2024-10-17 08:53:38,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 08:53:38,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 08:53:38,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 08:53:38,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 08:53:38,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 08:53:38,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4690b1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38, skipping insertion in model container [2024-10-17 08:53:38,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 08:53:38,478 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/parallel-misc-2.wvr.c[2580,2593] [2024-10-17 08:53:38,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 08:53:38,512 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 08:53:38,529 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/parallel-misc-2.wvr.c[2580,2593] [2024-10-17 08:53:38,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 08:53:38,545 INFO L204 MainTranslator]: Completed translation [2024-10-17 08:53:38,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38 WrapperNode [2024-10-17 08:53:38,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 08:53:38,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 08:53:38,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 08:53:38,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 08:53:38,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,582 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-17 08:53:38,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 08:53:38,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 08:53:38,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 08:53:38,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 08:53:38,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 08:53:38,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 08:53:38,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 08:53:38,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 08:53:38,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (1/1) ... [2024-10-17 08:53:38,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 08:53:38,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:53:38,647 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 08:53:38,650 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 08:53:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 08:53:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 08:53:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 08:53:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 08:53:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 08:53:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 08:53:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 08:53:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 08:53:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 08:53:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 08:53:38,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 08:53:38,797 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 08:53:38,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 08:53:38,985 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 08:53:38,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 08:53:39,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 08:53:39,131 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 08:53:39,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:53:39 BoogieIcfgContainer [2024-10-17 08:53:39,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 08:53:39,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 08:53:39,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 08:53:39,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 08:53:39,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 08:53:38" (1/3) ... [2024-10-17 08:53:39,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380ec708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:53:39, skipping insertion in model container [2024-10-17 08:53:39,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:53:38" (2/3) ... [2024-10-17 08:53:39,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380ec708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:53:39, skipping insertion in model container [2024-10-17 08:53:39,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:53:39" (3/3) ... [2024-10-17 08:53:39,142 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-10-17 08:53:39,156 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 08:53:39,156 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 08:53:39,156 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 08:53:39,195 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 08:53:39,235 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 08:53:39,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 08:53:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:53:39,238 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 08:53:39,239 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 08:53:39,307 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 08:53:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:39,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 08:53:39,334 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;@25a74089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 08:53:39,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 08:53:39,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:53:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1167579706, now seen corresponding path program 1 times [2024-10-17 08:53:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:53:39,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293199201] [2024-10-17 08:53:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:53:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:53:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:53:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293199201] [2024-10-17 08:53:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293199201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 08:53:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 08:53:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-17 08:53:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548939429] [2024-10-17 08:53:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 08:53:40,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 08:53:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:53:40,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 08:53:40,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 08:53:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:40,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:53:40,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 08:53:40,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:40,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 08:53:40,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:53:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1867846974, now seen corresponding path program 1 times [2024-10-17 08:53:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:53:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071367243] [2024-10-17 08:53:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:53:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:53:40,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:53:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071367243] [2024-10-17 08:53:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071367243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 08:53:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 08:53:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 08:53:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395715224] [2024-10-17 08:53:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 08:53:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 08:53:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:53:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 08:53:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 08:53:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:40,624 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:53:40,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 08:53:40,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:40,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 08:53:40,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:53:40,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash 930523526, now seen corresponding path program 1 times [2024-10-17 08:53:40,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:53:40,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119874183] [2024-10-17 08:53:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:53:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-17 08:53:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:53:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119874183] [2024-10-17 08:53:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119874183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 08:53:41,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 08:53:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 08:53:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947087350] [2024-10-17 08:53:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 08:53:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 08:53:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:53:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 08:53:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 08:53:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:41,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:53:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 08:53:41,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:41,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-17 08:53:41,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:53:41,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1773299046, now seen corresponding path program 1 times [2024-10-17 08:53:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:53:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284380087] [2024-10-17 08:53:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:53:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 08:53:41,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:53:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284380087] [2024-10-17 08:53:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284380087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:53:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613174717] [2024-10-17 08:53:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:41,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:53:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:53:41,527 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 08:53:41,529 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 08:53:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:41,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 08:53:41,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:53:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 08:53:41,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:53:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 08:53:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613174717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:53:41,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:53:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-17 08:53:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715038315] [2024-10-17 08:53:41,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:53:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 08:53:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:53:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 08:53:41,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-17 08:53:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:41,854 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:53:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 08:53:41,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:41,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:53:41,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 08:53:42,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:53:42,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:53:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:53:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1283021578, now seen corresponding path program 2 times [2024-10-17 08:53:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:53:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577938058] [2024-10-17 08:53:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:53:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:53:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:53:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:53:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:53:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577938058] [2024-10-17 08:53:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577938058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:53:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561396914] [2024-10-17 08:53:45,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 08:53:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:53:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:53:45,026 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 08:53:45,027 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 08:53:45,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 08:53:45,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:53:45,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-17 08:53:45,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:53:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:53:45,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:53:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:53:52,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561396914] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:53:52,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:53:52,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2024-10-17 08:53:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983191963] [2024-10-17 08:53:52,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:53:52,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 08:53:52,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:53:52,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 08:53:52,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=329, Unknown=3, NotChecked=0, Total=420 [2024-10-17 08:53:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:53:52,256 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:53:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 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 08:53:52,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:53:52,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:52,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:53:52,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:53:52,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:54:01,921 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 08:54:16,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_~i1~0 4294967296)) (.cse8 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296)) (.cse1 (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2)) (.cse0 (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2)) (.cse2 (+ (mod (+ c_~i1~0 1) 4294967296) 1))) (and (< (mod c_~i2~0 4294967296) (* (mod c_~N~0 2147483648) 2)) (< .cse0 (+ (mod (+ c_~i1~0 2) 4294967296) 1)) (< .cse1 .cse2) (let ((.cse10 (div c_~N~0 2147483648))) (let ((.cse3 (* 8589934592 .cse10)) (.cse4 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse6 (* c_~i1~0 (- 1))) (.cse5 (* c_~N~0 2))) (or (< (+ 2 .cse3 c_~i2~0) (+ .cse4 .cse5 (* (div (+ .cse5 c_~i2~0 (- 4294967297) .cse6) 4294967296) 4294967296))) (let ((.cse7 (* (div (+ (- 1) .cse5 c_~i2~0 .cse6) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse7) (+ .cse5 .cse8)) (<= (+ 3 .cse3 c_~i2~0) (+ .cse4 .cse5 .cse7)))) (< (+ .cse5 (* 4294967296 .cse9)) (+ c_~i1~0 (* .cse10 4294967296) 1))))) (<= (+ (* 8589934592 .cse9) (* (div c_~i1~0 2) 2) c_~i2~0 1) (+ .cse8 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2))) (< .cse1 (+ (mod c_~i1~0 4294967296) 1)) (< .cse0 .cse2))) is different from false [2024-10-17 08:54:17,546 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 08:54:20,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~i1~0 4294967296)) (.cse7 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296)) (.cse0 (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2)) (.cse1 (+ (mod (+ c_~i1~0 1) 4294967296) 1))) (and (< (mod c_~i2~0 4294967296) (* (mod c_~N~0 2147483648) 2)) (< .cse0 .cse1) (let ((.cse9 (div c_~N~0 2147483648))) (let ((.cse2 (* 8589934592 .cse9)) (.cse3 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse5 (* c_~i1~0 (- 1))) (.cse4 (* c_~N~0 2))) (or (< (+ 2 .cse2 c_~i2~0) (+ .cse3 .cse4 (* (div (+ .cse4 c_~i2~0 (- 4294967297) .cse5) 4294967296) 4294967296))) (let ((.cse6 (* (div (+ (- 1) .cse4 c_~i2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse6) (+ .cse4 .cse7)) (<= (+ 3 .cse2 c_~i2~0) (+ .cse3 .cse4 .cse6)))) (< (+ .cse4 (* 4294967296 .cse8)) (+ c_~i1~0 (* .cse9 4294967296) 1))))) (<= (+ (* 8589934592 .cse8) (* (div c_~i1~0 2) 2) c_~i2~0 1) (+ .cse7 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2))) (< .cse0 (+ (mod c_~i1~0 4294967296) 1)) (< (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2) .cse1))) is different from false [2024-10-17 08:54:34,937 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 (div c_~N~0 2147483648))) (let ((.cse0 (* 8589934592 .cse5)) (.cse1 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse3 (* c_~i1~0 (- 1))) (.cse2 (* c_~N~0 2))) (or (< (+ 2 .cse0 c_~i2~0) (+ .cse1 .cse2 (* (div (+ .cse2 c_~i2~0 (- 4294967297) .cse3) 4294967296) 4294967296))) (let ((.cse4 (* (div (+ (- 1) .cse2 c_~i2~0 .cse3) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse4) (+ .cse2 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse0 c_~i2~0) (+ .cse1 .cse2 .cse4)))) (< (+ .cse2 (* 4294967296 (div c_~i1~0 4294967296))) (+ c_~i1~0 (* .cse5 4294967296) 1))))) (< (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2) (+ (mod c_~i1~0 4294967296) 1)) (< (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2) (+ (mod (+ c_~i1~0 1) 4294967296) 1))) is different from false [2024-10-17 08:54:56,176 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 08:54:58,456 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 (div c_~N~0 2147483648))) (let ((.cse0 (* 8589934592 .cse5)) (.cse1 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse3 (* c_~i1~0 (- 1))) (.cse2 (* c_~N~0 2))) (or (< (+ 2 .cse0 c_~i2~0) (+ .cse1 .cse2 (* (div (+ .cse2 c_~i2~0 (- 4294967297) .cse3) 4294967296) 4294967296))) (let ((.cse4 (* (div (+ (- 1) .cse2 c_~i2~0 .cse3) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse4) (+ .cse2 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse0 c_~i2~0) (+ .cse1 .cse2 .cse4)))) (< (+ .cse2 (* 4294967296 (div c_~i1~0 4294967296))) (+ c_~i1~0 (* .cse5 4294967296) 1))))) (< (* 2 (div (mod c_~i2~0 4294967296) 2)) (+ (mod c_~i1~0 4294967296) 1))) is different from false [2024-10-17 08:55:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:55:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:55:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:55:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:55:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-17 08:55:18,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-17 08:55:19,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:55:19,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 08:55:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:55:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -688646322, now seen corresponding path program 3 times [2024-10-17 08:55:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:55:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543033854] [2024-10-17 08:55:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:55:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:55:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:55:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 36 proven. 175 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-17 08:55:20,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:55:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543033854] [2024-10-17 08:55:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543033854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:55:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554441820] [2024-10-17 08:55:20,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 08:55:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:55:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:55:20,224 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 08:55:20,225 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 08:55:20,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-17 08:55:20,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:55:20,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 08:55:20,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:55:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 29 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:55:21,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:55:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 29 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 08:55:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554441820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:55:34,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:55:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-10-17 08:55:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190535013] [2024-10-17 08:55:34,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:55:34,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-17 08:55:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:55:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-17 08:55:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2024-10-17 08:55:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:55:34,466 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:55:34,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.056603773584905) internal successors, (215), 52 states have internal predecessors, (215), 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 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-17 08:55:34,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:56:39,482 WARN L286 SmtUtils]: Spent 35.71s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 08:56:41,485 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 08:56:43,506 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 08:56:44,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 08:56:46,989 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 08:56:48,992 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 08:57:46,003 WARN L286 SmtUtils]: Spent 47.05s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 08:57:48,007 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 08:57:50,012 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 08:58:41,964 WARN L286 SmtUtils]: Spent 36.99s on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 08:58:44,068 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 08:58:46,071 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 08:58:48,075 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 08:58:50,080 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 08:58:52,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 08:58:54,034 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 08:58:56,384 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 08:58:58,797 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 08:59:32,488 WARN L286 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 08:59:35,379 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 08:59:37,381 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 09:00:06,808 WARN L286 SmtUtils]: Spent 15.92s on a formula simplification. DAG size of input: 70 DAG size of output: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:00:08,811 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 09:00:10,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:00:11,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:00:12,987 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 09:00:15,020 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 09:00:38,345 WARN L286 SmtUtils]: Spent 12.58s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:00:40,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:00:42,297 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 09:00:43,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:00:45,629 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 09:01:17,771 WARN L286 SmtUtils]: Spent 14.28s on a formula simplification. DAG size of input: 71 DAG size of output: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:01:19,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:01:21,031 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 09:01:23,038 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 09:01:25,044 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 09:01:28,169 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 09:01:30,171 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 09:01:31,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:01:33,507 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 09:01:35,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 09:01:37,515 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 09:01:39,518 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 09:02:35,427 WARN L286 SmtUtils]: Spent 45.86s on a formula simplification. DAG size of input: 74 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:02:38,042 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 09:02:40,800 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 09:02:44,360 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 09:03:19,539 WARN L286 SmtUtils]: Spent 15.87s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:03:21,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:03:23,824 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 09:03:25,833 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 09:03:27,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:03:29,023 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 09:03:57,017 WARN L286 SmtUtils]: Spent 19.89s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:03:59,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 09:04:01,030 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 09:04:02,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:04:23,740 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 09:04:25,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:04:27,748 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 09:04:47,611 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:04:49,614 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 09:04:51,618 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 09:04:53,961 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 09:04:55,964 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 09:04:57,973 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 09:04:59,979 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 09:05:26,131 WARN L286 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:05:46,533 WARN L286 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 62 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:05:47,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 09:06:03,802 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 09:06:05,646 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 09:06:07,649 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 09:06:09,652 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 09:06:12,442 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 09:06:14,447 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 09:06:17,068 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 09:06:19,072 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 09:06:46,784 WARN L286 SmtUtils]: Spent 21.76s on a formula simplification. DAG size of input: 65 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:07:02,602 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 09:07:04,605 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 09:07:22,488 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:07:38,852 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 09:07:59,990 WARN L286 SmtUtils]: Spent 9.39s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 09:08:02,600 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 09:08:04,608 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