/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m [2023-09-04 23:09:14,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-04 23:09:15,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-04 23:09:15,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-04 23:09:15,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-04 23:09:15,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-04 23:09:15,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-04 23:09:15,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-04 23:09:15,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-04 23:09:15,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-04 23:09:15,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-04 23:09:15,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-04 23:09:15,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-04 23:09:15,070 INFO L153 SettingsManager]: * Use SBE=true [2023-09-04 23:09:15,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-04 23:09:15,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-04 23:09:15,071 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-04 23:09:15,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-04 23:09:15,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-04 23:09:15,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-04 23:09:15,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-04 23:09:15,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-04 23:09:15,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-04 23:09:15,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-04 23:09:15,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-04 23:09:15,075 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-04 23:09:15,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-04 23:09:15,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-04 23:09:15,076 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-04 23:09:15,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-04 23:09:15,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 23:09:15,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-04 23:09:15,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-04 23:09:15,077 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-04 23:09:15,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-04 23:09:15,078 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-04 23:09:15,078 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/UAutomizer-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 [2023-09-04 23:09:15,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-04 23:09:15,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-04 23:09:15,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-04 23:09:15,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-04 23:09:15,275 INFO L274 PluginConnector]: CDTParser initialized [2023-09-04 23:09:15,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-09-04 23:09:16,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-04 23:09:16,504 INFO L384 CDTParser]: Found 1 translation units. [2023-09-04 23:09:16,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-09-04 23:09:16,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a547ed0/3d8e867711724087a53369a977a19579/FLAG41776db8b [2023-09-04 23:09:16,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a547ed0/3d8e867711724087a53369a977a19579 [2023-09-04 23:09:16,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-04 23:09:16,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-04 23:09:16,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-04 23:09:16,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-04 23:09:16,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-04 23:09:16,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c5d258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16, skipping insertion in model container [2023-09-04 23:09:16,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-09-04 23:09:16,643 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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2023-09-04 23:09:16,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 23:09:16,735 INFO L201 MainTranslator]: Completed pre-run [2023-09-04 23:09:16,744 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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2023-09-04 23:09:16,754 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-09-04 23:09:16,755 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-09-04 23:09:16,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 23:09:16,825 INFO L206 MainTranslator]: Completed translation [2023-09-04 23:09:16,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16 WrapperNode [2023-09-04 23:09:16,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-04 23:09:16,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-04 23:09:16,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-04 23:09:16,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-04 23:09:16,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,852 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2023-09-04 23:09:16,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-04 23:09:16,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-04 23:09:16,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-04 23:09:16,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-04 23:09:16,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-04 23:09:16,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-04 23:09:16,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-04 23:09:16,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-04 23:09:16,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (1/1) ... [2023-09-04 23:09:16,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 23:09:16,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:16,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-04 23:09:16,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-04 23:09:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-04 23:09:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2023-09-04 23:09:17,013 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2023-09-04 23:09:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-04 23:09:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-04 23:09:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-04 23:09:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-04 23:09:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-04 23:09:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-04 23:09:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-04 23:09:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-04 23:09:17,016 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-04 23:09:17,141 INFO L236 CfgBuilder]: Building ICFG [2023-09-04 23:09:17,142 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-04 23:09:17,356 INFO L277 CfgBuilder]: Performing block encoding [2023-09-04 23:09:17,361 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-04 23:09:17,361 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-04 23:09:17,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:09:17 BoogieIcfgContainer [2023-09-04 23:09:17,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-04 23:09:17,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-04 23:09:17,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-04 23:09:17,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-04 23:09:17,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:09:16" (1/3) ... [2023-09-04 23:09:17,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d4c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:09:17, skipping insertion in model container [2023-09-04 23:09:17,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:09:16" (2/3) ... [2023-09-04 23:09:17,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d4c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:09:17, skipping insertion in model container [2023-09-04 23:09:17,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:09:17" (3/3) ... [2023-09-04 23:09:17,368 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-09-04 23:09:17,373 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-04 23:09:17,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-04 23:09:17,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-04 23:09:17,379 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-04 23:09:17,415 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-04 23:09:17,441 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 23:09:17,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-04 23:09:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:17,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-04 23:09:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-04 23:09:17,470 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-04 23:09:17,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-04 23:09:17,479 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=LoopsAndPotentialCycles, 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;@3c54ff5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 23:09:17,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:09:17,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:09:17,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:09:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1191049811, now seen corresponding path program 1 times [2023-09-04 23:09:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:09:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977575722] [2023-09-04 23:09:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:09:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-04 23:09:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:09:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977575722] [2023-09-04 23:09:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977575722] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 23:09:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 23:09:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-04 23:09:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426750297] [2023-09-04 23:09:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 23:09:18,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-04 23:09:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:09:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-04 23:09:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-04 23:09:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:09:18,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:09:18,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2023-09-04 23:09:18,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:09:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-04 23:09:18,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-04 23:09:18,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:09:18,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:09:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 392256231, now seen corresponding path program 1 times [2023-09-04 23:09:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:09:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765715053] [2023-09-04 23:09:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:09:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-04 23:09:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:09:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765715053] [2023-09-04 23:09:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765715053] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:09:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164854373] [2023-09-04 23:09:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:18,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:18,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:09:18,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-04 23:09:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:19,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-04 23:09:19,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:09:19,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:20,059 INFO L351 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 22 treesize of output 10 [2023-09-04 23:09:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-04 23:09:20,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 23:09:20,533 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-09-04 23:09:20,533 INFO L351 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 71 treesize of output 55 [2023-09-04 23:09:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-04 23:09:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164854373] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 23:09:20,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 23:09:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 41 [2023-09-04 23:09:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157676285] [2023-09-04 23:09:20,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 23:09:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-09-04 23:09:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:09:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-09-04 23:09:20,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2023-09-04 23:09:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:09:20,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:09:20,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.682926829268292) internal successors, (233), 41 states have internal predecessors, (233), 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) [2023-09-04 23:09:20,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-04 23:09:20,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:09:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 23:09:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-04 23:09:21,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-04 23:09:21,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-09-04 23:09:21,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:09:21,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:09:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1556644782, now seen corresponding path program 1 times [2023-09-04 23:09:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:09:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538791364] [2023-09-04 23:09:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:09:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 23:09:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:09:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538791364] [2023-09-04 23:09:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538791364] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:09:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303458781] [2023-09-04 23:09:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:22,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:09:22,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-04 23:09:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:22,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 56 conjunts are in the unsatisfiable core [2023-09-04 23:09:22,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:09:22,964 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-04 23:09:22,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-09-04 23:09:23,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:09:23,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-04 23:09:23,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:23,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:23,694 INFO L351 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 15 treesize of output 7 [2023-09-04 23:09:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 23:09:23,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-04 23:09:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303458781] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 23:09:23,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-04 23:09:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [27] total 47 [2023-09-04 23:09:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942114923] [2023-09-04 23:09:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 23:09:23,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-09-04 23:09:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:09:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-09-04 23:09:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2023-09-04 23:09:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:09:23,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:09:23,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 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) [2023-09-04 23:09:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 23:09:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-09-04 23:09:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:09:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 23:09:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-04 23:09:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-04 23:09:25,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-04 23:09:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:25,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:09:25,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:09:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2088037513, now seen corresponding path program 2 times [2023-09-04 23:09:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:09:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612039602] [2023-09-04 23:09:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:09:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 169 proven. 41 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-09-04 23:09:26,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:09:26,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612039602] [2023-09-04 23:09:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612039602] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:09:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953309440] [2023-09-04 23:09:26,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-04 23:09:26,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:26,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:26,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:09:26,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-04 23:09:26,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-04 23:09:26,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-04 23:09:26,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 87 conjunts are in the unsatisfiable core [2023-09-04 23:09:26,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:09:26,214 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-04 23:09:26,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-09-04 23:09:26,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:09:26,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-04 23:09:26,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:26,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:27,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:27,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:27,570 INFO L351 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 15 treesize of output 7 [2023-09-04 23:09:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 105 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 23:09:27,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 23:09:28,924 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_218) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 4))) is different from false [2023-09-04 23:09:28,945 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 23:09:28,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-09-04 23:09:28,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 23:09:28,951 INFO L351 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 33 treesize of output 36 [2023-09-04 23:09:28,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2023-09-04 23:09:29,123 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-09-04 23:09:29,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-09-04 23:09:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 105 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 23:09:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953309440] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 23:09:29,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 23:09:29,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 34, 34] total 77 [2023-09-04 23:09:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209437879] [2023-09-04 23:09:29,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 23:09:29,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-09-04 23:09:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:09:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-09-04 23:09:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=5003, Unknown=1, NotChecked=148, Total=5852 [2023-09-04 23:09:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:09:29,156 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:09:29,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.974025974025974) internal successors, (460), 77 states have internal predecessors, (460), 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) [2023-09-04 23:09:29,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 23:09:29,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-09-04 23:09:29,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-09-04 23:09:29,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:09:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-04 23:09:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-04 23:09:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-04 23:09:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-09-04 23:09:35,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-04 23:09:35,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:35,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:09:35,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:09:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash -204617682, now seen corresponding path program 2 times [2023-09-04 23:09:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:09:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110122209] [2023-09-04 23:09:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:09:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:09:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:09:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 152 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-09-04 23:09:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:09:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110122209] [2023-09-04 23:09:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110122209] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:09:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522803154] [2023-09-04 23:09:36,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-04 23:09:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:09:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:09:36,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:09:36,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-04 23:09:36,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-04 23:09:36,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-04 23:09:36,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-04 23:09:36,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:09:36,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:09:37,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:37,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2023-09-04 23:09:37,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:09:37,991 INFO L351 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 15 treesize of output 7 [2023-09-04 23:09:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 178 proven. 10 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-09-04 23:09:37,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 23:09:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 116 proven. 11 refuted. 1 times theorem prover too weak. 182 trivial. 0 not checked. [2023-09-04 23:09:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522803154] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 23:09:43,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 23:09:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 20] total 64 [2023-09-04 23:09:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157440474] [2023-09-04 23:09:43,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 23:09:43,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-09-04 23:09:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:09:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-09-04 23:09:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3627, Unknown=1, NotChecked=0, Total=4032 [2023-09-04 23:09:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:09:43,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:09:43,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.484375) internal successors, (351), 64 states have internal predecessors, (351), 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) [2023-09-04 23:09:43,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-09-04 23:09:43,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-04 23:09:43,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-04 23:09:43,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2023-09-04 23:09:43,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:10:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-04 23:10:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-04 23:10:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-04 23:10:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2023-09-04 23:10:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2023-09-04 23:10:07,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-04 23:10:08,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:10:08,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:10:08,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:10:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1173050308, now seen corresponding path program 1 times [2023-09-04 23:10:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:10:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513639882] [2023-09-04 23:10:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:10:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:10:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:10:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 646 proven. 96 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2023-09-04 23:10:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:10:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513639882] [2023-09-04 23:10:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513639882] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:10:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944893917] [2023-09-04 23:10:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:10:09,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:10:09,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:10:09,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:10:09,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-04 23:10:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:10:09,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 122 conjunts are in the unsatisfiable core [2023-09-04 23:10:09,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:10:10,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:10:10,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:10,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2023-09-04 23:10:11,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:12,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:12,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:12,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:12,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:10:13,082 INFO L351 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 15 treesize of output 7 [2023-09-04 23:10:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 594 proven. 686 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-09-04 23:10:13,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 23:11:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 884 proven. 335 refuted. 1 times theorem prover too weak. 182 trivial. 0 not checked. [2023-09-04 23:11:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944893917] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 23:11:25,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 23:11:25,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 45, 42] total 103 [2023-09-04 23:11:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079249021] [2023-09-04 23:11:25,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 23:11:25,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-09-04 23:11:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 23:11:25,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-09-04 23:11:25,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1052, Invalid=9432, Unknown=22, NotChecked=0, Total=10506 [2023-09-04 23:11:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 23:11:25,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 23:11:25,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 6.320388349514563) internal successors, (651), 103 states have internal predecessors, (651), 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) [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2023-09-04 23:11:25,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 23:11:50,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-04 23:12:17,525 WARN L234 SmtUtils]: Spent 15.04s on a formula simplification. DAG size of input: 96 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-04 23:12:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-04 23:12:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-04 23:12:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-04 23:12:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-09-04 23:12:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-09-04 23:12:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-09-04 23:12:24,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-04 23:12:25,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:12:25,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-09-04 23:12:25,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 23:12:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1358276936, now seen corresponding path program 2 times [2023-09-04 23:12:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 23:12:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140306036] [2023-09-04 23:12:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 23:12:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 23:12:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 23:12:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 1847 proven. 729 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-09-04 23:12:28,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 23:12:28,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140306036] [2023-09-04 23:12:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140306036] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 23:12:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743887010] [2023-09-04 23:12:28,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-04 23:12:28,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:12:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 23:12:28,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 23:12:28,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-04 23:12:28,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-04 23:12:28,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-04 23:12:28,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 223 conjunts are in the unsatisfiable core [2023-09-04 23:12:28,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 23:12:28,942 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-04 23:12:28,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-09-04 23:12:29,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:12:29,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-04 23:12:29,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:29,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:30,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:30,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:31,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:32,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:33,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2023-09-04 23:12:33,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:34,534 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:35,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:36,267 INFO L351 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 15 treesize of output 7 [2023-09-04 23:12:36,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 23:12:37,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:38,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:39,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-04 23:12:39,729 INFO L351 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 15 treesize of output 7 [2023-09-04 23:12:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 1444 proven. 1492 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-04 23:12:40,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 23:13:16,977 INFO L351 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 32 treesize of output 28 Received shutdown request... [2023-09-04 23:13:50,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-04 23:13:50,785 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 23:13:50,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-09-04 23:13:50,817 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 23:13:50,817 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 23:13:50,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 23:13:50,980 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 468 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 165 known predicates. [2023-09-04 23:13:50,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-04 23:13:50,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-09-04 23:13:50,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-09-04 23:13:50,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-04 23:13:50,987 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1] [2023-09-04 23:13:50,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-04 23:13:50,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-04 23:13:51,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:13:51 BasicIcfg [2023-09-04 23:13:51,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-04 23:13:51,013 INFO L158 Benchmark]: Toolchain (without parser) took 274490.70ms. Allocated memory was 202.4MB in the beginning and 632.3MB in the end (delta: 429.9MB). Free memory was 138.0MB in the beginning and 257.7MB in the end (delta: -119.7MB). Peak memory consumption was 311.2MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,013 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-04 23:13:51,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.51ms. Allocated memory was 202.4MB in the beginning and 273.7MB in the end (delta: 71.3MB). Free memory was 138.0MB in the beginning and 236.2MB in the end (delta: -98.2MB). Peak memory consumption was 20.8MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.77ms. Allocated memory is still 273.7MB. Free memory was 236.2MB in the beginning and 233.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,014 INFO L158 Benchmark]: Boogie Preprocessor took 16.07ms. Allocated memory is still 273.7MB. Free memory was 233.6MB in the beginning and 232.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,014 INFO L158 Benchmark]: RCFGBuilder took 493.99ms. Allocated memory is still 273.7MB. Free memory was 232.0MB in the beginning and 216.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,014 INFO L158 Benchmark]: TraceAbstraction took 273648.79ms. Allocated memory was 273.7MB in the beginning and 632.3MB in the end (delta: 358.6MB). Free memory was 215.2MB in the beginning and 257.7MB in the end (delta: -42.5MB). Peak memory consumption was 316.7MB. Max. memory is 7.0GB. [2023-09-04 23:13:51,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 302.51ms. Allocated memory was 202.4MB in the beginning and 273.7MB in the end (delta: 71.3MB). Free memory was 138.0MB in the beginning and 236.2MB in the end (delta: -98.2MB). Peak memory consumption was 20.8MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 25.77ms. Allocated memory is still 273.7MB. Free memory was 236.2MB in the beginning and 233.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 16.07ms. Allocated memory is still 273.7MB. Free memory was 233.6MB in the beginning and 232.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 493.99ms. Allocated memory is still 273.7MB. Free memory was 232.0MB in the beginning and 216.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 7.0GB. * TraceAbstraction took 273648.79ms. Allocated memory was 273.7MB in the beginning and 632.3MB in the end (delta: 358.6MB). Free memory was 215.2MB in the beginning and 257.7MB in the end (delta: -42.5MB). Peak memory consumption was 316.7MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 233]: Unsoundness Warning unspecified type, defaulting to int C: short [233] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3636, independent: 3420, independent conditional: 3420, independent unconditional: 0, dependent: 216, dependent conditional: 216, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3435, independent: 3420, independent conditional: 3420, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3435, independent: 3420, independent conditional: 3420, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3512, independent: 3420, independent conditional: 0, independent unconditional: 3420, dependent: 92, dependent conditional: 77, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3512, independent: 3420, independent conditional: 0, independent unconditional: 3420, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3512, independent: 3420, independent conditional: 0, independent unconditional: 3420, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3435, independent: 3420, independent conditional: 0, independent unconditional: 3420, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3435, independent: 3419, independent conditional: 0, independent unconditional: 3419, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3512, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 3435, unknown conditional: 0, unknown unconditional: 3435] , Statistics on independence cache: Total cache size (in pairs): 3435, Positive cache size: 3420, Positive conditional cache size: 0, Positive unconditional cache size: 3420, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 6, Independence queries for same thread: 201 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 8 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 468 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 165 known predicates. - TimeoutResultAtElement [Line: 748]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 468 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 165 known predicates. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 468 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 165 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 171 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 273.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 93.0s, 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: 556, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 92.6s InterpolantComputationTime, 2076 NumberOfCodeBlocks, 2076 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2946 ConstructedInterpolants, 272 QuantifiedInterpolants, 33673 SizeOfPredicates, 171 NumberOfNonLiveVariables, 2299 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 4567/6153 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown