/usr/lib/jvm/java-1.11.0-openjdk-amd64/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/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:51:02,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:51:02,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 16:51:02,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 16:51:02,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 16:51:02,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:51:02,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 16:51:02,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 16:51:02,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:51:02,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:51:02,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:51:02,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:51:02,402 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:51:02,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:51:02,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:51:02,403 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:51:02,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:51:02,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:51:02,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:51:02,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:51:02,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:51:02,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:51:02,404 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:51:02,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:51:02,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:51:02,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:51:02,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:51:02,405 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:51:02,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:51:02,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:51:02,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:51:02,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:51:02,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:51:02,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:51:02,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:51:02,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 16:51:02,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 16:51:02,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 16:51:02,408 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 16:51:02,408 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 16:51:02,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP [2023-11-17 16:51:02,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:51:02,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:51:02,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:51:02,584 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:51:02,585 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:51:02,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-11-17 16:51:03,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:51:03,847 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:51:03,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-11-17 16:51:03,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b19853a/c4b4429b8ade4076add39f1c511dbb43/FLAG87a97a616 [2023-11-17 16:51:03,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b19853a/c4b4429b8ade4076add39f1c511dbb43 [2023-11-17 16:51:03,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:51:03,883 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:51:03,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:51:03,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:51:03,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:51:03,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:51:03" (1/1) ... [2023-11-17 16:51:03,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d305e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:03, skipping insertion in model container [2023-11-17 16:51:03,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:51:03" (1/1) ... [2023-11-17 16:51:03,930 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:51:04,225 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-11-17 16:51:04,230 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-11-17 16:51:04,237 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-11-17 16:51:04,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:51:04,251 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:51:04,293 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-11-17 16:51:04,294 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-11-17 16:51:04,296 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-11-17 16:51:04,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:51:04,341 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:51:04,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04 WrapperNode [2023-11-17 16:51:04,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:51:04,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:51:04,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:51:04,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:51:04,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,399 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2023-11-17 16:51:04,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:51:04,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:51:04,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:51:04,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:51:04,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:51:04,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:51:04,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:51:04,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:51:04,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (1/1) ... [2023-11-17 16:51:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:51:04,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:04,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 16:51:04,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 16:51:04,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 16:51:04,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:51:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:51:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 16:51:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:51:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:51:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:51:04,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:51:04,506 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:51:04,611 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:51:04,613 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:51:04,904 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:51:04,937 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:51:04,937 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 16:51:04,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:51:04 BoogieIcfgContainer [2023-11-17 16:51:04,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:51:04,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:51:04,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:51:04,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:51:04,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:51:03" (1/3) ... [2023-11-17 16:51:04,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a3b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:51:04, skipping insertion in model container [2023-11-17 16:51:04,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:04" (2/3) ... [2023-11-17 16:51:04,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a3b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:51:04, skipping insertion in model container [2023-11-17 16:51:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:51:04" (3/3) ... [2023-11-17 16:51:04,946 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-11-17 16:51:04,951 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 16:51:04,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:51:04,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 16:51:04,957 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:51:05,026 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:51:05,064 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 16:51:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:05,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 16:51:05,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 16:51:05,094 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 16:51:05,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2023-11-17 16:51:05,105 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a7e99af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:05,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 16:51:05,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:05,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 944948057, now seen corresponding path program 1 times [2023-11-17 16:51:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784707701] [2023-11-17 16:51:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784707701] [2023-11-17 16:51:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784707701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:51:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515085264] [2023-11-17 16:51:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:05,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 16:51:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 16:51:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 16:51:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:05,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:51:05,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:05,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1021444045, now seen corresponding path program 1 times [2023-11-17 16:51:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490052910] [2023-11-17 16:51:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490052910] [2023-11-17 16:51:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490052910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:51:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938214736] [2023-11-17 16:51:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:05,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:51:05,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:51:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:51:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:05,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:05,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:51:05,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:05,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1143540943, now seen corresponding path program 1 times [2023-11-17 16:51:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:05,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514863111] [2023-11-17 16:51:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514863111] [2023-11-17 16:51:09,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514863111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-17 16:51:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485253474] [2023-11-17 16:51:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:51:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:09,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:51:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:51:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:09,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:09,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:09,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:09,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:09,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:10,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:51:10,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:10,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2090179222, now seen corresponding path program 1 times [2023-11-17 16:51:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432184944] [2023-11-17 16:51:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432184944] [2023-11-17 16:51:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432184944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-11-17 16:51:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265909093] [2023-11-17 16:51:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:12,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 16:51:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 16:51:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2023-11-17 16:51:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:12,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:12,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.310344827586207) internal successors, (125), 29 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:12,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:12,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:12,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:12,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:51:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:51:13,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:13,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1208447009, now seen corresponding path program 1 times [2023-11-17 16:51:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705451752] [2023-11-17 16:51:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:13,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705451752] [2023-11-17 16:51:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705451752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:51:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9484168] [2023-11-17 16:51:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:13,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:51:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:51:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:51:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:13,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:13,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:13,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:13,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:13,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:13,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:51:13,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 16:51:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:51:14,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:14,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1669345851, now seen corresponding path program 1 times [2023-11-17 16:51:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025263790] [2023-11-17 16:51:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025263790] [2023-11-17 16:51:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025263790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:14,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:14,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475712816] [2023-11-17 16:51:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:14,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:14,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:14,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:14,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 16:51:14,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:14,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash 968635830, now seen corresponding path program 1 times [2023-11-17 16:51:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:14,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636702781] [2023-11-17 16:51:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636702781] [2023-11-17 16:51:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636702781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:15,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-11-17 16:51:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423250359] [2023-11-17 16:51:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:15,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 16:51:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 16:51:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2023-11-17 16:51:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:15,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:15,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.241379310344827) internal successors, (123), 29 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:15,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:17,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 16:51:17,510 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:17,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1978306018, now seen corresponding path program 1 times [2023-11-17 16:51:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:17,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633666639] [2023-11-17 16:51:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633666639] [2023-11-17 16:51:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633666639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:17,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:17,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617321256] [2023-11-17 16:51:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:17,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:17,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 16:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:17,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 16:51:17,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:17,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2123118485, now seen corresponding path program 1 times [2023-11-17 16:51:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:17,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807664346] [2023-11-17 16:51:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807664346] [2023-11-17 16:51:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807664346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-17 16:51:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683171423] [2023-11-17 16:51:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:18,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:51:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:18,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:51:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:51:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:18,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:18,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-17 16:51:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 16:51:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 16:51:18,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 16:51:18,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 16:51:18,439 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:51:18,440 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2023-11-17 16:51:18,447 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:18,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 16:51:18,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:18,462 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) [2023-11-17 16:51:18,463 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 [2023-11-17 16:51:18,467 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 16:51:18,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 16:51:18,468 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a7e99af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:18,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:51:18,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:51:18,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 354382951, now seen corresponding path program 1 times [2023-11-17 16:51:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534680358] [2023-11-17 16:51:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:18,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534680358] [2023-11-17 16:51:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534680358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:51:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304072675] [2023-11-17 16:51:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 16:51:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 16:51:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 16:51:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 16:51:18,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 16:51:18,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 16:51:18,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 16:51:18,627 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-17 16:51:18,627 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-11-17 16:51:18,629 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:18,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 16:51:18,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:18,631 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) [2023-11-17 16:51:18,668 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 [2023-11-17 16:51:18,670 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 16:51:18,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2023-11-17 16:51:18,671 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a7e99af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:18,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 16:51:18,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:18,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 516728171, now seen corresponding path program 1 times [2023-11-17 16:51:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950053015] [2023-11-17 16:51:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950053015] [2023-11-17 16:51:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950053015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:51:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887645428] [2023-11-17 16:51:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:18,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 16:51:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 16:51:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 16:51:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,765 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:18,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:18,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 16:51:18,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:18,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1573819579, now seen corresponding path program 1 times [2023-11-17 16:51:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453144356] [2023-11-17 16:51:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453144356] [2023-11-17 16:51:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453144356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294526658] [2023-11-17 16:51:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:18,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:18,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 16:51:18,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:18,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2098064553, now seen corresponding path program 1 times [2023-11-17 16:51:18,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292403787] [2023-11-17 16:51:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:18,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292403787] [2023-11-17 16:51:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292403787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:18,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358623499] [2023-11-17 16:51:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:18,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:18,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:18,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:18,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 16:51:18,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:18,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash -677637983, now seen corresponding path program 1 times [2023-11-17 16:51:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67373098] [2023-11-17 16:51:18,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:51:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67373098] [2023-11-17 16:51:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67373098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:19,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:51:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046017994] [2023-11-17 16:51:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:19,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:51:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:51:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:51:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:19,044 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:19,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 16:51:19,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:19,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 388135636, now seen corresponding path program 1 times [2023-11-17 16:51:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127237198] [2023-11-17 16:51:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:51:20,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127237198] [2023-11-17 16:51:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127237198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695889060] [2023-11-17 16:51:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:20,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:20,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:20,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:20,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 16:51:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:20,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-17 16:51:20,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:20,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-17 16:51:20,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:20,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:51:21,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:21,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:21,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2023-11-17 16:51:21,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-17 16:51:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:51:21,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 16:51:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695889060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:21,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 16:51:21,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2023-11-17 16:51:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816232525] [2023-11-17 16:51:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:21,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:51:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:21,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:51:21,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2023-11-17 16:51:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:21,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:21,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.777777777777779) internal successors, (212), 18 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:21,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:21,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:21,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:21,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:21,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:51:22,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 16:51:22,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:22,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 116823695, now seen corresponding path program 1 times [2023-11-17 16:51:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739616316] [2023-11-17 16:51:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:51:24,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:24,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739616316] [2023-11-17 16:51:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739616316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:24,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-17 16:51:24,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396505153] [2023-11-17 16:51:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:24,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:51:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:51:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:51:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:24,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:24,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.142857142857142) internal successors, (213), 21 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:51:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:51:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:51:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 16:51:25,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:25,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash -864972675, now seen corresponding path program 1 times [2023-11-17 16:51:25,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982752407] [2023-11-17 16:51:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:51:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982752407] [2023-11-17 16:51:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982752407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751474737] [2023-11-17 16:51:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:27,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 16:51:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:27,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-17 16:51:27,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:27,981 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 16:51:27,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-17 16:51:28,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:51:28,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 16:51:28,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:51:28,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-17 16:51:28,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 16:51:28,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 16:51:28,921 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-17 16:51:28,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-11-17 16:51:28,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-17 16:51:29,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-17 16:51:29,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:29,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:51:29,856 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-17 16:51:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 25 [2023-11-17 16:51:29,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2023-11-17 16:51:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:51:29,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:33,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse0 (select .cse4 .cse2)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse3))) (not (= 800 (select .cse1 .cse2))) (= .cse0 (select .cse4 .cse3)))))) is different from false [2023-11-17 16:51:33,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse5 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse5 .cse2)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse3) 800)) (< .cse4 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (= .cse4 (select .cse5 .cse3)) (not (= (select .cse1 .cse2) 800))))))) is different from false [2023-11-17 16:51:34,002 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse4)) (.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) .cse2) (< .cse2 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= (select .cse3 .cse4) 800)) (not (= 800 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse4 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse1)))))))))) is different from false [2023-11-17 16:51:34,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse0 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse6)) (.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) .cse2) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (< .cse2 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= (select .cse5 .cse6) 800)) (not (= 800 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse6 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse1))))))))) is different from false [2023-11-17 16:51:34,146 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse7 .cse2)) (.cse1 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse3) 800)) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (< .cse6 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (= (select .cse7 .cse3) .cse6) (not (= (select .cse1 .cse2) 800)))))))) is different from false [2023-11-17 16:51:34,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) (.cse6 (select .cse7 .cse1)) (.cse5 (+ 3200 |c_~#queue~0.offset|))) (or (not (= 800 (select .cse0 .cse1))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse5))) (< .cse6 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (= .cse6 (select .cse7 .cse5)))))))) is different from false [2023-11-17 16:51:34,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse6 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse5 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse5 .cse2)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse3))) (< .cse4 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (= .cse4 (select .cse5 .cse3)) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (not (= (select .cse1 .cse2) 800)))))))) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|)))) is different from false [2023-11-17 16:51:34,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))))) (let ((.cse4 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse4 .cse7)) (.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) (.cse5 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (= .cse3 (select .cse4 .cse5)) (not (= 800 (select .cse6 .cse7))) (< .cse3 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_705) .cse7 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse5)))))))))) is different from false [2023-11-17 16:51:35,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_699 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_699))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse6 .cse2 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse8 .cse3)) (.cse1 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_705) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse4) 800)) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (= .cse7 (select .cse8 .cse4)) (< .cse7 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select .cse1 .cse3)))))))))) is different from false [2023-11-17 16:51:35,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_699 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_698 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_699))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse8 .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) (.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (not (= 800 (select .cse2 .cse1))) (= .cse3 (select .cse4 .cse5)) (not (= (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_705) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse5) 800)) (< .cse3 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|)))))))) is different from false [2023-11-17 16:51:36,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_699 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_698 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_699))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27| 1))) |c_~#stored_elements~0.base| v_ArrVal_703) |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 .cse1)) (.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_27|) (= .cse2 (select .cse3 .cse4)) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (not (= 800 (select .cse6 .cse1))) (< .cse2 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_25|) (not (= 800 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_705) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|) .cse4)))))))))) is different from false [2023-11-17 16:51:36,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:36,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 345 [2023-11-17 16:51:36,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:36,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2248 treesize of output 2232 [2023-11-17 16:51:36,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 605 treesize of output 541 [2023-11-17 16:51:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 656 treesize of output 640 [2023-11-17 16:51:36,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 765 [2023-11-17 16:51:36,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2023-11-17 16:51:36,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:36,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 8 [2023-11-17 16:51:37,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:37,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 422 treesize of output 436 [2023-11-17 16:51:39,313 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-11-17 16:51:39,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2023-11-17 16:51:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:51:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751474737] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:39,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 39] total 94 [2023-11-17 16:51:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445313036] [2023-11-17 16:51:39,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-11-17 16:51:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-11-17 16:51:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=6064, Unknown=50, NotChecked=1892, Total=8742 [2023-11-17 16:51:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:39,355 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:39,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 5.957446808510638) internal successors, (560), 94 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:51:39,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:51:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:51:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-17 16:51:47,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:47,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-17 16:51:47,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:47,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -314292067, now seen corresponding path program 1 times [2023-11-17 16:51:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:47,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135844245] [2023-11-17 16:51:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:51:47,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 16:51:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:51:47,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 16:51:47,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 16:51:47,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 16:51:47,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 16:51:47,667 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:51:47,668 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was UNSAFE (3/3) [2023-11-17 16:51:47,671 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:51:47,671 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:51:47,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-17 16:51:47,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-17 16:51:47,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret64 could not be translated [2023-11-17 16:51:47,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre65 could not be translated [2023-11-17 16:51:47,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre67 could not be translated [2023-11-17 16:51:47,778 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated [2023-11-17 16:51:47,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-17 16:51:47,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-17 16:51:47,780 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-17 16:51:47,781 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-17 16:51:47,781 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated [2023-11-17 16:51:47,781 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated [2023-11-17 16:51:47,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-17 16:51:47,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-17 16:51:47,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-17 16:51:47,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-17 16:51:47,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-17 16:51:47,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated [2023-11-17 16:51:47,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-17 16:51:47,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated [2023-11-17 16:51:47,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-17 16:51:47,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret51 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-17 16:51:47,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret52 could not be translated [2023-11-17 16:51:47,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet56 could not be translated [2023-11-17 16:51:47,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-17 16:51:47,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-17 16:51:47,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-17 16:51:47,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated [2023-11-17 16:51:47,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-17 16:51:47,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-17 16:51:47,791 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-17 16:51:47,791 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-17 16:51:47,791 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-17 16:51:47,791 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated [2023-11-17 16:51:47,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post54 could not be translated [2023-11-17 16:51:47,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post54 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post45 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post45 could not be translated [2023-11-17 16:51:47,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post48 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret61 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-17 16:51:47,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret61 could not be translated [2023-11-17 16:51:47,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:51:47 BasicIcfg [2023-11-17 16:51:47,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:51:47,807 INFO L158 Benchmark]: Toolchain (without parser) took 43924.04ms. Allocated memory was 285.2MB in the beginning and 984.6MB in the end (delta: 699.4MB). Free memory was 229.7MB in the beginning and 566.2MB in the end (delta: -336.6MB). Peak memory consumption was 363.1MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,807 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:51:47,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.84ms. Allocated memory is still 285.2MB. Free memory was 229.7MB in the beginning and 199.2MB in the end (delta: 30.5MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 285.2MB. Free memory was 199.2MB in the beginning and 247.5MB in the end (delta: -48.3MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,807 INFO L158 Benchmark]: Boogie Preprocessor took 26.41ms. Allocated memory is still 285.2MB. Free memory was 247.5MB in the beginning and 244.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,810 INFO L158 Benchmark]: RCFGBuilder took 512.69ms. Allocated memory is still 285.2MB. Free memory was 244.8MB in the beginning and 220.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,810 INFO L158 Benchmark]: TraceAbstraction took 42865.76ms. Allocated memory was 285.2MB in the beginning and 984.6MB in the end (delta: 699.4MB). Free memory was 219.1MB in the beginning and 566.2MB in the end (delta: -347.1MB). Peak memory consumption was 352.3MB. Max. memory is 8.0GB. [2023-11-17 16:51:47,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 457.84ms. Allocated memory is still 285.2MB. Free memory was 229.7MB in the beginning and 199.2MB in the end (delta: 30.5MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 285.2MB. Free memory was 199.2MB in the beginning and 247.5MB in the end (delta: -48.3MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.41ms. Allocated memory is still 285.2MB. Free memory was 247.5MB in the beginning and 244.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 512.69ms. Allocated memory is still 285.2MB. Free memory was 244.8MB in the beginning and 220.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 42865.76ms. Allocated memory was 285.2MB in the beginning and 984.6MB in the end (delta: 699.4MB). Free memory was 219.1MB in the beginning and 566.2MB in the end (delta: -347.1MB). Peak memory consumption was 352.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret61 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27558, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 1141, dependent conditional: 1074, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26539, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 122, dependent conditional: 55, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26539, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 122, dependent conditional: 55, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 400, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 84, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 84, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12060, independent: 11973, independent conditional: 23, independent unconditional: 11950, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12060, independent: 11946, independent conditional: 0, independent unconditional: 11946, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 114, independent: 27, independent conditional: 23, independent unconditional: 4, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 27, independent conditional: 23, independent unconditional: 4, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 130, dependent conditional: 32, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27063, independent: 14444, independent conditional: 101, independent unconditional: 14343, dependent: 559, dependent conditional: 64, dependent unconditional: 495, unknown: 12060, unknown conditional: 43, unknown unconditional: 12017] , Statistics on independence cache: Total cache size (in pairs): 12060, Positive cache size: 11973, Positive conditional cache size: 23, Positive unconditional cache size: 11950, Negative cache size: 87, Negative conditional cache size: 20, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 316, Maximal queried relation: 7, Independence queries for same thread: 1019 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1692, Number of trivial persistent sets: 308, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13894, independent: 13827, independent conditional: 0, independent unconditional: 13827, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27558, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 1141, dependent conditional: 1074, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26539, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 122, dependent conditional: 55, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26539, independent: 26417, independent conditional: 12590, independent unconditional: 13827, dependent: 122, dependent conditional: 55, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 400, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 84, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27063, independent: 26417, independent conditional: 124, independent unconditional: 26293, dependent: 646, dependent conditional: 84, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12060, independent: 11973, independent conditional: 23, independent unconditional: 11950, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12060, independent: 11946, independent conditional: 0, independent unconditional: 11946, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 114, independent: 27, independent conditional: 23, independent unconditional: 4, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 27, independent conditional: 23, independent unconditional: 4, dependent: 87, dependent conditional: 20, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 130, dependent conditional: 32, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27063, independent: 14444, independent conditional: 101, independent unconditional: 14343, dependent: 559, dependent conditional: 64, dependent unconditional: 495, unknown: 12060, unknown conditional: 43, unknown unconditional: 12017] , Statistics on independence cache: Total cache size (in pairs): 12060, Positive cache size: 11973, Positive conditional cache size: 23, Positive unconditional cache size: 11950, Negative cache size: 87, Negative conditional cache size: 20, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 316, Maximal queried relation: 7, Independence queries for same thread: 1019 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8852, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8835, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8835, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8560, independent: 8489, independent conditional: 0, independent unconditional: 8489, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8560, independent: 8485, independent conditional: 0, independent unconditional: 8485, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8855, independent: 255, independent conditional: 0, independent unconditional: 255, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8560, unknown conditional: 0, unknown unconditional: 8560] , Statistics on independence cache: Total cache size (in pairs): 8560, Positive cache size: 8489, Positive conditional cache size: 0, Positive unconditional cache size: 8489, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 199, Number of trivial persistent sets: 170, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8707, independent: 8636, independent conditional: 0, independent unconditional: 8636, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8852, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8835, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8835, independent: 8744, independent conditional: 108, independent unconditional: 8636, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8855, independent: 8744, independent conditional: 0, independent unconditional: 8744, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8560, independent: 8489, independent conditional: 0, independent unconditional: 8489, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8560, independent: 8485, independent conditional: 0, independent unconditional: 8485, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8855, independent: 255, independent conditional: 0, independent unconditional: 255, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8560, unknown conditional: 0, unknown unconditional: 8560] , Statistics on independence cache: Total cache size (in pairs): 8560, Positive cache size: 8489, Positive conditional cache size: 0, Positive unconditional cache size: 8489, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18059, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 365, dependent conditional: 299, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17793, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 99, dependent conditional: 33, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17793, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 99, dependent conditional: 33, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 84, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 26, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 26, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13496, independent: 13421, independent conditional: 2, independent unconditional: 13419, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13496, independent: 13413, independent conditional: 0, independent unconditional: 13413, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, independent: 32, independent conditional: 4, independent unconditional: 29, dependent: 78, dependent conditional: 14, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17879, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 110, dependent conditional: 17, dependent unconditional: 93, unknown: 13496, unknown conditional: 11, unknown unconditional: 13485] , Statistics on independence cache: Total cache size (in pairs): 13496, Positive cache size: 13421, Positive conditional cache size: 2, Positive unconditional cache size: 13419, Negative cache size: 75, Negative conditional cache size: 9, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 5, Independence queries for same thread: 266 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 312, Number of trivial persistent sets: 175, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15830, independent: 15764, independent conditional: 0, independent unconditional: 15764, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18059, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 365, dependent conditional: 299, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17793, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 99, dependent conditional: 33, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17793, independent: 17694, independent conditional: 1930, independent unconditional: 15764, dependent: 99, dependent conditional: 33, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 84, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 26, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17879, independent: 17694, independent conditional: 2, independent unconditional: 17692, dependent: 185, dependent conditional: 26, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13496, independent: 13421, independent conditional: 2, independent unconditional: 13419, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13496, independent: 13413, independent conditional: 0, independent unconditional: 13413, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 75, dependent conditional: 9, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, independent: 32, independent conditional: 4, independent unconditional: 29, dependent: 78, dependent conditional: 14, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17879, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 110, dependent conditional: 17, dependent unconditional: 93, unknown: 13496, unknown conditional: 11, unknown unconditional: 13485] , Statistics on independence cache: Total cache size (in pairs): 13496, Positive cache size: 13421, Positive conditional cache size: 2, Positive unconditional cache size: 13419, Negative cache size: 75, Negative conditional cache size: 9, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 5, Independence queries for same thread: 266 - PositiveResult [Line: 1032]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; VAL [m={3:0}] [L949] 0 int stored_elements[(800)]; VAL [m={3:0}, stored_elements={4:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={3:0}, stored_elements={4:0}] [L951] 0 QType queue; VAL [dequeue_flag=0, enqueue_flag=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L980] 1 q->element[q->tail] = x VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L981] EXPR 1 q->amount VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L981] 1 q->amount++ VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L981] 1 q->amount++ VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L982] EXPR 1 q->tail VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L988] EXPR 1 q->tail VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L988] 1 q->tail++ VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1064] 0 \read(id1) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={7:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L988] 1 q->tail++ VAL [\old(x)=6, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L990] 1 return 0; VAL [\old(x)=6, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1013] 1 stored_elements[0]=value VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] COND TRUE 1 i<((800)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1023] 1 value = __VERIFIER_nondet_int() VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1018] COND TRUE 1 i<((800)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L997] COND FALSE 2 !(q->head == (800)) VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1003] 2 return x; VAL [\result=6, dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=6] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 433 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.2s, 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: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 16352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 433 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 433 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 9.9s, 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: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 1844 NumberOfCodeBlocks, 1844 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1826 ConstructedInterpolants, 151 QuantifiedInterpolants, 50880 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 79/126 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 proved your program to be incorrect! [2023-11-17 16:51:47,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-11-17 16:51:48,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-11-17 16:51:48,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:48,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...