/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 11:00:51,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 11:00:51,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 11:00:51,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 11:00:51,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 11:00:51,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 11:00:51,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 11:00:51,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 11:00:51,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 11:00:51,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 11:00:51,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 11:00:51,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 11:00:51,340 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 11:00:51,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 11:00:51,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 11:00:51,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 11:00:51,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 11:00:51,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 11:00:51,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 11:00:51,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 11:00:51,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 11:00:51,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 11:00:51,344 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 11:00:51,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 11:00:51,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 11:00:51,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 11:00:51,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 11:00:51,358 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 11:00:51,360 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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 11:00:51,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 11:00:51,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 11:00:51,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 11:00:51,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 11:00:51,586 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 11:00:51,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-07 11:00:52,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 11:00:52,890 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 11:00:52,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-07 11:00:52,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/024efc8b2/d42052a20b3a4a86b67c182a7892ba31/FLAG31cbe7949 [2024-05-07 11:00:52,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/024efc8b2/d42052a20b3a4a86b67c182a7892ba31 [2024-05-07 11:00:52,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 11:00:52,932 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 11:00:52,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 11:00:52,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 11:00:52,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 11:00:52,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 11:00:52" (1/1) ... [2024-05-07 11:00:52,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ef1171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:52, skipping insertion in model container [2024-05-07 11:00:52,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 11:00:52" (1/1) ... [2024-05-07 11:00:52,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 11:00:53,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3373,3386] [2024-05-07 11:00:53,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 11:00:53,203 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 11:00:53,226 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3373,3386] [2024-05-07 11:00:53,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 11:00:53,233 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 11:00:53,233 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 11:00:53,238 INFO L206 MainTranslator]: Completed translation [2024-05-07 11:00:53,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53 WrapperNode [2024-05-07 11:00:53,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 11:00:53,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 11:00:53,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 11:00:53,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 11:00:53,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,278 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-07 11:00:53,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 11:00:53,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 11:00:53,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 11:00:53,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 11:00:53,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 11:00:53,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 11:00:53,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 11:00:53,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 11:00:53,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (1/1) ... [2024-05-07 11:00:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 11:00:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:00:53,343 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-05-07 11:00:53,366 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-05-07 11:00:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 11:00:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 11:00:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 11:00:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 11:00:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 11:00:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-07 11:00:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-07 11:00:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-07 11:00:53,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-07 11:00:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 11:00:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 11:00:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 11:00:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 11:00:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 11:00:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 11:00:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 11:00:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 11:00:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 11:00:53,404 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 11:00:53,495 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 11:00:53,496 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 11:00:53,674 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 11:00:53,716 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 11:00:53,716 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-07 11:00:53,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 11:00:53 BoogieIcfgContainer [2024-05-07 11:00:53,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 11:00:53,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 11:00:53,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 11:00:53,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 11:00:53,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 11:00:52" (1/3) ... [2024-05-07 11:00:53,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62188b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 11:00:53, skipping insertion in model container [2024-05-07 11:00:53,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:00:53" (2/3) ... [2024-05-07 11:00:53,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62188b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 11:00:53, skipping insertion in model container [2024-05-07 11:00:53,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 11:00:53" (3/3) ... [2024-05-07 11:00:53,724 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-07 11:00:53,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 11:00:53,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 11:00:53,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 11:00:53,737 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 11:00:53,799 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-07 11:00:53,833 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 11:00:53,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 11:00:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:00:53,845 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-05-07 11:00:53,846 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-05-07 11:00:53,888 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 11:00:53,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:00:53,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 11:00:53,915 INFO L357 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, mHoare=true, 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;@2c21fca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 11:00:53,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 11:00:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -871162671, now seen corresponding path program 1 times [2024-05-07 11:00:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:00:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:00:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:00:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:00:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 11:00:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 11:00:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728230, now seen corresponding path program 1 times [2024-05-07 11:00:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:00:56,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:00:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:00:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash -506553611, now seen corresponding path program 1 times [2024-05-07 11:00:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:56,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:00:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:00:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:00:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:00:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1506671624, now seen corresponding path program 1 times [2024-05-07 11:00:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:00:59,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:00:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:01:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035535, now seen corresponding path program 2 times [2024-05-07 11:01:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:02,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035693, now seen corresponding path program 3 times [2024-05-07 11:01:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:02,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2102655400, now seen corresponding path program 4 times [2024-05-07 11:01:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 766213304, now seen corresponding path program 5 times [2024-05-07 11:01:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:04,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250254, now seen corresponding path program 6 times [2024-05-07 11:01:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:05,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1797375735, now seen corresponding path program 1 times [2024-05-07 11:01:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1914725460, now seen corresponding path program 1 times [2024-05-07 11:01:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1877897336, now seen corresponding path program 2 times [2024-05-07 11:01:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1490220463, now seen corresponding path program 3 times [2024-05-07 11:01:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:13,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1674660496, now seen corresponding path program 7 times [2024-05-07 11:01:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2017190705, now seen corresponding path program 8 times [2024-05-07 11:01:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -545293969, now seen corresponding path program 9 times [2024-05-07 11:01:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1509557972, now seen corresponding path program 10 times [2024-05-07 11:01:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1057747047, now seen corresponding path program 11 times [2024-05-07 11:01:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -37160196, now seen corresponding path program 12 times [2024-05-07 11:01:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:14,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 710273648, now seen corresponding path program 1 times [2024-05-07 11:01:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -533930189, now seen corresponding path program 2 times [2024-05-07 11:01:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1392112117, now seen corresponding path program 1 times [2024-05-07 11:01:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:01:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:01:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1723310120, now seen corresponding path program 2 times [2024-05-07 11:01:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1547865966, now seen corresponding path program 1 times [2024-05-07 11:01:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1705650139, now seen corresponding path program 2 times [2024-05-07 11:01:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 543290866, now seen corresponding path program 13 times [2024-05-07 11:01:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:32,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash -972840665, now seen corresponding path program 14 times [2024-05-07 11:01:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:32,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash 455880004, now seen corresponding path program 3 times [2024-05-07 11:01:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 845989792, now seen corresponding path program 4 times [2024-05-07 11:01:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1231770049, now seen corresponding path program 15 times [2024-05-07 11:01:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:37,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 845973706, now seen corresponding path program 16 times [2024-05-07 11:01:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:37,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash 458730245, now seen corresponding path program 17 times [2024-05-07 11:01:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:38,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash -646901362, now seen corresponding path program 1 times [2024-05-07 11:01:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:01:42,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:01:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1117990375, now seen corresponding path program 2 times [2024-05-07 11:01:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:43,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 59753310, now seen corresponding path program 1 times [2024-05-07 11:01:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1852353004, now seen corresponding path program 2 times [2024-05-07 11:01:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2034771674, now seen corresponding path program 3 times [2024-05-07 11:01:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:48,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 59757436, now seen corresponding path program 1 times [2024-05-07 11:01:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -552262392, now seen corresponding path program 1 times [2024-05-07 11:01:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:01:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1634088022, now seen corresponding path program 2 times [2024-05-07 11:01:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 11:01:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 11:01:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash 772443970, now seen corresponding path program 3 times [2024-05-07 11:01:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:58,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash -122239328, now seen corresponding path program 1 times [2024-05-07 11:01:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:58,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:58,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:01:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:01:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash 533085738, now seen corresponding path program 2 times [2024-05-07 11:01:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:01:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:01:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash -52366339, now seen corresponding path program 3 times [2024-05-07 11:01:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 11:01:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:59,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:01:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 11:01:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash -653256655, now seen corresponding path program 1 times [2024-05-07 11:01:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:01:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:01:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:02:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-07 11:02:00,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:02:00,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:02:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-05-07 11:02:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:02:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909501639] [2024-05-07 11:02:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-07 11:02:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:02:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909501639] [2024-05-07 11:02:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909501639] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 11:02:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 11:02:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 11:02:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535342674] [2024-05-07 11:02:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 11:02:00,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 11:02:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:02:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 11:02:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-07 11:02:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:00,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:02:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-07 11:02:00,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1843673770, now seen corresponding path program 18 times [2024-05-07 11:02:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:00,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1843673928, now seen corresponding path program 19 times [2024-05-07 11:02:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:00,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash -451200628, now seen corresponding path program 20 times [2024-05-07 11:02:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:02,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1913085912, now seen corresponding path program 21 times [2024-05-07 11:02:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:02,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 941009205, now seen corresponding path program 22 times [2024-05-07 11:02:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-07 11:02:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-07 11:02:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 877779145, now seen corresponding path program 1 times [2024-05-07 11:02:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 24 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 11:02:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 24 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 11:02:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1581207756, now seen corresponding path program 2 times [2024-05-07 11:02:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:11,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 11:02:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1581207598, now seen corresponding path program 3 times [2024-05-07 11:02:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:15,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1581592102, now seen corresponding path program 4 times [2024-05-07 11:02:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:02:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:02:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1634866076, now seen corresponding path program 2 times [2024-05-07 11:02:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:02:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1277875670, now seen corresponding path program 4 times [2024-05-07 11:02:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1623682563, now seen corresponding path program 4 times [2024-05-07 11:02:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:34,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:02:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:02:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2141998477, now seen corresponding path program 2 times [2024-05-07 11:02:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 947774552, now seen corresponding path program 23 times [2024-05-07 11:02:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:02:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:02:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash -522730579, now seen corresponding path program 3 times [2024-05-07 11:02:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 11:02:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 14 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:02:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:53,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable70,SelfDestructingSolverStorable92,SelfDestructingSolverStorable71,SelfDestructingSolverStorable93,SelfDestructingSolverStorable72,SelfDestructingSolverStorable94,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2024-05-07 11:02:53,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:02:53,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:02:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-05-07 11:02:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:02:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279235422] [2024-05-07 11:02:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-07 11:02:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:02:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279235422] [2024-05-07 11:02:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279235422] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:02:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341921919] [2024-05-07 11:02:53,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 11:02:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:02:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:02:53,861 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-05-07 11:02:53,862 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-05-07 11:02:54,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 11:02:54,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 11:02:54,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-07 11:02:54,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:02:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-05-07 11:02:54,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 11:02:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341921919] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 11:02:54,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 11:02:54,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-07 11:02:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322100992] [2024-05-07 11:02:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 11:02:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 11:02:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:02:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:02:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-07 11:02:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:54,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:02:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-05-07 11:02:54,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:54,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:02:55,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 11:02:55,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2024-05-07 11:02:55,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:02:55,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:02:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-05-07 11:02:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:02:55,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747022438] [2024-05-07 11:02:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-07 11:02:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:02:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747022438] [2024-05-07 11:02:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747022438] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:02:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671536822] [2024-05-07 11:02:55,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-07 11:02:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:02:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:02:55,510 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-05-07 11:02:55,512 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-05-07 11:02:55,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-07 11:02:55,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 11:02:55,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-07 11:02:55,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:02:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-07 11:02:55,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 11:02:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 175 proven. 19 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-05-07 11:02:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671536822] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 11:02:55,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 11:02:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2024-05-07 11:02:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340760604] [2024-05-07 11:02:55,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 11:02:55,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-07 11:02:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:02:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-07 11:02:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-05-07 11:02:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:55,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:02:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.5) internal successors, (161), 14 states have internal predecessors, (161), 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-05-07 11:02:55,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:55,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:02:55,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:02:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:02:57,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-07 11:02:57,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:02:57,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:02:57,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:02:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1189536946, now seen corresponding path program 4 times [2024-05-07 11:02:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:02:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453278994] [2024-05-07 11:02:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:02:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-05-07 11:02:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:02:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453278994] [2024-05-07 11:02:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453278994] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 11:02:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 11:02:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 11:02:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066171929] [2024-05-07 11:02:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 11:02:57,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 11:02:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:02:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 11:02:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-07 11:02:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:57,525 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:02:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-07 11:02:57,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:57,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:02:57,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:02:57,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:02:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:02:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:02:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:02:59,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-05-07 11:02:59,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:02:59,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:02:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1960909666, now seen corresponding path program 5 times [2024-05-07 11:02:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:02:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310437902] [2024-05-07 11:02:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:02:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:02:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:03:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 826 proven. 4 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-05-07 11:03:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:03:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310437902] [2024-05-07 11:03:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310437902] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:03:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874850406] [2024-05-07 11:03:00,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-07 11:03:00,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:03:00,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:03:00,118 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-05-07 11:03:00,119 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-05-07 11:03:00,389 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-05-07 11:03:00,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 11:03:00,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-07 11:03:00,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:03:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 833 proven. 110 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2024-05-07 11:03:00,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 11:03:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 826 proven. 4 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-05-07 11:03:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874850406] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 11:03:00,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 11:03:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-05-07 11:03:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269576366] [2024-05-07 11:03:00,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 11:03:00,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-07 11:03:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:03:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-07 11:03:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-05-07 11:03:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:03:00,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:03:00,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-05-07 11:03:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:03:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:03:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:03:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:03:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:03:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:03:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:03:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:03:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:03:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-07 11:03:01,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-07 11:03:02,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:03:02,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:03:02,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:03:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1091151426, now seen corresponding path program 6 times [2024-05-07 11:03:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:03:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660249708] [2024-05-07 11:03:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:03:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:03:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:03:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 692 proven. 1184 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-05-07 11:03:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:03:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660249708] [2024-05-07 11:03:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660249708] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:03:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778717545] [2024-05-07 11:03:18,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-07 11:03:18,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:03:18,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:03:18,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 11:03:18,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-07 11:03:18,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-05-07 11:03:18,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 11:03:18,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 148 conjunts are in the unsatisfiable core [2024-05-07 11:03:18,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:04:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 182 proven. 1788 refuted. 4 times theorem prover too weak. 21 trivial. 0 not checked. [2024-05-07 11:04:46,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 11:04:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 203 proven. 1792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:04:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778717545] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 11:04:56,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 11:04:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 91, 119] total 270 [2024-05-07 11:04:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125666240] [2024-05-07 11:04:56,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 11:04:56,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 270 states [2024-05-07 11:04:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:04:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 270 interpolants. [2024-05-07 11:04:56,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17289, Invalid=55324, Unknown=17, NotChecked=0, Total=72630 [2024-05-07 11:04:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:04:56,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:04:56,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 270 states, 270 states have (on average 2.8444444444444446) internal successors, (768), 270 states have internal predecessors, (768), 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-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-07 11:04:56,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:05:00,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-05-07 11:05:11,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:05:47,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:05:48,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:05:51,386 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-05-07 11:05:53,399 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-05-07 11:05:55,413 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-05-07 11:05:58,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:06:02,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:06:05,347 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-05-07 11:06:07,361 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-05-07 11:06:09,407 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-05-07 11:06:11,419 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-05-07 11:06:13,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:06:15,496 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-05-07 11:06:21,525 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-05-07 11:06:23,532 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-05-07 11:06:26,345 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-05-07 11:06:28,357 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-05-07 11:06:30,370 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-05-07 11:06:32,382 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-05-07 11:06:34,397 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-05-07 11:06:36,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-05-07 11:06:38,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:06:40,863 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-05-07 11:06:42,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:06:48,276 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-05-07 11:06:50,286 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-05-07 11:06:53,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:07:00,937 WARN L293 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 94 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 11:07:02,941 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-05-07 11:07:04,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-05-07 11:07:07,741 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-05-07 11:07:09,821 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-05-07 11:07:11,827 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-05-07 11:07:15,520 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-05-07 11:07:22,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:07:24,680 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-05-07 11:07:26,684 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-05-07 11:07:28,695 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-05-07 11:07:30,890 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-05-07 11:07:32,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:07:34,940 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-05-07 11:07:37,092 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-05-07 11:07:46,570 WARN L293 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 182 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 11:07:58,027 WARN L293 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 133 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 11:08:00,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:02,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:03,935 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-05-07 11:08:05,987 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-05-07 11:08:08,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-05-07 11:08:10,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-05-07 11:08:12,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:15,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:17,555 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-05-07 11:08:19,578 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-05-07 11:08:22,090 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-05-07 11:08:26,086 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-05-07 11:08:27,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:30,535 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-05-07 11:08:32,625 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-05-07 11:08:34,026 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-05-07 11:08:35,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:37,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:08:39,078 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-05-07 11:08:44,987 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-05-07 11:08:54,543 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-05-07 11:08:56,825 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-05-07 11:08:59,217 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-05-07 11:09:02,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:09:04,132 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-05-07 11:09:06,234 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-05-07 11:09:09,119 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-05-07 11:09:11,132 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-05-07 11:09:18,663 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-05-07 11:09:22,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:09:24,207 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-05-07 11:09:26,213 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-05-07 11:09:29,190 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-05-07 11:09:36,640 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-05-07 11:09:38,654 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-05-07 11:09:42,617 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-05-07 11:09:45,055 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-05-07 11:09:47,788 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-05-07 11:09:49,806 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-05-07 11:09:51,816 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-05-07 11:09:53,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:09:55,846 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-05-07 11:09:57,853 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-05-07 11:09:59,857 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-05-07 11:10:01,986 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-05-07 11:10:04,001 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-05-07 11:10:06,011 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-05-07 11:10:08,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-05-07 11:10:10,738 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-05-07 11:10:15,282 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-05-07 11:10:17,292 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-05-07 11:10:19,902 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-05-07 11:10:29,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-05-07 11:11:18,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:11:19,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:11:31,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:11:46,684 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-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-07 11:11:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-05-07 11:11:52,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-07 11:11:52,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2024-05-07 11:11:52,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 11:11:52,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:11:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 97046098, now seen corresponding path program 7 times [2024-05-07 11:11:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:11:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56086217] [2024-05-07 11:11:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:11:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:11:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:11:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-05-07 11:11:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:11:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56086217] [2024-05-07 11:11:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56086217] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:11:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789195177] [2024-05-07 11:11:52,778 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-07 11:11:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:11:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:11:52,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 11:11:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-07 11:11:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:11:52,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-07 11:11:52,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:11:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 121 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-07 11:11:53,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 11:11:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 84 proven. 13 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-05-07 11:11:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789195177] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 11:11:53,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 11:11:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 11] total 22 [2024-05-07 11:11:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361269216] [2024-05-07 11:11:53,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 11:11:53,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-07 11:11:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:11:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-07 11:11:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-05-07 11:11:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:11:53,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:11:53,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 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-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2024-05-07 11:11:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:12:57,198 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-05-07 11:13:27,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-07 11:14:19,539 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_~n2~0 0)) (.cse10 (= c_~n2~0 1)) (.cse8 (= c_~n1~0 0)) (.cse13 (mod (+ (* c_~m~0 4294967293) c_~p1~0) 4294967296))) (let ((.cse1 (<= c_~n1~0 0)) (.cse5 (= 1 c_thread1Thread1of1ForFork3_~cond~0)) (.cse6 (= (+ c_~n2~0 1) c_~n1~0)) (.cse9 (* 4294967295 c_~p1~0)) (.cse11 (and .cse10 .cse8 (= .cse13 (mod (+ (* c_~m~0 4294967294) c_~p2~0) 4294967296)))) (.cse12 (and .cse7 (let ((.cse15 (* c_~m~0 4294967295))) (= (mod (+ .cse15 c_~p1~0) 4294967296) (mod (+ .cse15 c_~p2~0) 4294967296))) .cse8)) (.cse4 (= 0 c_thread1Thread1of1ForFork3_~cond~0)) (.cse2 (= c_thread2Thread1of1ForFork1_~cond~1 1)) (.cse0 (= c_thread4Thread1of1ForFork0_~cond~3 1)) (.cse3 (<= 1 c_~n1~0))) (and (or (and .cse0 (<= 1 c_~n2~0)) (and (<= c_~n2~0 0) (= c_thread4Thread1of1ForFork0_~cond~3 0))) (or (and (= c_thread2Thread1of1ForFork1_~cond~1 0) .cse1) (and .cse2 .cse3)) (or (and .cse1 .cse4) (and .cse5 .cse3)) (or (and (= (mod (+ (* 4294967295 c_~p2~0) c_~m~0 c_~p1~0) 4294967296) 0) .cse6 .cse3) (and .cse7 .cse8 (= (mod (+ .cse9 c_~p2~0) 4294967296) 0)) (and (= (mod (+ .cse9 c_~m~0 c_~p2~0) 4294967296) 0) .cse10 .cse8)) (or .cse11 .cse12 (and (= .cse13 (mod (+ (* 4294967292 c_~m~0) c_~p2~0) 4294967296)) .cse6 (<= 0 c_~n2~0))) (or (and .cse5 (let ((.cse14 (* (mod (* c_~m~0 1073741823) 1073741824) 4))) (or (and (= (mod (+ .cse9 (* c_~m~0 3) c_~p2~0 .cse14) 4294967296) 0) .cse6 .cse3) (and .cse10 .cse8 (= (mod (+ (* c_~m~0 5) .cse9 c_~p2~0 .cse14) 4294967296) 0))))) (and (or .cse11 .cse12) .cse4)) (or (and .cse2 .cse0 .cse3) (< c_~n2~0 2))))) is different from true Received shutdown request... [2024-05-07 11:14:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-07 11:14:54,113 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 11:14:54,113 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 11:14:54,113 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 11:14:54,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2024-05-07 11:14:54,269 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. [2024-05-07 11:14:54,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 11:14:54,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-07 11:14:54,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 11:14:54,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 11:14:54,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-07 11:14:54,274 INFO L448 BasicCegarLoop]: Path program histogram: [23, 7, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-05-07 11:14:54,276 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 11:14:54,276 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 11:14:54,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 11:14:54 BasicIcfg [2024-05-07 11:14:54,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 11:14:54,278 INFO L158 Benchmark]: Toolchain (without parser) took 841346.30ms. Allocated memory was 198.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 131.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-05-07 11:14:54,278 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 11:14:54,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.63ms. Allocated memory was 198.2MB in the beginning and 250.6MB in the end (delta: 52.4MB). Free memory was 131.5MB in the beginning and 217.4MB in the end (delta: -85.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-07 11:14:54,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 250.6MB. Free memory was 217.4MB in the beginning and 215.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 11:14:54,279 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 250.6MB. Free memory was 215.3MB in the beginning and 213.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 11:14:54,279 INFO L158 Benchmark]: RCFGBuilder took 415.84ms. Allocated memory is still 250.6MB. Free memory was 213.7MB in the beginning and 191.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-05-07 11:14:54,280 INFO L158 Benchmark]: TraceAbstraction took 840558.50ms. Allocated memory was 250.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 190.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-05-07 11:14:54,281 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.63ms. Allocated memory was 198.2MB in the beginning and 250.6MB in the end (delta: 52.4MB). Free memory was 131.5MB in the beginning and 217.4MB in the end (delta: -85.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 250.6MB. Free memory was 217.4MB in the beginning and 215.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 250.6MB. Free memory was 215.3MB in the beginning and 213.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 415.84ms. Allocated memory is still 250.6MB. Free memory was 213.7MB in the beginning and 191.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 840558.50ms. Allocated memory was 250.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 190.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 452949, independent: 427861, independent conditional: 399253, independent unconditional: 28608, dependent: 24157, dependent conditional: 23682, dependent unconditional: 475, unknown: 931, unknown conditional: 931, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 437096, independent: 427861, independent conditional: 399253, independent unconditional: 28608, dependent: 8304, dependent conditional: 7829, dependent unconditional: 475, unknown: 931, unknown conditional: 931, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 437096, independent: 427861, independent conditional: 399253, independent unconditional: 28608, dependent: 8304, dependent conditional: 7829, dependent unconditional: 475, unknown: 931, unknown conditional: 931, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 437096, independent: 427861, independent conditional: 399253, independent unconditional: 28608, dependent: 8304, dependent conditional: 7829, dependent unconditional: 475, unknown: 931, unknown conditional: 931, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 170279, independent unconditional: 257582, dependent: 27303, dependent conditional: 17675, dependent unconditional: 9628, unknown: 2253, unknown conditional: 1697, unknown unconditional: 556] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 141295, independent unconditional: 286566, dependent: 27303, dependent conditional: 9750, dependent unconditional: 17553, unknown: 2253, unknown conditional: 1306, unknown unconditional: 947] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 141295, independent unconditional: 286566, dependent: 27303, dependent conditional: 9750, dependent unconditional: 17553, unknown: 2253, unknown conditional: 1306, unknown unconditional: 947] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1078, independent: 1001, independent conditional: 3, independent unconditional: 998, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1078, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3783, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1859, dependent conditional: 1503, dependent unconditional: 356, unknown: 1924, unknown conditional: 906, unknown unconditional: 1017] , Protected Queries: 0 ], Cache Queries: [ total: 457417, independent: 426860, independent conditional: 141292, independent unconditional: 285568, dependent: 27228, dependent conditional: 9686, dependent unconditional: 17542, unknown: 3329, unknown conditional: 1373, unknown unconditional: 1956] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1001, Positive conditional cache size: 3, Positive unconditional cache size: 998, Negative cache size: 75, Negative conditional cache size: 64, Negative unconditional cache size: 11, Unknown cache size: 2, Unknown conditional cache size: 1, Unknown unconditional cache size: 1, Eliminated conditions: 37300, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 170279, independent unconditional: 257582, dependent: 27303, dependent conditional: 17675, dependent unconditional: 9628, unknown: 2253, unknown conditional: 1697, unknown unconditional: 556] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 141295, independent unconditional: 286566, dependent: 27303, dependent conditional: 9750, dependent unconditional: 17553, unknown: 2253, unknown conditional: 1306, unknown unconditional: 947] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 457417, independent: 427861, independent conditional: 141295, independent unconditional: 286566, dependent: 27303, dependent conditional: 9750, dependent unconditional: 17553, unknown: 2253, unknown conditional: 1306, unknown unconditional: 947] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1078, independent: 1001, independent conditional: 3, independent unconditional: 998, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1078, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3783, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1859, dependent conditional: 1503, dependent unconditional: 356, unknown: 1924, unknown conditional: 906, unknown unconditional: 1017] , Protected Queries: 0 ], Cache Queries: [ total: 457417, independent: 426860, independent conditional: 141292, independent unconditional: 285568, dependent: 27228, dependent conditional: 9686, dependent unconditional: 17542, unknown: 3329, unknown conditional: 1373, unknown unconditional: 1956] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1001, Positive conditional cache size: 3, Positive unconditional cache size: 998, Negative cache size: 75, Negative conditional cache size: 64, Negative unconditional cache size: 11, Unknown cache size: 2, Unknown conditional cache size: 1, Unknown unconditional cache size: 1, Eliminated conditions: 37300 ], Independence queries for same thread: 15853 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 840.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 23, EmptinessCheckTime: 721.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 600, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 116.2s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2531 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 3647 ConstructedInterpolants, 0 QuantifiedInterpolants, 25538 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 9983/14946 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 117.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 60, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 33 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown