./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 FORWARD -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 FORWARD -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 19:21:11,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 19:21:11,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 19:21:11,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 19:21:11,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 19:21:11,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 19:21:11,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 19:21:11,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 19:21:11,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 19:21:11,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 19:21:11,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 19:21:11,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 19:21:11,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 19:21:11,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 19:21:11,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 19:21:11,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 19:21:11,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 19:21:11,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 19:21:11,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 19:21:11,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 19:21:11,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 19:21:11,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 19:21:11,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 19:21:11,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 19:21:11,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 19:21:11,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 19:21:11,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 19:21:11,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 19:21:11,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 19:21:11,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 19:21:11,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 19:21:11,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 19:21:11,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 19:21:11,164 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 19:21:11,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 19:21:11,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 19:21:11,165 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 19:21:11,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 19:21:11,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 19:21:11,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 19:21:11,167 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 19:21:11,167 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 -> FORWARD [2024-10-17 19:21:11,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 19:21:11,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 19:21:11,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 19:21:11,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 19:21:11,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 19:21:11,418 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 19:21:12,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 19:21:12,980 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 19:21:12,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-10-17 19:21:12,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b5b4d6cd1/1fbe46b199674930a17a1e608b2105d1/FLAG076af1c87 [2024-10-17 19:21:13,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b5b4d6cd1/1fbe46b199674930a17a1e608b2105d1 [2024-10-17 19:21:13,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 19:21:13,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 19:21:13,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 19:21:13,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 19:21:13,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 19:21:13,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1688714e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13, skipping insertion in model container [2024-10-17 19:21:13,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 19:21:13,234 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 19:21:13,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 19:21:13,246 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 19:21:13,264 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 19:21:13,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 19:21:13,281 INFO L204 MainTranslator]: Completed translation [2024-10-17 19:21:13,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13 WrapperNode [2024-10-17 19:21:13,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 19:21:13,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 19:21:13,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 19:21:13,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 19:21:13,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,313 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-17 19:21:13,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 19:21:13,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 19:21:13,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 19:21:13,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 19:21:13,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 19:21:13,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 19:21:13,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 19:21:13,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 19:21:13,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (1/1) ... [2024-10-17 19:21:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 19:21:13,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 19:21:13,387 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 19:21:13,390 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 19:21:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 19:21:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 19:21:13,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 19:21:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 19:21:13,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 19:21:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 19:21:13,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 19:21:13,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 19:21:13,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 19:21:13,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 19:21:13,434 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 19:21:13,514 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 19:21:13,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 19:21:13,677 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 19:21:13,677 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 19:21:13,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 19:21:13,829 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 19:21:13,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 07:21:13 BoogieIcfgContainer [2024-10-17 19:21:13,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 19:21:13,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 19:21:13,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 19:21:13,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 19:21:13,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 07:21:13" (1/3) ... [2024-10-17 19:21:13,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb44267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 07:21:13, skipping insertion in model container [2024-10-17 19:21:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 07:21:13" (2/3) ... [2024-10-17 19:21:13,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb44267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 07:21:13, skipping insertion in model container [2024-10-17 19:21:13,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 07:21:13" (3/3) ... [2024-10-17 19:21:13,864 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-10-17 19:21:13,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 19:21:13,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 19:21:13,880 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 19:21:13,948 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 19:21:13,996 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 19:21:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 19:21:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 19:21:14,001 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 19:21:14,003 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 19:21:14,077 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 19:21:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:14,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 19:21:14,098 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;@585054d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=FORWARD, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 19:21:14,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 19:21:14,437 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 19:21:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1167579706, now seen corresponding path program 1 times [2024-10-17 19:21:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:21:14,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826275028] [2024-10-17 19:21:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:21:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:14,857 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 19:21:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:21:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826275028] [2024-10-17 19:21:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826275028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 19:21:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 19:21:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-17 19:21:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888556268] [2024-10-17 19:21:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 19:21:14,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 19:21:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:21:14,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 19:21:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 19:21:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:14,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:21:14,894 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 19:21:14,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:14,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 19:21:14,996 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 19:21:14,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1867846974, now seen corresponding path program 1 times [2024-10-17 19:21:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:21:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567584755] [2024-10-17 19:21:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:21:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:15,316 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 19:21:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:21:15,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567584755] [2024-10-17 19:21:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567584755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 19:21:15,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 19:21:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 19:21:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819188285] [2024-10-17 19:21:15,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 19:21:15,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 19:21:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:21:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 19:21:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 19:21:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:15,324 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:21:15,325 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 19:21:15,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:15,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 19:21:15,444 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 19:21:15,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 930523526, now seen corresponding path program 1 times [2024-10-17 19:21:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:21:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399738543] [2024-10-17 19:21:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:21:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:15,713 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 19:21:15,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:21:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399738543] [2024-10-17 19:21:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399738543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 19:21:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 19:21:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 19:21:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593546594] [2024-10-17 19:21:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 19:21:15,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 19:21:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:21:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 19:21:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 19:21:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:15,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:21:15,717 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 19:21:15,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:15,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:15,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:15,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-17 19:21:15,805 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 19:21:15,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1773299046, now seen corresponding path program 1 times [2024-10-17 19:21:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:21:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847782198] [2024-10-17 19:21:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:21:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:16,135 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 19:21:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:21:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847782198] [2024-10-17 19:21:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847782198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 19:21:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29327303] [2024-10-17 19:21:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:16,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 19:21:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 19:21:16,140 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 19:21:16,142 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 19:21:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:16,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 19:21:16,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 19:21:16,375 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 19:21:16,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 19:21:16,507 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 19:21:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29327303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 19:21:16,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 19:21:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-17 19:21:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632911035] [2024-10-17 19:21:16,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 19:21:16,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 19:21:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:21:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 19:21:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-17 19:21:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:16,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:21:16,509 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 19:21:16,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:16,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:16,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:16,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 19:21:16,654 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 19:21:16,838 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 19:21:16,839 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 19:21:16,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:21:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1283021578, now seen corresponding path program 2 times [2024-10-17 19:21:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:21:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007798643] [2024-10-17 19:21:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:21:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:21:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:21:19,762 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 19:21:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:21:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007798643] [2024-10-17 19:21:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007798643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 19:21:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627018211] [2024-10-17 19:21:19,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 19:21:19,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 19:21:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 19:21:19,765 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 19:21:19,767 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 19:21:19,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 19:21:19,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 19:21:19,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-17 19:21:19,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 19:21:20,501 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 19:21:20,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 19:21:26,904 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 19:21:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627018211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 19:21:26,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 19:21:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2024-10-17 19:21:26,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605267151] [2024-10-17 19:21:26,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 19:21:26,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 19:21:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:21:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 19:21:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=329, Unknown=3, NotChecked=0, Total=420 [2024-10-17 19:21:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:26,908 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:21:26,908 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 19:21:26,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:21:26,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:26,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:21:26,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 19:21:26,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:21:32,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:21:35,158 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 19:21:36,828 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 19:21:38,907 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 19:22:03,431 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 19:22:10,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_~N~0 2147483648))) (let ((.cse1 (* c_~N~0 2)) (.cse13 (div c_~i1~0 4294967296)) (.cse0 (* .cse12 4294967296))) (let ((.cse11 (+ c_~i1~0 .cse0 1)) (.cse10 (+ .cse1 (* 4294967296 .cse13))) (.cse9 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296)) (.cse3 (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2)) (.cse2 (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2)) (.cse4 (+ (mod (+ c_~i1~0 1) 4294967296) 1))) (and (< (+ .cse0 c_~i2~0 1) (+ .cse1 (* (div c_~i2~0 4294967296) 4294967296))) (< .cse2 (+ (mod (+ c_~i1~0 2) 4294967296) 1)) (< .cse3 .cse4) (let ((.cse5 (* 8589934592 .cse12)) (.cse6 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse7 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse5 c_~i2~0) (+ .cse6 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse7) 4294967296) 4294967296))) (let ((.cse8 (* (div (+ (- 1) .cse1 c_~i2~0 .cse7) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse8) (+ .cse1 .cse9)) (<= (+ 3 .cse5 c_~i2~0) (+ .cse6 .cse1 .cse8)))) (< .cse10 .cse11))) (<= .cse11 .cse10) (<= (+ (* 8589934592 .cse13) (* (div c_~i1~0 2) 2) c_~i2~0 1) (+ .cse9 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2))) (< .cse3 (+ (mod c_~i1~0 4294967296) 1)) (< .cse2 .cse4))))) is different from false [2024-10-17 19:22:13,628 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 19:22:30,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~N~0 2147483648))) (let ((.cse2 (* (div c_~i2~0 4294967296) 4294967296)) (.cse1 (* c_~N~0 2)) (.cse3 (div c_~i1~0 4294967296)) (.cse0 (* .cse8 4294967296))) (and (< (+ .cse0 c_~i2~0 1) (+ .cse1 .cse2)) (<= (+ (* 8589934592 .cse3) (* (div c_~i1~0 2) 2) 2 c_~i2~0) (+ (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2) .cse2)) (let ((.cse4 (* 8589934592 .cse8)) (.cse5 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse6 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse4 c_~i2~0) (+ .cse5 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse6) 4294967296) 4294967296))) (let ((.cse7 (* (div (+ (- 1) .cse1 c_~i2~0 .cse6) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse7) (+ .cse1 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse4 c_~i2~0) (+ .cse5 .cse1 .cse7)))) (< (+ .cse1 (* 4294967296 .cse3)) (+ c_~i1~0 .cse0 1))))))) is different from false [2024-10-17 19:22:32,847 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 19:22:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:22:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:22:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:22:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 19:22:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-17 19:22:39,173 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 19:22:39,356 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 19:22:39,356 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 19:22:39,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 19:22:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash -688646322, now seen corresponding path program 3 times [2024-10-17 19:22:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 19:22:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065268465] [2024-10-17 19:22:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 19:22:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 19:22:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 19:22:40,518 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 19:22:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 19:22:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065268465] [2024-10-17 19:22:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065268465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 19:22:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707075658] [2024-10-17 19:22:40,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 19:22:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 19:22:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 19:22:40,522 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 19:22:40,523 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 19:22:40,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-17 19:22:40,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 19:22:40,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 19:22:40,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 19:22:42,934 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 19:22:42,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 19:22:53,965 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 19:22:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707075658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 19:22:53,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 19:22:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-10-17 19:22:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923471991] [2024-10-17 19:22:53,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 19:22:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-17 19:22:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 19:22:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-17 19:22:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2024-10-17 19:22:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:22:53,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 19:22:53,969 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 19:22:53,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 19:22:53,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:22:53,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 19:22:53,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 19:22:53,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-17 19:22:53,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 19:23:40,946 WARN L286 SmtUtils]: Spent 18.69s 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 19:23:42,951 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 19:23:44,963 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 19:23:46,966 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 19:23:49,073 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 19:23:50,398 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 19:24:47,781 WARN L286 SmtUtils]: Spent 47.37s 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 19:24:49,783 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 19:24:51,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 19:25:31,790 WARN L286 SmtUtils]: Spent 25.39s on a formula simplification. DAG size of input: 78 DAG size of output: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 19:25:34,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:25:36,127 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 19:25:38,709 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 19:25:40,727 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 19:25:43,346 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 19:25:45,351 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 19:25:48,103 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 19:26:17,865 WARN L286 SmtUtils]: Spent 12.03s 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 19:26:20,002 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 19:26:22,006 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 19:26:24,009 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 19:26:25,054 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 19:26:45,818 WARN L286 SmtUtils]: Spent 7.97s 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 19:26:46,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:26:48,927 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 19:26:51,898 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 19:26:53,900 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 19:27:27,915 WARN L286 SmtUtils]: Spent 18.29s 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 19:27:29,685 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 19:27:31,883 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 19:27:33,885 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 19:27:36,722 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 19:27:38,727 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 19:27:40,732 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 19:27:42,193 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 19:27:45,438 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 19:27:47,526 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 19:27:49,861 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 19:28:08,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:28:10,358 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 19:28:13,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:28:14,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:29:20,947 WARN L286 SmtUtils]: Spent 58.79s on a formula simplification. DAG size of input: 75 DAG size of output: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 19:29:22,427 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 19:29:24,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:29:27,108 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 19:29:29,121 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 19:29:50,983 WARN L286 SmtUtils]: Spent 6.85s 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 19:29:52,994 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 19:29:55,687 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 19:29:57,904 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 19:29:58,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:30:00,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:30:02,717 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 19:30:25,348 WARN L286 SmtUtils]: Spent 11.94s 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 19:30:27,815 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 19:30:50,059 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 19:30:52,392 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 19:30:54,395 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 19:30:56,406 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 19:31:26,789 WARN L286 SmtUtils]: Spent 14.74s 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 19:31:29,959 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 19:31:31,963 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 19:31:33,967 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 19:31:35,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 19:31:37,980 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 19:31:39,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:32:00,391 WARN L286 SmtUtils]: Spent 9.93s 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 19:32:02,707 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 19:32:21,516 WARN L286 SmtUtils]: Spent 11.28s 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 19:32:23,540 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 19:32:25,542 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 19:32:27,544 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 19:32:37,980 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 19:32:49,978 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 19:32:51,257 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 19:32:53,259 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 19:32:55,725 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 19:32:57,728 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 19:33:29,499 WARN L286 SmtUtils]: Spent 21.68s on a formula simplification. DAG size of input: 67 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 19:33:47,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:33:49,495 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 19:34:12,928 WARN L286 SmtUtils]: Spent 13.41s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 19:34:14,933 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 19:34:34,010 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 19:34:52,079 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 19:34:54,159 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 19:34:56,163 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 19:35:12,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 19:35:14,298 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 19:35:21,316 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 19:35:35,182 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15