/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 SLEEP_SET --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/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 21:24:11,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 21:24:11,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 21:24:11,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 21:24:11,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 21:24:11,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 21:24:11,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 21:24:11,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 21:24:11,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 21:24:11,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 21:24:11,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 21:24:11,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 21:24:11,138 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 21:24:11,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 21:24:11,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 21:24:11,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 21:24:11,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 21:24:11,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 21:24:11,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 21:24:11,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 21:24:11,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 21:24:11,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 21:24:11,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 21:24:11,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 21:24:11,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 21:24:11,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 21:24:11,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 21:24:11,145 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 21:24:11,145 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 -> SLEEP_SET 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-06 21:24:11,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 21:24:11,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 21:24:11,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 21:24:11,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 21:24:11,339 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 21:24:11,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2024-05-06 21:24:12,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 21:24:12,652 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 21:24:12,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2024-05-06 21:24:12,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2c360054e/59c26ea4645f40a78388799c0328980b/FLAGd92b48843 [2024-05-06 21:24:12,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2c360054e/59c26ea4645f40a78388799c0328980b [2024-05-06 21:24:12,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 21:24:12,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 21:24:12,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 21:24:12,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 21:24:12,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 21:24:12,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 09:24:12" (1/1) ... [2024-05-06 21:24:12,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5babc673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:12, skipping insertion in model container [2024-05-06 21:24:12,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 09:24:12" (1/1) ... [2024-05-06 21:24:12,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 21:24:12,833 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2024-05-06 21:24:12,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 21:24:12,950 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 21:24:12,959 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2024-05-06 21:24:12,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 21:24:13,006 INFO L206 MainTranslator]: Completed translation [2024-05-06 21:24:13,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13 WrapperNode [2024-05-06 21:24:13,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 21:24:13,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 21:24:13,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 21:24:13,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 21:24:13,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,042 INFO L138 Inliner]: procedures = 166, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2024-05-06 21:24:13,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 21:24:13,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 21:24:13,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 21:24:13,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 21:24:13,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 21:24:13,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 21:24:13,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 21:24:13,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 21:24:13,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (1/1) ... [2024-05-06 21:24:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 21:24:13,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:24:13,099 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-06 21:24:13,116 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-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-05-06 21:24:13,151 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-05-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 21:24:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2024-05-06 21:24:13,152 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2024-05-06 21:24:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-06 21:24:13,152 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-06 21:24:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 21:24:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 21:24:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-06 21:24:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 21:24:13,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 21:24:13,153 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 21:24:13,248 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 21:24:13,250 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 21:24:13,532 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 21:24:13,580 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 21:24:13,581 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 21:24:13,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 09:24:13 BoogieIcfgContainer [2024-05-06 21:24:13,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 21:24:13,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 21:24:13,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 21:24:13,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 21:24:13,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 09:24:12" (1/3) ... [2024-05-06 21:24:13,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe39b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 09:24:13, skipping insertion in model container [2024-05-06 21:24:13,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:24:13" (2/3) ... [2024-05-06 21:24:13,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe39b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 09:24:13, skipping insertion in model container [2024-05-06 21:24:13,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 09:24:13" (3/3) ... [2024-05-06 21:24:13,595 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2024-05-06 21:24:13,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 21:24:13,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 21:24:13,610 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-06 21:24:13,610 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 21:24:13,684 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 21:24:13,726 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 21:24:13,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 21:24:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:24:13,729 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-06 21:24:13,730 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-06 21:24:13,763 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 21:24:13,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:13,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 21:24:13,783 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;@5a2a41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 21:24:13,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-06 21:24:13,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:24:13,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1035564757, now seen corresponding path program 1 times [2024-05-06 21:24:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:24:13,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831048321] [2024-05-06 21:24:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:14,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:24:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831048321] [2024-05-06 21:24:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831048321] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:24:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:24:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:24:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17933484] [2024-05-06 21:24:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:24:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:24:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:24:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:24:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:24:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:14,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:24:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06 21:24:14,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:14,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 21:24:14,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:24:14,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 936128538, now seen corresponding path program 1 times [2024-05-06 21:24:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:24:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545126094] [2024-05-06 21:24:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:24:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545126094] [2024-05-06 21:24:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545126094] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:24:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:24:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:24:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485847475] [2024-05-06 21:24:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:24:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:24:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:24:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:24:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:24:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:14,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:24:14,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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-06 21:24:14,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:14,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 21:24:15,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:24:15,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1743554170, now seen corresponding path program 1 times [2024-05-06 21:24:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:24:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729802153] [2024-05-06 21:24:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:24:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729802153] [2024-05-06 21:24:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729802153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:24:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:24:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:24:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607513951] [2024-05-06 21:24:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:24:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:24:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:24:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:24:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:24:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:15,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:24:15,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 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-06 21:24:15,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:15,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:15,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:15,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2024-05-06 21:24:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2125331579, now seen corresponding path program 1 times [2024-05-06 21:24:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:16,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:16,712 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:16,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 960 [2024-05-06 21:24:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1389023200, now seen corresponding path program 1 times [2024-05-06 21:24:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 21:24:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 21:24:17,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-05-06 21:24:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2125331579, now seen corresponding path program 2 times [2024-05-06 21:24:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:17,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:18,035 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2024-05-06 21:24:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 980762243, now seen corresponding path program 1 times [2024-05-06 21:24:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:18,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:18,416 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:18,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 484 [2024-05-06 21:24:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 534911177, now seen corresponding path program 1 times [2024-05-06 21:24:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:18,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:19,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-05-06 21:24:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1660333881, now seen corresponding path program 1 times [2024-05-06 21:24:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:19,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:19,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-06 21:24:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 206084102, now seen corresponding path program 1 times [2024-05-06 21:24:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:19,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-06 21:24:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -147804604, now seen corresponding path program 1 times [2024-05-06 21:24:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:20,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:20,457 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:20,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2024-05-06 21:24:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1881732566, now seen corresponding path program 1 times [2024-05-06 21:24:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:20,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:21,101 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:21,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-05-06 21:24:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 251786600, now seen corresponding path program 1 times [2024-05-06 21:24:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:21,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:21,612 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 960 [2024-05-06 21:24:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -977248888, now seen corresponding path program 1 times [2024-05-06 21:24:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:21,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:22,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-05-06 21:24:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2081764794, now seen corresponding path program 1 times [2024-05-06 21:24:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:22,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:22,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-06 21:24:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1637806739, now seen corresponding path program 1 times [2024-05-06 21:24:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:23,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:23,469 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:23,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 568 treesize of output 520 [2024-05-06 21:24:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 419379819, now seen corresponding path program 1 times [2024-05-06 21:24:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:23,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:23,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-06 21:24:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -687282454, now seen corresponding path program 1 times [2024-05-06 21:24:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:24,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:24,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-05-06 21:24:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -183811544, now seen corresponding path program 1 times [2024-05-06 21:24:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:24,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:24,997 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:24,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 484 [2024-05-06 21:24:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1348356402, now seen corresponding path program 1 times [2024-05-06 21:24:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:25,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:25,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-06 21:24:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1117361932, now seen corresponding path program 1 times [2024-05-06 21:24:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:25,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:26,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2024-05-06 21:24:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1230133397, now seen corresponding path program 1 times [2024-05-06 21:24:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:26,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:26,590 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:26,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2024-05-06 21:24:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -568074775, now seen corresponding path program 1 times [2024-05-06 21:24:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:26,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:27,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2024-05-06 21:24:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 836734893, now seen corresponding path program 1 times [2024-05-06 21:24:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:27,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:27,431 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:27,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2024-05-06 21:24:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1280076305, now seen corresponding path program 1 times [2024-05-06 21:24:27,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:27,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 21:24:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 21:24:27,802 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-06 21:24:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 466 [2024-05-06 21:24:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -52025361, now seen corresponding path program 1 times [2024-05-06 21:24:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 21:24:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-06 21:24:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2024-05-06 21:24:47,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:24:47,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2045554418, now seen corresponding path program 1 times [2024-05-06 21:24:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:24:47,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883728959] [2024-05-06 21:24:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:24:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883728959] [2024-05-06 21:24:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883728959] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:24:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:24:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 21:24:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796019684] [2024-05-06 21:24:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:24:47,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 21:24:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:24:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 21:24:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-06 21:24:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:47,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:24:47,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-06 21:24:47,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:47,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:47,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:47,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 21:24:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:24:55,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-06 21:24:55,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:24:55,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:24:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1787040898, now seen corresponding path program 1 times [2024-05-06 21:24:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:24:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920827234] [2024-05-06 21:24:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:24:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:24:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:24:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:24:55,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:24:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920827234] [2024-05-06 21:24:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920827234] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:24:55,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:24:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:24:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107183728] [2024-05-06 21:24:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:24:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:24:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:24:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:24:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:24:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:24:55,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:24:55,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-06 21:24:55,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 21:24:55,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:24:55,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:24:55,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:24:55,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:25:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 21:25:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 21:25:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:25:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:25:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:25:06,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-06 21:25:06,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:25:06,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:25:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1042465715, now seen corresponding path program 1 times [2024-05-06 21:25:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:25:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551860440] [2024-05-06 21:25:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:25:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:25:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:25:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:25:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:25:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551860440] [2024-05-06 21:25:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551860440] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:25:06,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:25:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:25:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286407424] [2024-05-06 21:25:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:25:06,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:25:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:25:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:25:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:25:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:25:06,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:25:06,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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-06 21:25:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 21:25:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 21:25:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 21:25:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:25:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:25:06,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 21:25:17,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-06 21:25:17,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-05-06 21:25:17,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:25:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -227951841, now seen corresponding path program 1 times [2024-05-06 21:25:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:25:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807736202] [2024-05-06 21:25:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:25:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:25:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:25:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:25:17,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:25:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807736202] [2024-05-06 21:25:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807736202] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:25:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:25:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 21:25:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332979692] [2024-05-06 21:25:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:25:17,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 21:25:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:25:17,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 21:25:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-06 21:25:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:25:17,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:25:17,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 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-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-06 21:25:17,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:26:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 21:26:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 21:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 21:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 21:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 21:26:23,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-05-06 21:26:23,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-05-06 21:26:23,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-05-06 21:26:23,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-05-06 21:26:23,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-06 21:26:23,540 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 21:26:23,544 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 21:26:23,544 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 21:26:23,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 09:26:23 BasicIcfg [2024-05-06 21:26:23,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 21:26:23,547 INFO L158 Benchmark]: Toolchain (without parser) took 130870.06ms. Allocated memory was 286.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 216.4MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2024-05-06 21:26:23,547 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 160.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 21:26:23,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.41ms. Allocated memory is still 286.3MB. Free memory was 216.1MB in the beginning and 247.9MB in the end (delta: -31.8MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2024-05-06 21:26:23,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.23ms. Allocated memory is still 286.3MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 21:26:23,548 INFO L158 Benchmark]: Boogie Preprocessor took 22.16ms. Allocated memory is still 286.3MB. Free memory was 245.8MB in the beginning and 244.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 21:26:23,548 INFO L158 Benchmark]: RCFGBuilder took 516.77ms. Allocated memory is still 286.3MB. Free memory was 244.2MB in the beginning and 221.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 21:26:23,548 INFO L158 Benchmark]: TraceAbstraction took 129958.43ms. Allocated memory was 286.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 220.6MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2024-05-06 21:26:23,549 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.09ms. Allocated memory is still 160.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.41ms. Allocated memory is still 286.3MB. Free memory was 216.1MB in the beginning and 247.9MB in the end (delta: -31.8MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.23ms. Allocated memory is still 286.3MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.16ms. Allocated memory is still 286.3MB. Free memory was 245.8MB in the beginning and 244.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 516.77ms. Allocated memory is still 286.3MB. Free memory was 244.2MB in the beginning and 221.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 129958.43ms. Allocated memory was 286.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 220.6MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7354477, independent: 7273865, independent conditional: 7273773, independent unconditional: 92, dependent: 80612, dependent conditional: 80612, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7284179, independent: 7273865, independent conditional: 7273773, independent unconditional: 92, dependent: 10314, dependent conditional: 10314, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7284179, independent: 7273865, independent conditional: 7273773, independent unconditional: 92, dependent: 10314, dependent conditional: 10314, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7284179, independent: 7273865, independent conditional: 7273773, independent unconditional: 92, dependent: 10314, dependent conditional: 10314, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 3529648, independent unconditional: 3744217, dependent: 55895, dependent conditional: 40573, dependent unconditional: 15322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 1640927, independent unconditional: 5632938, dependent: 55895, dependent conditional: 21396, dependent unconditional: 34499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 1640927, independent unconditional: 5632938, dependent: 55895, dependent conditional: 21396, dependent unconditional: 34499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8449, independent: 8346, independent conditional: 1980, independent unconditional: 6366, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8449, independent: 8244, independent conditional: 0, independent unconditional: 8244, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 205, independent: 102, independent conditional: 60, independent unconditional: 42, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, independent: 102, independent conditional: 60, independent unconditional: 42, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 310, independent: 131, independent conditional: 88, independent unconditional: 43, dependent: 179, dependent conditional: 89, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7329760, independent: 7265519, independent conditional: 1638947, independent unconditional: 5626572, dependent: 55792, dependent conditional: 21337, dependent unconditional: 34455, unknown: 8449, unknown conditional: 2039, unknown unconditional: 6410] , Statistics on independence cache: Total cache size (in pairs): 8449, Positive cache size: 8346, Positive conditional cache size: 1980, Positive unconditional cache size: 6366, Negative cache size: 103, Negative conditional cache size: 59, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1907898, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 3529648, independent unconditional: 3744217, dependent: 55895, dependent conditional: 40573, dependent unconditional: 15322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 1640927, independent unconditional: 5632938, dependent: 55895, dependent conditional: 21396, dependent unconditional: 34499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7329760, independent: 7273865, independent conditional: 1640927, independent unconditional: 5632938, dependent: 55895, dependent conditional: 21396, dependent unconditional: 34499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8449, independent: 8346, independent conditional: 1980, independent unconditional: 6366, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8449, independent: 8244, independent conditional: 0, independent unconditional: 8244, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 205, independent: 102, independent conditional: 60, independent unconditional: 42, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, independent: 102, independent conditional: 60, independent unconditional: 42, dependent: 103, dependent conditional: 59, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 310, independent: 131, independent conditional: 88, independent unconditional: 43, dependent: 179, dependent conditional: 89, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7329760, independent: 7265519, independent conditional: 1638947, independent unconditional: 5626572, dependent: 55792, dependent conditional: 21337, dependent unconditional: 34455, unknown: 8449, unknown conditional: 2039, unknown unconditional: 6410] , Statistics on independence cache: Total cache size (in pairs): 8449, Positive cache size: 8346, Positive conditional cache size: 1980, Positive unconditional cache size: 6366, Negative cache size: 103, Negative conditional cache size: 59, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1907898 ], Independence queries for same thread: 70298 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 259 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 129.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 127.5s, 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: 86, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 2371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: 29.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 134, ConditionalCommutativityTraceChecks: 23, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 21:26:23,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 21:26:23,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...