./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 SLEEP_SET -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 SLEEP_SET -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 12:21:28,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 12:21:28,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 12:21:28,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 12:21:28,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 12:21:28,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 12:21:28,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 12:21:28,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 12:21:28,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 12:21:28,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 12:21:28,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 12:21:28,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 12:21:28,841 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 12:21:28,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 12:21:28,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 12:21:28,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 12:21:28,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 12:21:28,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 12:21:28,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 12:21:28,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 12:21:28,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 12:21:28,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 12:21:28,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 12:21:28,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 12:21:28,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 12:21:28,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 12:21:28,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 12:21:28,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 12:21:28,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 12:21:28,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 12:21:28,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 12:21:28,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 12:21:28,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 12:21:28,852 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 12:21:28,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 12:21:28,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 12:21:28,853 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 12:21:28,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 12:21:28,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 12:21:28,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 12:21:28,853 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 12:21:28,855 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 -> SLEEP_SET [2024-10-17 12:21:29,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 12:21:29,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 12:21:29,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 12:21:29,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 12:21:29,147 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 12:21:29,148 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 12:21:30,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 12:21:30,732 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 12:21:30,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-10-17 12:21:30,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9ec825330/ccf825b29dca49f3ac41b84e2f84f401/FLAG910f2b7f2 [2024-10-17 12:21:30,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9ec825330/ccf825b29dca49f3ac41b84e2f84f401 [2024-10-17 12:21:30,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 12:21:30,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 12:21:30,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 12:21:30,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 12:21:30,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 12:21:30,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 12:21:30" (1/1) ... [2024-10-17 12:21:30,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22616b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:30, skipping insertion in model container [2024-10-17 12:21:30,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 12:21:30" (1/1) ... [2024-10-17 12:21:30,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 12:21:30,943 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 12:21:30,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 12:21:30,954 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 12:21:30,974 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 12:21:30,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 12:21:31,007 INFO L204 MainTranslator]: Completed translation [2024-10-17 12:21:31,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31 WrapperNode [2024-10-17 12:21:31,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 12:21:31,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 12:21:31,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 12:21:31,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 12:21:31,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,045 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-17 12:21:31,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 12:21:31,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 12:21:31,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 12:21:31,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 12:21:31,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 12:21:31,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 12:21:31,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 12:21:31,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 12:21:31,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (1/1) ... [2024-10-17 12:21:31,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 12:21:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 12:21:31,105 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 12:21:31,111 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 12:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 12:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 12:21:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 12:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 12:21:31,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 12:21:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 12:21:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 12:21:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 12:21:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 12:21:31,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 12:21:31,152 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 12:21:31,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 12:21:31,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 12:21:31,393 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 12:21:31,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 12:21:31,581 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 12:21:31,581 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 12:21:31,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 12:21:31 BoogieIcfgContainer [2024-10-17 12:21:31,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 12:21:31,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 12:21:31,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 12:21:31,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 12:21:31,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 12:21:30" (1/3) ... [2024-10-17 12:21:31,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fc27ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 12:21:31, skipping insertion in model container [2024-10-17 12:21:31,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 12:21:31" (2/3) ... [2024-10-17 12:21:31,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fc27ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 12:21:31, skipping insertion in model container [2024-10-17 12:21:31,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 12:21:31" (3/3) ... [2024-10-17 12:21:31,590 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-10-17 12:21:31,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 12:21:31,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 12:21:31,608 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 12:21:31,644 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 12:21:31,686 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 12:21:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 12:21:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 12:21:31,689 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 12:21:31,690 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 12:21:31,773 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 12:21:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:31,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 12:21:31,801 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;@64e578b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 12:21:31,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 12:21:32,199 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 12:21:32,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:32,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1167579706, now seen corresponding path program 1 times [2024-10-17 12:21:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:21:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828284926] [2024-10-17 12:21:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:21:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:32,568 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 12:21:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:21:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828284926] [2024-10-17 12:21:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828284926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 12:21:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 12:21:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-17 12:21:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507359200] [2024-10-17 12:21:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 12:21:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 12:21:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:21:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 12:21:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 12:21:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:32,605 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:21:32,606 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 12:21:32,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:32,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 12:21:32,717 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 12:21:32,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1867846974, now seen corresponding path program 1 times [2024-10-17 12:21:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:21:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8198554] [2024-10-17 12:21:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:21:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:32,988 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 12:21:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:21:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8198554] [2024-10-17 12:21:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8198554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 12:21:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 12:21:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 12:21:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206410792] [2024-10-17 12:21:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 12:21:32,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 12:21:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:21:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 12:21:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 12:21:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:32,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:21:32,995 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 12:21:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:33,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 12:21:33,099 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 12:21:33,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 930523526, now seen corresponding path program 1 times [2024-10-17 12:21:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:21:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60950369] [2024-10-17 12:21:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:21:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:33,381 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 12:21:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:21:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60950369] [2024-10-17 12:21:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60950369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 12:21:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 12:21:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-17 12:21:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648887605] [2024-10-17 12:21:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 12:21:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 12:21:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:21:33,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 12:21:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 12:21:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:33,386 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:21:33,386 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 12:21:33,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:33,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:33,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:33,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-17 12:21:33,474 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 12:21:33,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1773299046, now seen corresponding path program 1 times [2024-10-17 12:21:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:21:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654862073] [2024-10-17 12:21:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:21:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:33,816 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 12:21:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:21:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654862073] [2024-10-17 12:21:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654862073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 12:21:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541344470] [2024-10-17 12:21:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 12:21:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 12:21:33,821 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 12:21:33,822 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 12:21:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:33,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 12:21:33,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 12:21:34,009 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 12:21:34,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 12:21:34,118 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 12:21:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541344470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 12:21:34,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 12:21:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-17 12:21:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865231689] [2024-10-17 12:21:34,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 12:21:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 12:21:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:21:34,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 12:21:34,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-17 12:21:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:34,122 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:21:34,122 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 12:21:34,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:34,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:34,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:34,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 12:21:34,252 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 12:21:34,435 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 12:21:34,436 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 12:21:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:21:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1283021578, now seen corresponding path program 2 times [2024-10-17 12:21:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:21:34,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819019392] [2024-10-17 12:21:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:21:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:21:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:21:37,148 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 12:21:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:21:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819019392] [2024-10-17 12:21:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819019392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 12:21:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637960933] [2024-10-17 12:21:37,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 12:21:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 12:21:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 12:21:37,155 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 12:21:37,167 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 12:21:37,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 12:21:37,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 12:21:37,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-17 12:21:37,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 12:21:38,213 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 12:21:38,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 12:21:44,782 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 12:21:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637960933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 12:21:44,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 12:21:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2024-10-17 12:21:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241010074] [2024-10-17 12:21:44,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 12:21:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 12:21:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:21:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 12:21:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=329, Unknown=4, NotChecked=0, Total=420 [2024-10-17 12:21:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:44,787 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:21:44,787 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 12:21:44,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:21:44,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:44,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:21:44,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 12:21:44,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:21:47,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:21:51,688 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 12:22:04,836 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 12:22:07,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~N~0 2147483648))) (let ((.cse1 (* c_~N~0 2)) (.cse9 (div c_~i1~0 4294967296)) (.cse0 (* .cse8 4294967296))) (let ((.cse2 (< (+ .cse1 (* 4294967296 .cse9)) (+ c_~i1~0 .cse0 1))) (.cse7 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (and (or (< (+ .cse0 c_~i2~0 1) (+ .cse1 (* (div c_~i2~0 4294967296) 4294967296))) .cse2) (< (mod c_~i2~0 4294967296) (* (mod c_~N~0 2147483648) 2)) (let ((.cse3 (* 8589934592 .cse8)) (.cse4 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse5 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse3 c_~i2~0) (+ .cse4 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse5) 4294967296) 4294967296))) (let ((.cse6 (* (div (+ (- 1) .cse1 c_~i2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse6) (+ .cse1 .cse7)) (<= (+ 3 .cse3 c_~i2~0) (+ .cse4 .cse1 .cse6)))) .cse2)) (<= (+ (* 8589934592 .cse9) (* (div c_~i1~0 2) 2) c_~i2~0 1) (+ .cse7 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2))) (< (* (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 12:22:29,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:22:31,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_~N~0 2147483648))) (let ((.cse1 (* c_~N~0 2)) (.cse0 (* .cse7 4294967296))) (let ((.cse2 (< (+ .cse1 (* 4294967296 (div c_~i1~0 4294967296))) (+ c_~i1~0 .cse0 1)))) (and (or (< (+ .cse0 c_~i2~0 1) (+ .cse1 (* (div c_~i2~0 4294967296) 4294967296))) .cse2) (let ((.cse3 (* 8589934592 .cse7)) (.cse4 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse5 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse3 c_~i2~0) (+ .cse4 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse5) 4294967296) 4294967296))) (let ((.cse6 (* (div (+ (- 1) .cse1 c_~i2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse6) (+ .cse1 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse3 c_~i2~0) (+ .cse4 .cse1 .cse6)))) .cse2)) (< (* (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 12:22:33,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 12:22:35,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:22:37,365 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 12:22:39,368 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 12:22:41,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_~N~0 2147483648))) (let ((.cse1 (* c_~N~0 2)) (.cse0 (* .cse9 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 .cse9)) (.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 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse5 c_~i2~0) (+ .cse6 .cse1 .cse8)))) (< (+ .cse1 (* 4294967296 (div c_~i1~0 4294967296))) (+ c_~i1~0 .cse0 1)))) (< .cse3 (+ (mod c_~i1~0 4294967296) 1)) (< .cse2 .cse4)))) is different from false [2024-10-17 12:23:10,212 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 74 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:23:27,451 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 12:23:37,309 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 12:23:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:23:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:23:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:23:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 12:23:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-17 12:23:48,078 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 12:23:48,262 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 12:23:48,262 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 12:23:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 12:23:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -688646322, now seen corresponding path program 3 times [2024-10-17 12:23:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 12:23:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287129462] [2024-10-17 12:23:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 12:23:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 12:23:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 12:23:49,282 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 12:23:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 12:23:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287129462] [2024-10-17 12:23:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287129462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 12:23:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969122461] [2024-10-17 12:23:49,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 12:23:49,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 12:23:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 12:23:49,285 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 12:23:49,286 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 12:23:49,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-17 12:23:49,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 12:23:49,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 12:23:49,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 12:23:51,016 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 12:23:51,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 12:24:02,741 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 12:24:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969122461] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 12:24:02,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 12:24:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-10-17 12:24:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993790921] [2024-10-17 12:24:02,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 12:24:02,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-17 12:24:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:24:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-17 12:24:02,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2024-10-17 12:24:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:24:02,748 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:24:02,748 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 12:24:02,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:24:02,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:24:02,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 12:24:02,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 12:24:02,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-17 12:24:02,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:24:51,572 WARN L286 SmtUtils]: Spent 16.27s 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 12:24:54,270 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 12:24:55,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:24:57,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 12:24:59,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:25:46,252 WARN L286 SmtUtils]: Spent 36.32s on a formula simplification. DAG size of input: 75 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:25:48,255 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 12:25:50,262 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 12:25:51,726 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 12:26:46,853 WARN L286 SmtUtils]: Spent 38.01s 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 12:26:48,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:26:50,940 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 12:26:51,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:26:53,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 12:26:57,391 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 12:27:00,149 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 12:27:02,152 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 12:27:03,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:27:05,327 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 12:27:45,502 WARN L286 SmtUtils]: Spent 22.37s 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 12:27:49,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:28:10,355 WARN L286 SmtUtils]: Spent 6.20s 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 12:28:13,354 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 12:28:15,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:28:17,592 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 12:28:44,268 WARN L286 SmtUtils]: Spent 15.53s 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 12:28:47,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:28:50,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 12:28:51,580 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 12:28:53,588 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 12:28:56,348 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 12:28:58,357 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 12:28:59,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:29:01,389 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 12:29:03,398 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 12:29:05,403 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 12:29:07,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:29:08,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:29:10,995 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 12:30:05,396 WARN L286 SmtUtils]: Spent 49.40s on a formula simplification. DAG size of input: 75 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:30:08,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:30:10,257 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 12:30:12,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:30:37,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:30:39,535 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 12:30:42,155 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 12:30:44,161 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 12:30:46,166 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 12:31:13,997 WARN L286 SmtUtils]: Spent 14.65s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:31:16,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 12:31:18,013 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 12:31:20,592 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 12:31:46,491 WARN L286 SmtUtils]: Spent 13.72s 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 12:31:48,494 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 12:31:50,497 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 12:31:51,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:32:24,340 WARN L286 SmtUtils]: Spent 17.46s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:32:26,342 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 12:32:28,352 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 12:32:31,063 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 12:32:32,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:32:34,300 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 12:32:36,420 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 12:32:38,422 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 12:32:59,064 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 12:33:10,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:33:32,166 WARN L286 SmtUtils]: Spent 11.99s 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 12:33:34,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 12:33:36,180 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 12:33:38,182 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 12:33:40,186 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 12:33:43,120 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 12:33:46,058 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 12:33:48,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:33:50,064 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 12:34:26,044 WARN L286 SmtUtils]: Spent 25.66s on a formula simplification. DAG size of input: 64 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:34:50,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:34:53,000 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 12:35:16,900 WARN L286 SmtUtils]: Spent 10.01s 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 12:35:18,908 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 12:35:20,912 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 12:35:39,001 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 12:35:41,005 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 12:36:03,270 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 12:36:05,275 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