/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 13:02:38,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 13:02:38,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 13:02:38,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 13:02:38,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 13:02:38,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 13:02:38,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 13:02:38,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 13:02:38,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 13:02:38,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 13:02:38,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 13:02:38,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 13:02:38,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 13:02:38,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 13:02:38,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 13:02:38,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 13:02:38,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 13:02:38,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 13:02:38,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 13:02:38,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 13:02:38,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 13:02:38,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 13:02:38,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 13:02:38,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 13:02:38,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 13:02:38,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 13:02:38,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 13:02:38,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 13:02:38,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 13:02:38,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 13:02:38,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 13:02:38,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 13:02:38,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 13:02:38,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 13:02:38,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 13:02:38,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 13:02:38,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 13:02:38,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 13:02:38,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 13:02:38,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 13:02:38,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 13:02:38,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 13:02:38,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 13:02:38,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 13:02:38,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 13:02:38,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 13:02:38,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 13:02:38,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 13:02:38,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 13:02:38,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 13:02:38,883 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 13:02:38,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 13:02:38,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 13:02:38,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 13:02:38,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 13:02:38,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 13:02:38,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 13:02:38,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 13:02:38,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 13:02:38,887 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 13:02:38,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 13:02:38,888 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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 [2022-10-03 13:02:39,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 13:02:39,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 13:02:39,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 13:02:39,101 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 13:02:39,101 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 13:02:39,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl [2022-10-03 13:02:39,103 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl' [2022-10-03 13:02:39,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 13:02:39,144 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 13:02:39,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 13:02:39,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 13:02:39,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 13:02:39,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 13:02:39,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 13:02:39,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 13:02:39,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 13:02:39,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/1) ... [2022-10-03 13:02:39,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 13:02:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:39,234 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) [2022-10-03 13:02:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-10-03 13:02:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-10-03 13:02:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 13:02:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 13:02:39,255 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 [2022-10-03 13:02:39,266 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 13:02:39,410 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 13:02:39,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 13:02:39,749 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 13:02:39,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 13:02:39,762 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-03 13:02:39,765 INFO L202 PluginConnector]: Adding new model 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:02:39 BoogieIcfgContainer [2022-10-03 13:02:39,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 13:02:39,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 13:02:39,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 13:02:39,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 13:02:39,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:02:39" (1/2) ... [2022-10-03 13:02:39,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee64f7a and model type 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:02:39, skipping insertion in model container [2022-10-03 13:02:39,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:02:39" (2/2) ... [2022-10-03 13:02:39,772 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl [2022-10-03 13:02:39,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 13:02:39,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 13:02:39,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 13:02:39,790 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 13:02:39,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-03 13:02:39,911 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:02:39,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:02:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:39,913 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) [2022-10-03 13:02:39,928 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 [2022-10-03 13:02:39,946 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:02:39,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-03 13:02:39,957 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;@19542a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:02:39,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:02:39,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-03 13:02:39,989 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 13:02:39,991 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/3) [2022-10-03 13:02:39,997 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:02:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:02:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:40,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 13:02:40,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-03 13:02:40,008 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:02:40,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == workerErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 13:02:40,009 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;@19542a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:02:40,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:02:40,010 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-03 13:02:40,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 13:02:40,011 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 13:02:40,011 INFO L307 ceAbstractionStarter]: Result for error location workerErr0ASSERT_VIOLATIONASSERT was SAFE (2/3) [2022-10-03 13:02:40,015 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:02:40,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:02:40,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:40,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 13:02:40,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-03 13:02:40,059 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:02:40,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == workerErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 13:02:40,060 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;@19542a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:02:40,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:02:40,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1274172131, now seen corresponding path program 1 times [2022-10-03 13:02:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810979229] [2022-10-03 13:02:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 13:02:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:40,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810979229] [2022-10-03 13:02:40,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810979229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:02:40,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:02:40,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 13:02:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299076170] [2022-10-03 13:02:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:02:40,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 13:02:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:40,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 13:02:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 13:02:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:40,424 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:40,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 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) [2022-10-03 13:02:40,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 13:02:40,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -12734049, now seen corresponding path program 1 times [2022-10-03 13:02:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:40,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327711349] [2022-10-03 13:02:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 13:02:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327711349] [2022-10-03 13:02:40,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327711349] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:02:40,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:02:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 13:02:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651427593] [2022-10-03 13:02:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:02:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 13:02:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 13:02:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-10-03 13:02:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:40,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:40,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 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) [2022-10-03 13:02:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:41,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 13:02:41,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1432779967, now seen corresponding path program 1 times [2022-10-03 13:02:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:41,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995371708] [2022-10-03 13:02:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 496 proven. 43 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-10-03 13:02:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:41,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995371708] [2022-10-03 13:02:41,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995371708] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:02:41,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653837041] [2022-10-03 13:02:41,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:41,986 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) [2022-10-03 13:02:41,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 13:02:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:42,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-03 13:02:42,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:02:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 324 proven. 215 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-10-03 13:02:43,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:02:43,717 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 13:02:43,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-10-03 13:02:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 496 proven. 43 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-10-03 13:02:43,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653837041] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:02:43,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:02:43,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 18 [2022-10-03 13:02:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414783705] [2022-10-03 13:02:43,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:02:43,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-03 13:02:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-03 13:02:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-10-03 13:02:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:43,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:43,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 40.5) internal successors, (729), 19 states have internal predecessors, (729), 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) [2022-10-03 13:02:43,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:43,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:43,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-03 13:02:44,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 13:02:44,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:44,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 750876346, now seen corresponding path program 1 times [2022-10-03 13:02:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782019018] [2022-10-03 13:02:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 509 proven. 43 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-10-03 13:02:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782019018] [2022-10-03 13:02:45,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782019018] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:02:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548621988] [2022-10-03 13:02:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:45,233 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) [2022-10-03 13:02:45,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 13:02:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:45,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-03 13:02:45,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:02:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 294 proven. 258 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-10-03 13:02:47,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:02:47,123 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 13:02:47,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-10-03 13:02:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 509 proven. 43 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-10-03 13:02:47,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548621988] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:02:47,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:02:47,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 18 [2022-10-03 13:02:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517922603] [2022-10-03 13:02:47,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:02:47,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-03 13:02:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-03 13:02:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-10-03 13:02:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:47,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:47,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 38.27777777777778) internal successors, (689), 19 states have internal predecessors, (689), 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) [2022-10-03 13:02:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-10-03 13:02:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-03 13:02:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:47,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 13:02:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:47,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -958481455, now seen corresponding path program 2 times [2022-10-03 13:02:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081396261] [2022-10-03 13:02:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2022-10-03 13:02:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081396261] [2022-10-03 13:02:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081396261] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:02:48,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:02:48,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-10-03 13:02:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294449211] [2022-10-03 13:02:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:02:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-03 13:02:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-03 13:02:48,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2022-10-03 13:02:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:48,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.727272727272727) internal successors, (302), 22 states have internal predecessors, (302), 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) [2022-10-03 13:02:48,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:48,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:48,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-10-03 13:02:48,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:48,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-03 13:02:50,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 13:02:50,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash -46773260, now seen corresponding path program 2 times [2022-10-03 13:02:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:50,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488294521] [2022-10-03 13:02:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 980 proven. 48 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-10-03 13:02:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488294521] [2022-10-03 13:02:51,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488294521] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:02:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235664056] [2022-10-03 13:02:51,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 13:02:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:51,453 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) [2022-10-03 13:02:51,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-03 13:02:51,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 13:02:51,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:02:51,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-03 13:02:51,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:02:52,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:02:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2022-10-03 13:02:52,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 13:02:52,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235664056] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:02:52,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 13:02:52,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [24] total 34 [2022-10-03 13:02:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778384146] [2022-10-03 13:02:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:02:52,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 13:02:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 13:02:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2022-10-03 13:02:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:52,229 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.416666666666668) internal successors, (305), 12 states have internal predecessors, (305), 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) [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-10-03 13:02:52,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:02:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:53,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 13:02:53,828 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 [2022-10-03 13:02:53,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1380305257, now seen corresponding path program 3 times [2022-10-03 13:02:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846647729] [2022-10-03 13:02:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:02:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3849 backedges. 1519 proven. 145 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2022-10-03 13:02:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:02:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846647729] [2022-10-03 13:02:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846647729] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:02:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634592341] [2022-10-03 13:02:55,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 13:02:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:02:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:02:55,385 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) [2022-10-03 13:02:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-03 13:02:55,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-03 13:02:55,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:02:55,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 57 conjunts are in the unsatisfiable core [2022-10-03 13:02:55,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:02:57,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-03 13:02:57,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-10-03 13:02:57,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-10-03 13:02:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3849 backedges. 1984 proven. 0 refuted. 0 times theorem prover too weak. 1865 trivial. 0 not checked. [2022-10-03 13:02:57,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 13:02:57,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634592341] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:02:57,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 13:02:57,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 32 [2022-10-03 13:02:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925393172] [2022-10-03 13:02:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:02:57,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-03 13:02:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:02:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-03 13:02:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-10-03 13:02:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:57,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:02:57,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 42.90909090909091) internal successors, (472), 11 states have internal predecessors, (472), 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) [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:57,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:02:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:02:59,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-03 13:02:59,314 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 [2022-10-03 13:02:59,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:02:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:02:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 538419905, now seen corresponding path program 1 times [2022-10-03 13:02:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:02:59,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97210006] [2022-10-03 13:02:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:02:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:02:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10919 backedges. 5842 proven. 0 refuted. 0 times theorem prover too weak. 5077 trivial. 0 not checked. [2022-10-03 13:03:00,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:00,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97210006] [2022-10-03 13:03:00,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97210006] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:00,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:00,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-03 13:03:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350933357] [2022-10-03 13:03:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:00,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 13:03:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 13:03:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-03 13:03:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:00,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:00,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.333333333333336) internal successors, (472), 12 states have internal predecessors, (472), 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) [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:03:00,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:00,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:00,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-03 13:03:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 13:03:01,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -484792778, now seen corresponding path program 1 times [2022-10-03 13:03:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009441414] [2022-10-03 13:03:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 13:03:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009441414] [2022-10-03 13:03:01,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009441414] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:01,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:01,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 13:03:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091171275] [2022-10-03 13:03:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:01,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 13:03:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 13:03:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-10-03 13:03:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:01,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.571428571428571) internal successors, (159), 21 states have internal predecessors, (159), 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) [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-10-03 13:03:01,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:04,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 13:03:04,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 962506507, now seen corresponding path program 1 times [2022-10-03 13:03:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:04,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049213674] [2022-10-03 13:03:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11988 backedges. 7570 proven. 215 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2022-10-03 13:03:05,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:05,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049213674] [2022-10-03 13:03:05,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049213674] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:05,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064139412] [2022-10-03 13:03:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:05,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:05,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:05,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:03:05,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-03 13:03:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:06,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 3786 conjuncts, 107 conjunts are in the unsatisfiable core [2022-10-03 13:03:06,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:03:09,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-10-03 13:03:10,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:11,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-03 13:03:12,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11988 backedges. 6541 proven. 122 refuted. 0 times theorem prover too weak. 5325 trivial. 0 not checked. [2022-10-03 13:03:12,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:03:12,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1068)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1068)))) is different from false [2022-10-03 13:03:14,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 24 [2022-10-03 13:03:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11988 backedges. 3724 proven. 50 refuted. 0 times theorem prover too weak. 8214 trivial. 0 not checked. [2022-10-03 13:03:15,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064139412] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:03:15,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:03:15,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 35, 28] total 76 [2022-10-03 13:03:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972205413] [2022-10-03 13:03:15,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:03:15,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-10-03 13:03:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-10-03 13:03:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=5038, Unknown=1, NotChecked=146, Total=5700 [2022-10-03 13:03:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:15,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:15,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 22.276315789473685) internal successors, (1693), 76 states have internal predecessors, (1693), 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) [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:15,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-10-03 13:03:21,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-03 13:03:21,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-03 13:03:21,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1327743081, now seen corresponding path program 1 times [2022-10-03 13:03:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:21,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130585627] [2022-10-03 13:03:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2022-10-03 13:03:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130585627] [2022-10-03 13:03:21,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130585627] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:21,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:21,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-03 13:03:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217663925] [2022-10-03 13:03:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-03 13:03:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-03 13:03:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-10-03 13:03:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:21,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:21,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.8) internal successors, (357), 15 states have internal predecessors, (357), 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) [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:21,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:21,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:21,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-10-03 13:03:21,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 13:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:03:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-03 13:03:23,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1926013651, now seen corresponding path program 2 times [2022-10-03 13:03:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:23,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877279290] [2022-10-03 13:03:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 765 proven. 3063 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-10-03 13:03:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:27,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877279290] [2022-10-03 13:03:27,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877279290] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:27,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555766550] [2022-10-03 13:03:27,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 13:03:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:27,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:03:27,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-03 13:03:27,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 13:03:27,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:03:27,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 2394 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-03 13:03:27,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:03:28,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 591 proven. 14 refuted. 0 times theorem prover too weak. 3449 trivial. 0 not checked. [2022-10-03 13:03:29,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:03:29,402 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-03 13:03:29,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 14 [2022-10-03 13:03:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 3449 trivial. 0 not checked. [2022-10-03 13:03:29,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555766550] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:29,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 13:03:29,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [93, 14] total 112 [2022-10-03 13:03:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537840064] [2022-10-03 13:03:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:29,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-03 13:03:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-03 13:03:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=12037, Unknown=0, NotChecked=0, Total=12432 [2022-10-03 13:03:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:29,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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) [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 13:03:29,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:03:29,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-10-03 13:03:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:03:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:31,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-10-03 13:03:31,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:31,390 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2070782290, now seen corresponding path program 3 times [2022-10-03 13:03:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:31,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161417635] [2022-10-03 13:03:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 2712 proven. 1108 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2022-10-03 13:03:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:33,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161417635] [2022-10-03 13:03:33,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161417635] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:33,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879575137] [2022-10-03 13:03:33,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 13:03:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:33,416 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:03:33,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-03 13:03:35,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-10-03 13:03:35,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:03:35,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 274 conjunts are in the unsatisfiable core [2022-10-03 13:03:35,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:03:39,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:40,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:03:41,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:42,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:03:42,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:03:43,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:45,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:47,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-10-03 13:03:48,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:48,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:03:48,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:03:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 2098 proven. 2128 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-10-03 13:03:49,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:03:50,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 24 [2022-10-03 13:03:59,170 INFO L356 Elim1Store]: treesize reduction 25, result has 64.3 percent of original size [2022-10-03 13:03:59,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 45 [2022-10-03 13:04:44,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:04:44,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 132 treesize of output 135 [2022-10-03 13:04:47,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 31 [2022-10-03 13:04:55,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:04:55,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 22 [2022-10-03 13:04:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 1568 proven. 2721 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-10-03 13:04:57,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879575137] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:04:57,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:04:57,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 77, 83] total 212 [2022-10-03 13:04:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588303613] [2022-10-03 13:04:57,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:04:57,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 212 states [2022-10-03 13:04:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:04:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2022-10-03 13:04:57,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=42410, Unknown=22, NotChecked=0, Total=44732 [2022-10-03 13:04:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:57,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:04:57,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 212 states, 212 states have (on average 13.556603773584905) internal successors, (2874), 212 states have internal predecessors, (2874), 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) [2022-10-03 13:04:57,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:57,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:57,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:04:57,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:06:54,082 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 111 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:07:22,828 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 117 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:09:11,328 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 104 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:09:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:09:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:09:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:09:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:09:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:09:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 574 states. [2022-10-03 13:09:38,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-03 13:09:39,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-03 13:09:39,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:09:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:09:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash -90102885, now seen corresponding path program 4 times [2022-10-03 13:09:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:09:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540872768] [2022-10-03 13:09:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:09:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:09:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:09:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4088 backedges. 1918 proven. 839 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2022-10-03 13:09:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:09:40,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540872768] [2022-10-03 13:09:40,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540872768] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:09:40,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825415236] [2022-10-03 13:09:40,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-03 13:09:40,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:09:40,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:09:40,268 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:09:40,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-03 13:09:40,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-03 13:09:40,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:09:40,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 81 conjunts are in the unsatisfiable core [2022-10-03 13:09:40,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:09:43,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:09:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4088 backedges. 678 proven. 43 refuted. 0 times theorem prover too weak. 3367 trivial. 0 not checked. [2022-10-03 13:09:43,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:09:44,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) is different from false [2022-10-03 13:09:47,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:09:47,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 65 [2022-10-03 13:09:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4088 backedges. 666 proven. 43 refuted. 0 times theorem prover too weak. 3367 trivial. 12 not checked. [2022-10-03 13:09:47,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825415236] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:09:47,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:09:47,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 61 [2022-10-03 13:09:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012037720] [2022-10-03 13:09:47,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:09:47,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-10-03 13:09:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:09:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-10-03 13:09:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3240, Unknown=1, NotChecked=116, Total=3660 [2022-10-03 13:09:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:09:47,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:09:47,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 16.83606557377049) internal successors, (1027), 61 states have internal predecessors, (1027), 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) [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 574 states. [2022-10-03 13:09:47,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:09:54,098 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) (.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (<= .cse1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse1 0) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (<= .cse1 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= |c_workerThread1of1ForFork0_read~int_#value#1| (select (select |c_#memory_int| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_workerThread1of1ForFork0_read~int_#value#1| .cse1) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= 0 (select .cse0 |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|)) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (<= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:09:56,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) (.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (<= .cse1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= .cse1 0) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (<= .cse1 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#value#1| .cse1) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= 0 (select .cse0 |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|)) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (<= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:09:56,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (<= (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (= |c_~#pqb~0.offset| 0) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:09:57,762 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:09:58,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:10:04,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))) (let ((.cse1 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) (.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse2 (<= 0 .cse3))) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (<= .cse1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) .cse2 (<= .cse1 0) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (<= .cse1 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= |c_workerThread1of1ForFork0_read~int_#value#1| .cse3) (= |c_workerThread1of1ForFork0_read~int_#value#1| .cse1) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (or (= |c_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0) (and (= |c_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 1) .cse2)) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= 0 (select .cse0 |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|)) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (or (= |c_workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0) (and .cse2 (= |c_workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 1))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (<= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:10:05,585 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 (select (select |c_#memory_int| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:10:06,469 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 (select (select |c_#memory_int| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:10:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 579 states. [2022-10-03 13:10:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-10-03 13:10:27,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-03 13:10:27,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-03 13:10:27,821 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:10:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:10:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -209594882, now seen corresponding path program 5 times [2022-10-03 13:10:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:10:27,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486511732] [2022-10-03 13:10:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:10:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:10:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:10:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 1152 proven. 102 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2022-10-03 13:10:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:10:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486511732] [2022-10-03 13:10:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486511732] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:10:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072621696] [2022-10-03 13:10:28,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-03 13:10:28,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:10:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:10:28,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:10:28,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-03 13:10:29,154 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-03 13:10:29,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:10:29,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 99 conjunts are in the unsatisfiable core [2022-10-03 13:10:29,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:10:30,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:10:31,490 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-10-03 13:10:31,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 42 [2022-10-03 13:10:31,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-03 13:10:32,442 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 13:10:32,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 13:10:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 1834 proven. 239 refuted. 0 times theorem prover too weak. 2557 trivial. 0 not checked. [2022-10-03 13:10:32,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:10:33,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 60 [2022-10-03 13:10:40,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:10:40,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-10-03 13:10:41,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:10:41,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:10:41,277 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-03 13:10:41,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 19 [2022-10-03 13:10:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 2001 proven. 72 refuted. 0 times theorem prover too weak. 2557 trivial. 0 not checked. [2022-10-03 13:10:41,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072621696] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:10:41,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:10:41,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 32] total 88 [2022-10-03 13:10:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258384320] [2022-10-03 13:10:41,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:10:41,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-10-03 13:10:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:10:41,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-10-03 13:10:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=7121, Unknown=1, NotChecked=0, Total=7656 [2022-10-03 13:10:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:41,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:10:41,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 11.897727272727273) internal successors, (1047), 88 states have internal predecessors, (1047), 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) [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:10:41,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 579 states. [2022-10-03 13:10:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2022-10-03 13:10:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:11:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:11:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 581 states. [2022-10-03 13:11:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-10-03 13:11:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2022-10-03 13:11:50,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-03 13:11:51,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-03 13:11:51,133 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:11:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:11:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1092482018, now seen corresponding path program 6 times [2022-10-03 13:11:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:11:51,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264935393] [2022-10-03 13:11:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:11:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:11:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:11:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4343 backedges. 941 proven. 63 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-10-03 13:11:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:11:52,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264935393] [2022-10-03 13:11:52,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264935393] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:11:52,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724346002] [2022-10-03 13:11:52,668 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-03 13:11:52,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:11:52,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:11:52,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:11:52,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-03 13:11:53,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-03 13:11:53,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:11:53,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 178 conjunts are in the unsatisfiable core [2022-10-03 13:11:53,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:11:53,906 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-03 13:11:53,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 13:11:54,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:11:54,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-03 13:11:54,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-10-03 13:11:55,765 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-10-03 13:11:55,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 30 [2022-10-03 13:11:57,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:11:57,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:11:58,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:11:58,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-03 13:11:59,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:12:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4343 backedges. 938 proven. 66 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-10-03 13:12:00,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:12:00,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-10-03 13:12:00,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:12:00,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-10-03 13:12:00,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:12:00,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 20 [2022-10-03 13:12:01,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-10-03 13:12:02,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:12:02,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-10-03 13:12:05,997 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) 0)))) is different from false [2022-10-03 13:12:08,030 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) 0))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|)))) is different from false [2022-10-03 13:12:10,216 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 2) 0)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|)))) is different from false [2022-10-03 13:12:12,301 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ 2 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) 0)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|)))) is different from false [2022-10-03 13:12:14,407 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 2) 0)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|)))) is different from false [2022-10-03 13:12:14,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:12:14,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 12 [2022-10-03 13:12:14,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:12:14,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:12:14,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:12:14,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:12:14,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:12:14,578 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 2) 0))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)) is different from false [2022-10-03 13:12:14,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:12:14,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 22 [2022-10-03 13:12:14,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:12:14,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 40 [2022-10-03 13:12:14,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 22 [2022-10-03 13:12:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4343 backedges. 938 proven. 90 refuted. 0 times theorem prover too weak. 3315 trivial. 0 not checked. [2022-10-03 13:12:15,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724346002] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:12:15,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:12:15,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 46, 45] total 122 [2022-10-03 13:12:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470988005] [2022-10-03 13:12:15,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:12:15,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-10-03 13:12:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:12:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-10-03 13:12:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=12788, Unknown=6, NotChecked=1398, Total=14762 [2022-10-03 13:12:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:12:15,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:12:15,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 7.467213114754099) internal successors, (911), 122 states have internal predecessors, (911), 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) [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 581 states. [2022-10-03 13:12:15,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-10-03 13:12:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 274 states. [2022-10-03 13:12:15,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:12:19,144 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (not (= 2 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~#tid~0#1.base|) (= |c_~#pqb~0.offset| 0) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 2) 0)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_~#pqb~0.base| 3)) is different from false [2022-10-03 13:12:21,150 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (not (= 2 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ 2 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) 0)))) (<= 2 |c_ULTIMATE.start_main_~#tid~0#1.base|) (= |c_~#pqb~0.offset| 0) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_~#pqb~0.base| 3)) is different from false [2022-10-03 13:12:23,156 WARN L833 $PredicateComparison]: unable to prove that (and (not (= 2 |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (<= 2 |c_ULTIMATE.start_write~int_#ptr#1.base|) (not (= 3 |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_~#pqb~0.offset| 0) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 0) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (forall ((v_ArrVal_2156 (Array Int Int))) (not (= (+ (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_2156) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 2) 0)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (= |c_~#pqb~0.base| 3)) is different from false [2022-10-03 13:12:25,161 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|))) (and (= 0 .cse0) (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (= |c_~#pqb~0.offset| 0) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 .cse0) 0))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (= |c_~#pqb~0.base| 3))) is different from false [2022-10-03 13:12:27,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|))) (and (= 0 .cse0) (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_~#pqb~0.offset| 0) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 .cse0) 0))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| 3))) is different from false [2022-10-03 13:12:29,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|))) (and (= 0 .cse0) (= (select (select |c_#pthreadsMutex| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 .cse0) 0))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)))) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:12:31,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|))) (and (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |c_~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) (= 0 .cse0) (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (or (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |c_~#pqb~0.offset|))) (= |c_~#pqb~0.offset| 0) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= (select (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 0) (or (forall ((|workerThread1of1ForFork0_pqueue_get_~qp#1.base| Int) (v_ArrVal_2157 Int) (|workerThread1of1ForFork0_pqueue_get_~qp#1.offset| Int)) (not (= (select (select (store |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base| (store (select |c_workerThread1of1ForFork0_#PthreadsMutexLock_old_#pthreadsMutex#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 4) v_ArrVal_2157)) |c_~#pqb~0.base|) (+ |c_~#pqb~0.offset| 4)) 1))) (not (= (+ 2 .cse0) 0))) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:15:03,480 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#pqb~0.base|) |c_~#pqb~0.offset|)) (.cse0 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (<= .cse1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse1 0) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (<= .cse1 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= |c_workerThread1of1ForFork0_read~int_#value#1| (select (select |c_#memory_int| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_workerThread1of1ForFork0_read~int_#value#1| .cse1) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_1719 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_1719)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_1719)))) (<= 0 (select .cse0 |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|)) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= (+ (select .cse0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (<= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false Received shutdown request... [2022-10-03 13:16:03,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:03,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:03,044 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 [2022-10-03 13:16:03,044 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 [2022-10-03 13:16:03,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:03,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-10-03 13:16:03,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-03 13:16:03,289 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 838 known predicates. [2022-10-03 13:16:03,289 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 13:16:03,291 INFO L444 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1, 1, 1] [2022-10-03 13:16:03,291 INFO L307 ceAbstractionStarter]: Result for error location workerErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-10-03 13:16:03,293 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 13:16:03,293 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 13:16:03,295 INFO L202 PluginConnector]: Adding new model 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line307.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 01:16:03 BasicIcfg [2022-10-03 13:16:03,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 13:16:03,296 INFO L158 Benchmark]: Toolchain (without parser) took 804151.45ms. Allocated memory was 201.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 162.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-10-03 13:16:03,296 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 13:16:03,296 INFO L158 Benchmark]: Boogie Preprocessor took 57.89ms. Allocated memory is still 201.3MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-03 13:16:03,296 INFO L158 Benchmark]: RCFGBuilder took 560.75ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 138.8MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-03 13:16:03,296 INFO L158 Benchmark]: TraceAbstraction took 803528.92ms. Allocated memory was 201.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 138.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-10-03 13:16:03,297 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 57.89ms. Allocated memory is still 201.3MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 560.75ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 138.8MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 803528.92ms. Allocated memory was 201.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 138.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 48, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 132, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3083, positive: 2918, positive conditional: 2918, positive unconditional: 0, negative: 165, negative conditional: 165, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 2767, Positive cache size: 2761, Positive conditional cache size: 0, Positive unconditional cache size: 2761, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 172, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6107, positive: 5833, positive conditional: 5833, positive unconditional: 0, negative: 274, negative conditional: 274, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 4702, Positive cache size: 4689, Positive conditional cache size: 0, Positive unconditional cache size: 4689, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 435, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6659, positive: 6377, positive conditional: 6377, positive unconditional: 0, negative: 282, negative conditional: 282, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 4781, Positive cache size: 4766, Positive conditional cache size: 0, Positive unconditional cache size: 4766, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Independence queries for same thread: 704, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15767, positive: 15073, positive conditional: 15073, positive unconditional: 0, negative: 694, negative conditional: 694, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 7203, Positive cache size: 7180, Positive conditional cache size: 0, Positive unconditional cache size: 7180, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 1379, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17875, positive: 17042, positive conditional: 17042, positive unconditional: 0, negative: 833, negative conditional: 833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 7457, Positive cache size: 7433, Positive conditional cache size: 0, Positive unconditional cache size: 7433, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Independence queries for same thread: 2180, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 34060, positive: 32309, positive conditional: 32309, positive unconditional: 0, negative: 1751, negative conditional: 1751, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 8691, Positive cache size: 8655, Positive conditional cache size: 0, Positive unconditional cache size: 8655, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Independence queries for same thread: 3853, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 401, positive: 364, positive conditional: 364, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 8728, Positive cache size: 8692, Positive conditional cache size: 0, Positive unconditional cache size: 8692, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Independence queries for same thread: 3887, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 34166, positive: 32440, positive conditional: 32440, positive unconditional: 0, negative: 1726, negative conditional: 1726, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 10036, Positive cache size: 9993, Positive conditional cache size: 0, Positive unconditional cache size: 9993, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Independence queries for same thread: 5527, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16133, positive: 15397, positive conditional: 15397, positive unconditional: 0, negative: 736, negative conditional: 736, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 10638, Positive cache size: 10595, Positive conditional cache size: 0, Positive unconditional cache size: 10595, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Independence queries for same thread: 6238, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 22447, positive: 21363, positive conditional: 21363, positive unconditional: 0, negative: 1084, negative conditional: 1084, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12097, Positive cache size: 12053, Positive conditional cache size: 0, Positive unconditional cache size: 12053, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Independence queries for same thread: 7288, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 33416, positive: 31789, positive conditional: 31789, positive unconditional: 0, negative: 1627, negative conditional: 1627, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12623, Positive cache size: 12578, Positive conditional cache size: 0, Positive unconditional cache size: 12578, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Independence queries for same thread: 8865, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 52217, positive: 49891, positive conditional: 49891, positive unconditional: 0, negative: 2326, negative conditional: 2326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12796, Positive cache size: 12750, Positive conditional cache size: 0, Positive unconditional cache size: 12750, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Independence queries for same thread: 11126, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 59454, positive: 56988, positive conditional: 56988, positive unconditional: 0, negative: 2466, negative conditional: 2466, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12857, Positive cache size: 12810, Positive conditional cache size: 0, Positive unconditional cache size: 12810, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Independence queries for same thread: 13523, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 54439, positive: 51998, positive conditional: 51998, positive unconditional: 0, negative: 2441, negative conditional: 2441, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12905, Positive cache size: 12857, Positive conditional cache size: 0, Positive unconditional cache size: 12857, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 15896, Statistics for Abstraction: - StatisticsResult: Independence relation #17 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 36797, positive: 35032, positive conditional: 35032, positive unconditional: 0, negative: 1765, negative conditional: 1765, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393201, positive: 374981, positive conditional: 374981, positive unconditional: 0, negative: 18220, negative conditional: 18220, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375573, positive: 374981, positive conditional: 0, positive unconditional: 374981, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12905, positive: 12857, positive conditional: 0, positive unconditional: 12857, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 375573, positive: 362124, positive conditional: 0, positive unconditional: 362124, negative: 544, negative conditional: 0, negative unconditional: 544, unknown: 12905, unknown conditional: 0, unknown unconditional: 12905] , Statistics on independence cache: Total cache size (in pairs): 12905, Positive cache size: 12857, Positive conditional cache size: 0, Positive unconditional cache size: 12857, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 17628, Statistics for Abstraction: - TimeoutResultAtElement [Line: 307]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 838 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: workerErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: workerErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 803.2s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 636.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1936, 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.7s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 156.4s InterpolantComputationTime, 26797 NumberOfCodeBlocks, 24567 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 36346 ConstructedInterpolants, 929 QuantifiedInterpolants, 197133 SizeOfPredicates, 459 NumberOfNonLiveVariables, 18737 ConjunctsInSsa, 886 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 121271/133099 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