/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:11:54,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:11:54,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 11:11:54,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:11:54,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:11:54,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:11:54,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:11:54,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:11:54,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:11:54,309 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:11:54,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:11:54,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:11:54,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:11:54,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:11:54,311 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:11:54,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:11:54,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:11:54,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:11:54,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:11:54,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:11:54,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:11:54,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:11:54,313 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:11:54,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:11:54,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:54,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:11:54,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:11:54,316 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 11:11:54,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:11:54,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:11:54,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:11:54,502 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:11:54,503 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:11:54,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2023-12-21 11:11:55,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:11:55,687 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:11:55,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2023-12-21 11:11:55,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d97c709c/d06668b533814995864537bb94101172/FLAG6ba4b3ad7 [2023-12-21 11:11:55,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d97c709c/d06668b533814995864537bb94101172 [2023-12-21 11:11:55,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:11:55,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:11:55,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:55,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:11:55,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:11:55,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:55" (1/1) ... [2023-12-21 11:11:55,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253c642f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:55, skipping insertion in model container [2023-12-21 11:11:55,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:55" (1/1) ... [2023-12-21 11:11:55,789 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:11:55,875 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c[646,659] [2023-12-21 11:11:55,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:55,955 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:11:55,963 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c[646,659] [2023-12-21 11:11:56,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:56,031 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:11:56,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56 WrapperNode [2023-12-21 11:11:56,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:56,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:56,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:11:56,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:11:56,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,086 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 857 [2023-12-21 11:11:56,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:56,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:11:56,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:11:56,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:11:56,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 11:11:56,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:11:56,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:11:56,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:11:56,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:11:56,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (1/1) ... [2023-12-21 11:11:56,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:56,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 11:11:56,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 11:11:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:11:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:11:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 11:11:56,230 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 11:11:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:11:56,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:11:56,324 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:11:56,326 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:11:56,838 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:11:56,869 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:11:56,869 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-12-21 11:11:56,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:56 BoogieIcfgContainer [2023-12-21 11:11:56,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:11:56,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:11:56,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:11:56,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:11:56,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:11:55" (1/3) ... [2023-12-21 11:11:56,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45226ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:56, skipping insertion in model container [2023-12-21 11:11:56,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:56" (2/3) ... [2023-12-21 11:11:56,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45226ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:56, skipping insertion in model container [2023-12-21 11:11:56,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:56" (3/3) ... [2023-12-21 11:11:56,875 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2023-12-21 11:11:56,886 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:11:56,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:11:56,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:11:56,928 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=PETRI_NET, 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;@297fca8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:11:56,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:11:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 243 states have (on average 1.9382716049382716) internal successors, (471), 249 states have internal predecessors, (471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 11:11:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 11:11:56,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:56,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:56,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:56,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -496552046, now seen corresponding path program 1 times [2023-12-21 11:11:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173776527] [2023-12-21 11:11:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:57,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173776527] [2023-12-21 11:11:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173776527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391733742] [2023-12-21 11:11:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:57,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:57,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,172 INFO L87 Difference]: Start difference. First operand has 251 states, 243 states have (on average 1.9382716049382716) internal successors, (471), 249 states have internal predecessors, (471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:57,460 INFO L93 Difference]: Finished difference Result 662 states and 1267 transitions. [2023-12-21 11:11:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-21 11:11:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:57,476 INFO L225 Difference]: With dead ends: 662 [2023-12-21 11:11:57,477 INFO L226 Difference]: Without dead ends: 411 [2023-12-21 11:11:57,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,487 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 247 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:57,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 702 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-21 11:11:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 404. [2023-12-21 11:11:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 398 states have (on average 1.6407035175879396) internal successors, (653), 402 states have internal predecessors, (653), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 658 transitions. [2023-12-21 11:11:57,537 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 658 transitions. Word has length 26 [2023-12-21 11:11:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:57,537 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 658 transitions. [2023-12-21 11:11:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 658 transitions. [2023-12-21 11:11:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 11:11:57,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:57,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:57,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:11:57,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:57,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1406671528, now seen corresponding path program 1 times [2023-12-21 11:11:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307739246] [2023-12-21 11:11:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307739246] [2023-12-21 11:11:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307739246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:57,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:57,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293489192] [2023-12-21 11:11:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:57,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,585 INFO L87 Difference]: Start difference. First operand 404 states and 658 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:57,705 INFO L93 Difference]: Finished difference Result 1060 states and 1752 transitions. [2023-12-21 11:11:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:57,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-21 11:11:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:57,708 INFO L225 Difference]: With dead ends: 1060 [2023-12-21 11:11:57,708 INFO L226 Difference]: Without dead ends: 669 [2023-12-21 11:11:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,710 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 312 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:57,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 932 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-12-21 11:11:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 662. [2023-12-21 11:11:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 656 states have (on average 1.6722560975609757) internal successors, (1097), 660 states have internal predecessors, (1097), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1102 transitions. [2023-12-21 11:11:57,750 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1102 transitions. Word has length 37 [2023-12-21 11:11:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:57,750 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1102 transitions. [2023-12-21 11:11:57,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1102 transitions. [2023-12-21 11:11:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 11:11:57,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:57,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:57,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:11:57,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:57,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -927320313, now seen corresponding path program 1 times [2023-12-21 11:11:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993863493] [2023-12-21 11:11:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993863493] [2023-12-21 11:11:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993863493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081992107] [2023-12-21 11:11:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:57,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,818 INFO L87 Difference]: Start difference. First operand 662 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:57,878 INFO L93 Difference]: Finished difference Result 1660 states and 2767 transitions. [2023-12-21 11:11:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-21 11:11:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:57,883 INFO L225 Difference]: With dead ends: 1660 [2023-12-21 11:11:57,883 INFO L226 Difference]: Without dead ends: 1022 [2023-12-21 11:11:57,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:57,888 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 336 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:57,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 738 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2023-12-21 11:11:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1011. [2023-12-21 11:11:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1005 states have (on average 1.6666666666666667) internal successors, (1675), 1009 states have internal predecessors, (1675), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1680 transitions. [2023-12-21 11:11:57,915 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1680 transitions. Word has length 38 [2023-12-21 11:11:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:57,919 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1680 transitions. [2023-12-21 11:11:57,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1680 transitions. [2023-12-21 11:11:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 11:11:57,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:57,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:11:57,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:57,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1056862835, now seen corresponding path program 1 times [2023-12-21 11:11:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682013201] [2023-12-21 11:11:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682013201] [2023-12-21 11:11:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682013201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768932866] [2023-12-21 11:11:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:58,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:58,007 INFO L87 Difference]: Start difference. First operand 1011 states and 1680 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:58,348 INFO L93 Difference]: Finished difference Result 3578 states and 5964 transitions. [2023-12-21 11:11:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:11:58,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-21 11:11:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:58,356 INFO L225 Difference]: With dead ends: 3578 [2023-12-21 11:11:58,356 INFO L226 Difference]: Without dead ends: 2591 [2023-12-21 11:11:58,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:58,367 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1109 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:58,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1463 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:11:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2023-12-21 11:11:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2101. [2023-12-21 11:11:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 2095 states have (on average 1.6644391408114558) internal successors, (3487), 2099 states have internal predecessors, (3487), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 3492 transitions. [2023-12-21 11:11:58,417 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 3492 transitions. Word has length 43 [2023-12-21 11:11:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 3492 transitions. [2023-12-21 11:11:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 3492 transitions. [2023-12-21 11:11:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 11:11:58,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:58,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:11:58,419 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:58,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2144538685, now seen corresponding path program 1 times [2023-12-21 11:11:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57425106] [2023-12-21 11:11:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57425106] [2023-12-21 11:11:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57425106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423013177] [2023-12-21 11:11:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:58,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:58,513 INFO L87 Difference]: Start difference. First operand 2101 states and 3492 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:58,814 INFO L93 Difference]: Finished difference Result 6150 states and 10099 transitions. [2023-12-21 11:11:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:11:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 11:11:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:58,826 INFO L225 Difference]: With dead ends: 6150 [2023-12-21 11:11:58,826 INFO L226 Difference]: Without dead ends: 4067 [2023-12-21 11:11:58,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:58,830 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 708 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:58,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 944 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2023-12-21 11:11:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3713. [2023-12-21 11:11:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 3707 states have (on average 1.629349878608039) internal successors, (6040), 3711 states have internal predecessors, (6040), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 6045 transitions. [2023-12-21 11:11:58,947 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 6045 transitions. Word has length 50 [2023-12-21 11:11:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:58,948 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 6045 transitions. [2023-12-21 11:11:58,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 6045 transitions. [2023-12-21 11:11:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 11:11:58,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:58,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:58,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:11:58,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:58,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash 245452, now seen corresponding path program 1 times [2023-12-21 11:11:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:58,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233119426] [2023-12-21 11:11:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233119426] [2023-12-21 11:11:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233119426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:58,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:58,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167991071] [2023-12-21 11:11:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:58,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:58,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:58,975 INFO L87 Difference]: Start difference. First operand 3713 states and 6045 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:59,088 INFO L93 Difference]: Finished difference Result 8822 states and 14322 transitions. [2023-12-21 11:11:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 11:11:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:59,101 INFO L225 Difference]: With dead ends: 8822 [2023-12-21 11:11:59,101 INFO L226 Difference]: Without dead ends: 5131 [2023-12-21 11:11:59,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:59,105 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 351 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:59,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 641 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2023-12-21 11:11:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4855. [2023-12-21 11:11:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4855 states, 4849 states have (on average 1.6102289131779748) internal successors, (7808), 4853 states have internal predecessors, (7808), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 7813 transitions. [2023-12-21 11:11:59,271 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 7813 transitions. Word has length 50 [2023-12-21 11:11:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:59,272 INFO L495 AbstractCegarLoop]: Abstraction has 4855 states and 7813 transitions. [2023-12-21 11:11:59,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 7813 transitions. [2023-12-21 11:11:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:11:59,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:59,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:59,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:11:59,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:59,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:59,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1613361935, now seen corresponding path program 1 times [2023-12-21 11:11:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041915580] [2023-12-21 11:11:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041915580] [2023-12-21 11:11:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041915580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:11:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202543178] [2023-12-21 11:11:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:59,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:59,336 INFO L87 Difference]: Start difference. First operand 4855 states and 7813 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:59,575 INFO L93 Difference]: Finished difference Result 11739 states and 18977 transitions. [2023-12-21 11:11:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-21 11:11:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:59,594 INFO L225 Difference]: With dead ends: 11739 [2023-12-21 11:11:59,594 INFO L226 Difference]: Without dead ends: 6906 [2023-12-21 11:11:59,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:59,602 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 237 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:59,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 791 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6906 states. [2023-12-21 11:11:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6906 to 5615. [2023-12-21 11:11:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5609 states have (on average 1.5558923159208415) internal successors, (8727), 5613 states have internal predecessors, (8727), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 8732 transitions. [2023-12-21 11:11:59,782 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 8732 transitions. Word has length 56 [2023-12-21 11:11:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:59,783 INFO L495 AbstractCegarLoop]: Abstraction has 5615 states and 8732 transitions. [2023-12-21 11:11:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 8732 transitions. [2023-12-21 11:11:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:11:59,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:59,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:59,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:11:59,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:59,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2134058211, now seen corresponding path program 1 times [2023-12-21 11:11:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017720420] [2023-12-21 11:11:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017720420] [2023-12-21 11:11:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017720420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:11:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267234493] [2023-12-21 11:11:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:59,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:11:59,838 INFO L87 Difference]: Start difference. First operand 5615 states and 8732 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:11:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:59,989 INFO L93 Difference]: Finished difference Result 11074 states and 17242 transitions. [2023-12-21 11:11:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 11:11:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:00,004 INFO L225 Difference]: With dead ends: 11074 [2023-12-21 11:12:00,005 INFO L226 Difference]: Without dead ends: 5481 [2023-12-21 11:12:00,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:00,013 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 328 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:00,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 401 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2023-12-21 11:12:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5481. [2023-12-21 11:12:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 5475 states have (on average 1.5360730593607306) internal successors, (8410), 5479 states have internal predecessors, (8410), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 8415 transitions. [2023-12-21 11:12:00,135 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 8415 transitions. Word has length 58 [2023-12-21 11:12:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:00,136 INFO L495 AbstractCegarLoop]: Abstraction has 5481 states and 8415 transitions. [2023-12-21 11:12:00,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 8415 transitions. [2023-12-21 11:12:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:12:00,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:00,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:00,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:12:00,138 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:00,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1957123240, now seen corresponding path program 1 times [2023-12-21 11:12:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789977953] [2023-12-21 11:12:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:00,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789977953] [2023-12-21 11:12:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789977953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:12:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264325864] [2023-12-21 11:12:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:00,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:00,164 INFO L87 Difference]: Start difference. First operand 5481 states and 8415 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:00,295 INFO L93 Difference]: Finished difference Result 10563 states and 16330 transitions. [2023-12-21 11:12:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-21 11:12:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:00,303 INFO L225 Difference]: With dead ends: 10563 [2023-12-21 11:12:00,303 INFO L226 Difference]: Without dead ends: 5104 [2023-12-21 11:12:00,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:00,309 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 150 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:00,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 831 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2023-12-21 11:12:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 4437. [2023-12-21 11:12:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4431 states have (on average 1.5596930715414128) internal successors, (6911), 4435 states have internal predecessors, (6911), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 6916 transitions. [2023-12-21 11:12:00,410 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 6916 transitions. Word has length 59 [2023-12-21 11:12:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:00,410 INFO L495 AbstractCegarLoop]: Abstraction has 4437 states and 6916 transitions. [2023-12-21 11:12:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 6916 transitions. [2023-12-21 11:12:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 11:12:00,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:00,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:00,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:12:00,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:00,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1486111498, now seen corresponding path program 1 times [2023-12-21 11:12:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307514823] [2023-12-21 11:12:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307514823] [2023-12-21 11:12:00,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307514823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:00,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:00,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:12:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801111188] [2023-12-21 11:12:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:00,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:12:00,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:12:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:00,456 INFO L87 Difference]: Start difference. First operand 4437 states and 6916 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:00,885 INFO L93 Difference]: Finished difference Result 12932 states and 20135 transitions. [2023-12-21 11:12:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:12:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-21 11:12:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:00,899 INFO L225 Difference]: With dead ends: 12932 [2023-12-21 11:12:00,899 INFO L226 Difference]: Without dead ends: 8697 [2023-12-21 11:12:00,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:12:00,904 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 914 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:00,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 2189 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:12:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8697 states. [2023-12-21 11:12:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8697 to 5981. [2023-12-21 11:12:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5981 states, 5975 states have (on average 1.5603347280334727) internal successors, (9323), 5979 states have internal predecessors, (9323), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 9328 transitions. [2023-12-21 11:12:01,065 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 9328 transitions. Word has length 61 [2023-12-21 11:12:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:01,065 INFO L495 AbstractCegarLoop]: Abstraction has 5981 states and 9328 transitions. [2023-12-21 11:12:01,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 9328 transitions. [2023-12-21 11:12:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-21 11:12:01,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:01,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:01,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:12:01,067 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:01,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash -183177238, now seen corresponding path program 1 times [2023-12-21 11:12:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:01,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211241415] [2023-12-21 11:12:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:01,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211241415] [2023-12-21 11:12:01,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211241415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:12:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438365626] [2023-12-21 11:12:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:01,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:12:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:01,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:12:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:12:01,119 INFO L87 Difference]: Start difference. First operand 5981 states and 9328 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:01,442 INFO L93 Difference]: Finished difference Result 14410 states and 22295 transitions. [2023-12-21 11:12:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:12:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-21 11:12:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:01,456 INFO L225 Difference]: With dead ends: 14410 [2023-12-21 11:12:01,456 INFO L226 Difference]: Without dead ends: 8631 [2023-12-21 11:12:01,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:12:01,465 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 812 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:01,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2726 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2023-12-21 11:12:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 6321. [2023-12-21 11:12:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 6315 states have (on average 1.54916864608076) internal successors, (9783), 6319 states have internal predecessors, (9783), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 9788 transitions. [2023-12-21 11:12:01,712 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 9788 transitions. Word has length 62 [2023-12-21 11:12:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:01,712 INFO L495 AbstractCegarLoop]: Abstraction has 6321 states and 9788 transitions. [2023-12-21 11:12:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 9788 transitions. [2023-12-21 11:12:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 11:12:01,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:01,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:01,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:12:01,714 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:01,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1485200619, now seen corresponding path program 1 times [2023-12-21 11:12:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123950024] [2023-12-21 11:12:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123950024] [2023-12-21 11:12:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123950024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 11:12:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161219578] [2023-12-21 11:12:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:01,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:01,737 INFO L87 Difference]: Start difference. First operand 6321 states and 9788 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:01,980 INFO L93 Difference]: Finished difference Result 13413 states and 20726 transitions. [2023-12-21 11:12:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-12-21 11:12:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:01,992 INFO L225 Difference]: With dead ends: 13413 [2023-12-21 11:12:01,992 INFO L226 Difference]: Without dead ends: 7112 [2023-12-21 11:12:02,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:02,002 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 130 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:02,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 740 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2023-12-21 11:12:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 7026. [2023-12-21 11:12:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7026 states, 7020 states have (on average 1.543019943019943) internal successors, (10832), 7024 states have internal predecessors, (10832), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 10837 transitions. [2023-12-21 11:12:02,242 INFO L78 Accepts]: Start accepts. Automaton has 7026 states and 10837 transitions. Word has length 74 [2023-12-21 11:12:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:02,242 INFO L495 AbstractCegarLoop]: Abstraction has 7026 states and 10837 transitions. [2023-12-21 11:12:02,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 7026 states and 10837 transitions. [2023-12-21 11:12:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-21 11:12:02,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:02,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:02,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:12:02,245 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:02,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -851166086, now seen corresponding path program 1 times [2023-12-21 11:12:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829031693] [2023-12-21 11:12:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829031693] [2023-12-21 11:12:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829031693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:12:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315462918] [2023-12-21 11:12:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:02,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:12:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:12:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:12:02,280 INFO L87 Difference]: Start difference. First operand 7026 states and 10837 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:02,688 INFO L93 Difference]: Finished difference Result 18235 states and 27850 transitions. [2023-12-21 11:12:02,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:12:02,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-12-21 11:12:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:02,706 INFO L225 Difference]: With dead ends: 18235 [2023-12-21 11:12:02,706 INFO L226 Difference]: Without dead ends: 11096 [2023-12-21 11:12:02,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:12:02,718 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 608 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:02,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1131 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:12:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2023-12-21 11:12:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 9743. [2023-12-21 11:12:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9743 states, 9737 states have (on average 1.5044674951217007) internal successors, (14649), 9741 states have internal predecessors, (14649), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9743 states to 9743 states and 14654 transitions. [2023-12-21 11:12:02,995 INFO L78 Accepts]: Start accepts. Automaton has 9743 states and 14654 transitions. Word has length 85 [2023-12-21 11:12:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:02,995 INFO L495 AbstractCegarLoop]: Abstraction has 9743 states and 14654 transitions. [2023-12-21 11:12:02,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 9743 states and 14654 transitions. [2023-12-21 11:12:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 11:12:02,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:02,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 11:12:02,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:02,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash -797511985, now seen corresponding path program 1 times [2023-12-21 11:12:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467536259] [2023-12-21 11:12:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467536259] [2023-12-21 11:12:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467536259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:12:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886886948] [2023-12-21 11:12:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:03,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:03,034 INFO L87 Difference]: Start difference. First operand 9743 states and 14654 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:03,173 INFO L93 Difference]: Finished difference Result 13864 states and 20898 transitions. [2023-12-21 11:12:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-21 11:12:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:03,179 INFO L225 Difference]: With dead ends: 13864 [2023-12-21 11:12:03,179 INFO L226 Difference]: Without dead ends: 4131 [2023-12-21 11:12:03,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:03,189 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 323 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:03,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 465 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2023-12-21 11:12:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4073. [2023-12-21 11:12:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4067 states have (on average 1.4029997541185149) internal successors, (5706), 4071 states have internal predecessors, (5706), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5711 transitions. [2023-12-21 11:12:03,328 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5711 transitions. Word has length 91 [2023-12-21 11:12:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:03,328 INFO L495 AbstractCegarLoop]: Abstraction has 4073 states and 5711 transitions. [2023-12-21 11:12:03,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5711 transitions. [2023-12-21 11:12:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-21 11:12:03,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:03,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:03,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:12:03,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:03,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash 941878888, now seen corresponding path program 1 times [2023-12-21 11:12:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341509753] [2023-12-21 11:12:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341509753] [2023-12-21 11:12:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341509753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:12:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955751479] [2023-12-21 11:12:03,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:03,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:12:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:12:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:12:03,379 INFO L87 Difference]: Start difference. First operand 4073 states and 5711 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:03,578 INFO L93 Difference]: Finished difference Result 9602 states and 13440 transitions. [2023-12-21 11:12:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:12:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-12-21 11:12:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:03,587 INFO L225 Difference]: With dead ends: 9602 [2023-12-21 11:12:03,587 INFO L226 Difference]: Without dead ends: 5693 [2023-12-21 11:12:03,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:12:03,596 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 525 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:03,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2139 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2023-12-21 11:12:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 4075. [2023-12-21 11:12:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 4069 states have (on average 1.3998525436225118) internal successors, (5696), 4073 states have internal predecessors, (5696), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 5701 transitions. [2023-12-21 11:12:03,752 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 5701 transitions. Word has length 95 [2023-12-21 11:12:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:03,753 INFO L495 AbstractCegarLoop]: Abstraction has 4075 states and 5701 transitions. [2023-12-21 11:12:03,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 5701 transitions. [2023-12-21 11:12:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-21 11:12:03,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:03,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:03,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:12:03,756 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:03,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1176700131, now seen corresponding path program 1 times [2023-12-21 11:12:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:03,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440799610] [2023-12-21 11:12:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440799610] [2023-12-21 11:12:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440799610] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167584525] [2023-12-21 11:12:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:03,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:03,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:03,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 11:12:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:03,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:03,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:04,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167584525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-21 11:12:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192617394] [2023-12-21 11:12:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:04,014 INFO L87 Difference]: Start difference. First operand 4075 states and 5701 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:04,186 INFO L93 Difference]: Finished difference Result 5218 states and 7290 transitions. [2023-12-21 11:12:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:04,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-21 11:12:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:04,194 INFO L225 Difference]: With dead ends: 5218 [2023-12-21 11:12:04,194 INFO L226 Difference]: Without dead ends: 5214 [2023-12-21 11:12:04,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:04,196 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 219 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:04,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 727 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2023-12-21 11:12:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 5076. [2023-12-21 11:12:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5070 states have (on average 1.4041420118343195) internal successors, (7119), 5074 states have internal predecessors, (7119), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7124 transitions. [2023-12-21 11:12:04,363 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7124 transitions. Word has length 97 [2023-12-21 11:12:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:04,363 INFO L495 AbstractCegarLoop]: Abstraction has 5076 states and 7124 transitions. [2023-12-21 11:12:04,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7124 transitions. [2023-12-21 11:12:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-21 11:12:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:04,366 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:04,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 11:12:04,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 11:12:04,571 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:04,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1885042639, now seen corresponding path program 1 times [2023-12-21 11:12:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872509620] [2023-12-21 11:12:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:12:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872509620] [2023-12-21 11:12:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872509620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365432747] [2023-12-21 11:12:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:04,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:04,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 11:12:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:04,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:04,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:04,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365432747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-21 11:12:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266440083] [2023-12-21 11:12:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:04,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:04,821 INFO L87 Difference]: Start difference. First operand 5076 states and 7124 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:04,949 INFO L93 Difference]: Finished difference Result 9020 states and 12726 transitions. [2023-12-21 11:12:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-12-21 11:12:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:04,955 INFO L225 Difference]: With dead ends: 9020 [2023-12-21 11:12:04,955 INFO L226 Difference]: Without dead ends: 3955 [2023-12-21 11:12:04,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:04,960 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 249 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:04,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 384 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2023-12-21 11:12:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3620. [2023-12-21 11:12:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3614 states have (on average 1.3824017708909795) internal successors, (4996), 3618 states have internal predecessors, (4996), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5001 transitions. [2023-12-21 11:12:05,055 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5001 transitions. Word has length 149 [2023-12-21 11:12:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:05,055 INFO L495 AbstractCegarLoop]: Abstraction has 3620 states and 5001 transitions. [2023-12-21 11:12:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5001 transitions. [2023-12-21 11:12:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-21 11:12:05,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:05,057 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:05,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:05,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-21 11:12:05,262 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:05,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1521318299, now seen corresponding path program 1 times [2023-12-21 11:12:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286254782] [2023-12-21 11:12:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286254782] [2023-12-21 11:12:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286254782] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279204172] [2023-12-21 11:12:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:05,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:05,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:05,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 11:12:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:05,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:05,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 11:12:05,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279204172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:12:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668698916] [2023-12-21 11:12:05,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:05,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:05,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:05,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:05,520 INFO L87 Difference]: Start difference. First operand 3620 states and 5001 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:05,635 INFO L93 Difference]: Finished difference Result 7077 states and 9824 transitions. [2023-12-21 11:12:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2023-12-21 11:12:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:05,640 INFO L225 Difference]: With dead ends: 7077 [2023-12-21 11:12:05,640 INFO L226 Difference]: Without dead ends: 3620 [2023-12-21 11:12:05,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:05,644 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 259 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:05,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 356 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2023-12-21 11:12:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3620. [2023-12-21 11:12:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3614 states have (on average 1.3436635307138904) internal successors, (4856), 3618 states have internal predecessors, (4856), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 4861 transitions. [2023-12-21 11:12:05,733 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 4861 transitions. Word has length 152 [2023-12-21 11:12:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:05,733 INFO L495 AbstractCegarLoop]: Abstraction has 3620 states and 4861 transitions. [2023-12-21 11:12:05,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 4861 transitions. [2023-12-21 11:12:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 11:12:05,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:05,735 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:05,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 11:12:05,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 11:12:05,940 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:05,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1599015156, now seen corresponding path program 1 times [2023-12-21 11:12:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828128049] [2023-12-21 11:12:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828128049] [2023-12-21 11:12:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828128049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279936692] [2023-12-21 11:12:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:06,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:06,028 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-12-21 11:12:06,058 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-12-21 11:12:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:06,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:12:06,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 11:12:06,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279936692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:06,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:12:06,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766005627] [2023-12-21 11:12:06,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:06,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:06,147 INFO L87 Difference]: Start difference. First operand 3620 states and 4861 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:06,418 INFO L93 Difference]: Finished difference Result 8366 states and 11409 transitions. [2023-12-21 11:12:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-21 11:12:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:06,425 INFO L225 Difference]: With dead ends: 8366 [2023-12-21 11:12:06,425 INFO L226 Difference]: Without dead ends: 4909 [2023-12-21 11:12:06,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:12:06,428 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 194 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:06,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 588 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:12:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2023-12-21 11:12:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4581. [2023-12-21 11:12:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4575 states have (on average 1.3077595628415302) internal successors, (5983), 4579 states have internal predecessors, (5983), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 5988 transitions. [2023-12-21 11:12:06,529 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 5988 transitions. Word has length 153 [2023-12-21 11:12:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 5988 transitions. [2023-12-21 11:12:06,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 5988 transitions. [2023-12-21 11:12:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 11:12:06,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:06,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:06,546 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-12-21 11:12:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:06,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:06,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1388898480, now seen corresponding path program 1 times [2023-12-21 11:12:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958034116] [2023-12-21 11:12:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958034116] [2023-12-21 11:12:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958034116] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378170243] [2023-12-21 11:12:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:06,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:06,957 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-12-21 11:12:06,990 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-12-21 11:12:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:07,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 11:12:07,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:07,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:12:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378170243] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:07,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:07,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2023-12-21 11:12:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165312291] [2023-12-21 11:12:07,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:07,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:12:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:12:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:12:07,274 INFO L87 Difference]: Start difference. First operand 4581 states and 5988 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:07,641 INFO L93 Difference]: Finished difference Result 12852 states and 16813 transitions. [2023-12-21 11:12:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 11:12:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2023-12-21 11:12:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:07,652 INFO L225 Difference]: With dead ends: 12852 [2023-12-21 11:12:07,652 INFO L226 Difference]: Without dead ends: 8434 [2023-12-21 11:12:07,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:12:07,657 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 896 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:07,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 3633 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8434 states. [2023-12-21 11:12:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8434 to 7125. [2023-12-21 11:12:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7125 states, 7119 states have (on average 1.3215339233038348) internal successors, (9408), 7123 states have internal predecessors, (9408), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7125 states to 7125 states and 9413 transitions. [2023-12-21 11:12:07,841 INFO L78 Accepts]: Start accepts. Automaton has 7125 states and 9413 transitions. Word has length 155 [2023-12-21 11:12:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:07,841 INFO L495 AbstractCegarLoop]: Abstraction has 7125 states and 9413 transitions. [2023-12-21 11:12:07,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7125 states and 9413 transitions. [2023-12-21 11:12:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-12-21 11:12:07,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:07,844 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:07,850 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-12-21 11:12:08,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:08,049 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:08,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1486402490, now seen corresponding path program 1 times [2023-12-21 11:12:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897830166] [2023-12-21 11:12:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 12 proven. 185 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897830166] [2023-12-21 11:12:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897830166] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139186457] [2023-12-21 11:12:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:08,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 11:12:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:08,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 11:12:08,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 10 proven. 187 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:08,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 10 proven. 187 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:12:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139186457] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:08,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:08,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2023-12-21 11:12:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350299551] [2023-12-21 11:12:08,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:08,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 11:12:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 11:12:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-21 11:12:08,929 INFO L87 Difference]: Start difference. First operand 7125 states and 9413 transitions. Second operand has 14 states, 14 states have (on average 24.285714285714285) internal successors, (340), 14 states have internal predecessors, (340), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:09,636 INFO L93 Difference]: Finished difference Result 18430 states and 24178 transitions. [2023-12-21 11:12:09,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 11:12:09,636 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 24.285714285714285) internal successors, (340), 14 states have internal predecessors, (340), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2023-12-21 11:12:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:09,651 INFO L225 Difference]: With dead ends: 18430 [2023-12-21 11:12:09,651 INFO L226 Difference]: Without dead ends: 11468 [2023-12-21 11:12:09,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 11:12:09,661 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 3077 mSDsluCounter, 6867 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3077 SdHoareTripleChecker+Valid, 7840 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:09,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3077 Valid, 7840 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:12:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2023-12-21 11:12:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 9178. [2023-12-21 11:12:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9178 states, 9172 states have (on average 1.327845617095508) internal successors, (12179), 9176 states have internal predecessors, (12179), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 12184 transitions. [2023-12-21 11:12:09,978 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 12184 transitions. Word has length 250 [2023-12-21 11:12:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:09,979 INFO L495 AbstractCegarLoop]: Abstraction has 9178 states and 12184 transitions. [2023-12-21 11:12:09,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.285714285714285) internal successors, (340), 14 states have internal predecessors, (340), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 12184 transitions. [2023-12-21 11:12:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2023-12-21 11:12:09,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:09,983 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:10,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:10,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:10,188 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:10,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1990293476, now seen corresponding path program 1 times [2023-12-21 11:12:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:10,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475483996] [2023-12-21 11:12:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2023-12-21 11:12:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475483996] [2023-12-21 11:12:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475483996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:12:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186492541] [2023-12-21 11:12:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:10,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:12:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:12:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:10,260 INFO L87 Difference]: Start difference. First operand 9178 states and 12184 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:10,388 INFO L93 Difference]: Finished difference Result 10362 states and 13536 transitions. [2023-12-21 11:12:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:12:10,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2023-12-21 11:12:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:10,391 INFO L225 Difference]: With dead ends: 10362 [2023-12-21 11:12:10,391 INFO L226 Difference]: Without dead ends: 1243 [2023-12-21 11:12:10,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:12:10,396 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 128 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:10,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 352 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-12-21 11:12:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 880. [2023-12-21 11:12:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 876 states have (on average 1.0787671232876712) internal successors, (945), 878 states have internal predecessors, (945), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 948 transitions. [2023-12-21 11:12:10,423 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 948 transitions. Word has length 347 [2023-12-21 11:12:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:10,424 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 948 transitions. [2023-12-21 11:12:10,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 948 transitions. [2023-12-21 11:12:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2023-12-21 11:12:10,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:10,427 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:10,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:12:10,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:10,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 553876542, now seen corresponding path program 1 times [2023-12-21 11:12:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287179195] [2023-12-21 11:12:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2023-12-21 11:12:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287179195] [2023-12-21 11:12:10,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287179195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:10,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:10,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:12:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194101403] [2023-12-21 11:12:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:12:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:12:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:12:10,575 INFO L87 Difference]: Start difference. First operand 880 states and 948 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:10,679 INFO L93 Difference]: Finished difference Result 1263 states and 1377 transitions. [2023-12-21 11:12:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:12:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2023-12-21 11:12:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:10,681 INFO L225 Difference]: With dead ends: 1263 [2023-12-21 11:12:10,681 INFO L226 Difference]: Without dead ends: 1071 [2023-12-21 11:12:10,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 11:12:10,681 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 219 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:10,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1376 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-21 11:12:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 943. [2023-12-21 11:12:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 939 states have (on average 1.0809371671991481) internal successors, (1015), 941 states have internal predecessors, (1015), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1018 transitions. [2023-12-21 11:12:10,709 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1018 transitions. Word has length 348 [2023-12-21 11:12:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:10,710 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1018 transitions. [2023-12-21 11:12:10,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1018 transitions. [2023-12-21 11:12:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2023-12-21 11:12:10,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:10,713 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:10,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 11:12:10,713 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:10,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1368057438, now seen corresponding path program 1 times [2023-12-21 11:12:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219870848] [2023-12-21 11:12:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2023-12-21 11:12:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219870848] [2023-12-21 11:12:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219870848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:12:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:12:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088913259] [2023-12-21 11:12:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:10,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:12:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:10,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:12:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:12:10,839 INFO L87 Difference]: Start difference. First operand 943 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:10,904 INFO L93 Difference]: Finished difference Result 1130 states and 1222 transitions. [2023-12-21 11:12:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:12:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2023-12-21 11:12:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:10,906 INFO L225 Difference]: With dead ends: 1130 [2023-12-21 11:12:10,906 INFO L226 Difference]: Without dead ends: 938 [2023-12-21 11:12:10,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:12:10,907 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 174 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 780 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:12:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2023-12-21 11:12:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 932. [2023-12-21 11:12:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 929 states have (on average 1.068891280947255) internal successors, (993), 930 states have internal predecessors, (993), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 995 transitions. [2023-12-21 11:12:10,937 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 995 transitions. Word has length 349 [2023-12-21 11:12:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:10,937 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 995 transitions. [2023-12-21 11:12:10,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 995 transitions. [2023-12-21 11:12:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2023-12-21 11:12:10,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:10,941 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 11:12:10,941 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:10,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash -898019086, now seen corresponding path program 1 times [2023-12-21 11:12:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869007853] [2023-12-21 11:12:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 64 proven. 220 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-12-21 11:12:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869007853] [2023-12-21 11:12:11,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869007853] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478766586] [2023-12-21 11:12:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:11,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:11,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:11,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 11:12:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:11,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 11:12:11,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2023-12-21 11:12:12,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 20 proven. 232 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2023-12-21 11:12:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478766586] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:12,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:12,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 28 [2023-12-21 11:12:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494316885] [2023-12-21 11:12:12,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 11:12:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 11:12:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-12-21 11:12:12,821 INFO L87 Difference]: Start difference. First operand 932 states and 995 transitions. Second operand has 28 states, 28 states have (on average 14.0) internal successors, (392), 28 states have internal predecessors, (392), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:13,339 INFO L93 Difference]: Finished difference Result 1059 states and 1126 transitions. [2023-12-21 11:12:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 11:12:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.0) internal successors, (392), 28 states have internal predecessors, (392), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2023-12-21 11:12:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:13,341 INFO L225 Difference]: With dead ends: 1059 [2023-12-21 11:12:13,342 INFO L226 Difference]: Without dead ends: 1056 [2023-12-21 11:12:13,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1684, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 11:12:13,343 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 653 mSDsluCounter, 6007 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 6365 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:13,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 6365 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:12:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2023-12-21 11:12:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1026. [2023-12-21 11:12:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1023 states have (on average 1.0664711632453567) internal successors, (1091), 1024 states have internal predecessors, (1091), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1093 transitions. [2023-12-21 11:12:13,375 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1093 transitions. Word has length 404 [2023-12-21 11:12:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:13,375 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1093 transitions. [2023-12-21 11:12:13,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.0) internal successors, (392), 28 states have internal predecessors, (392), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1093 transitions. [2023-12-21 11:12:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2023-12-21 11:12:13,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:13,379 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 11:12:13,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:13,586 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:13,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -835962693, now seen corresponding path program 1 times [2023-12-21 11:12:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142404481] [2023-12-21 11:12:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2023-12-21 11:12:13,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:13,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142404481] [2023-12-21 11:12:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142404481] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:13,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183318731] [2023-12-21 11:12:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:13,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:13,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 11:12:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:14,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 11:12:14,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2023-12-21 11:12:14,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2023-12-21 11:12:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183318731] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:14,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2023-12-21 11:12:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991481259] [2023-12-21 11:12:14,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:12:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:12:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:12:14,323 INFO L87 Difference]: Start difference. First operand 1026 states and 1093 transitions. Second operand has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:14,493 INFO L93 Difference]: Finished difference Result 1404 states and 1499 transitions. [2023-12-21 11:12:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 11:12:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 449 [2023-12-21 11:12:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:14,495 INFO L225 Difference]: With dead ends: 1404 [2023-12-21 11:12:14,495 INFO L226 Difference]: Without dead ends: 1223 [2023-12-21 11:12:14,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-21 11:12:14,496 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 391 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:14,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2315 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2023-12-21 11:12:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1107. [2023-12-21 11:12:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1104 states have (on average 1.0661231884057971) internal successors, (1177), 1105 states have internal predecessors, (1177), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1179 transitions. [2023-12-21 11:12:14,527 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1179 transitions. Word has length 449 [2023-12-21 11:12:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:14,528 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1179 transitions. [2023-12-21 11:12:14,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1179 transitions. [2023-12-21 11:12:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2023-12-21 11:12:14,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:14,532 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:14,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:14,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-21 11:12:14,739 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:14,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash -562440443, now seen corresponding path program 1 times [2023-12-21 11:12:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317965403] [2023-12-21 11:12:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 123 proven. 550 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-21 11:12:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317965403] [2023-12-21 11:12:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317965403] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270078507] [2023-12-21 11:12:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:15,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:15,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:15,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 11:12:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:15,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-21 11:12:15,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 162 proven. 494 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 11:12:16,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 25 proven. 631 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 11:12:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270078507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:16,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 32 [2023-12-21 11:12:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98275041] [2023-12-21 11:12:16,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:16,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 11:12:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 11:12:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2023-12-21 11:12:16,869 INFO L87 Difference]: Start difference. First operand 1107 states and 1179 transitions. Second operand has 32 states, 32 states have (on average 20.8125) internal successors, (666), 32 states have internal predecessors, (666), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:17,600 INFO L93 Difference]: Finished difference Result 1239 states and 1315 transitions. [2023-12-21 11:12:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 11:12:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 20.8125) internal successors, (666), 32 states have internal predecessors, (666), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 506 [2023-12-21 11:12:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:17,605 INFO L225 Difference]: With dead ends: 1239 [2023-12-21 11:12:17,605 INFO L226 Difference]: Without dead ends: 1236 [2023-12-21 11:12:17,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=2693, Unknown=0, NotChecked=0, Total=2970 [2023-12-21 11:12:17,612 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 862 mSDsluCounter, 11368 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 11919 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:17,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 11919 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:12:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-12-21 11:12:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1201. [2023-12-21 11:12:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1198 states have (on average 1.0642737896494157) internal successors, (1275), 1199 states have internal predecessors, (1275), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1277 transitions. [2023-12-21 11:12:17,689 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1277 transitions. Word has length 506 [2023-12-21 11:12:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:17,690 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 1277 transitions. [2023-12-21 11:12:17,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 20.8125) internal successors, (666), 32 states have internal predecessors, (666), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1277 transitions. [2023-12-21 11:12:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2023-12-21 11:12:17,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:17,694 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:17,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:17,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-21 11:12:17,900 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:17,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1842547320, now seen corresponding path program 1 times [2023-12-21 11:12:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694003539] [2023-12-21 11:12:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 25 proven. 747 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-21 11:12:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694003539] [2023-12-21 11:12:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694003539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116312233] [2023-12-21 11:12:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:18,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:18,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 11:12:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:18,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 11:12:18,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 343 proven. 200 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2023-12-21 11:12:19,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 343 proven. 200 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2023-12-21 11:12:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116312233] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:19,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 26 [2023-12-21 11:12:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711578185] [2023-12-21 11:12:19,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:19,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 11:12:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 11:12:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2023-12-21 11:12:19,381 INFO L87 Difference]: Start difference. First operand 1201 states and 1277 transitions. Second operand has 26 states, 26 states have (on average 28.53846153846154) internal successors, (742), 26 states have internal predecessors, (742), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:20,725 INFO L93 Difference]: Finished difference Result 1890 states and 2010 transitions. [2023-12-21 11:12:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-21 11:12:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 28.53846153846154) internal successors, (742), 26 states have internal predecessors, (742), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 551 [2023-12-21 11:12:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:20,729 INFO L225 Difference]: With dead ends: 1890 [2023-12-21 11:12:20,729 INFO L226 Difference]: Without dead ends: 1709 [2023-12-21 11:12:20,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1198 GetRequests, 1117 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=628, Invalid=6178, Unknown=0, NotChecked=0, Total=6806 [2023-12-21 11:12:20,731 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 1741 mSDsluCounter, 11474 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 12115 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:20,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 12115 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 11:12:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2023-12-21 11:12:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1378. [2023-12-21 11:12:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1375 states have (on average 1.0632727272727274) internal successors, (1462), 1376 states have internal predecessors, (1462), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1464 transitions. [2023-12-21 11:12:20,798 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1464 transitions. Word has length 551 [2023-12-21 11:12:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:20,799 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1464 transitions. [2023-12-21 11:12:20,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 28.53846153846154) internal successors, (742), 26 states have internal predecessors, (742), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1464 transitions. [2023-12-21 11:12:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2023-12-21 11:12:20,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:20,803 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:20,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-21 11:12:21,011 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:21,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 439474753, now seen corresponding path program 1 times [2023-12-21 11:12:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743139382] [2023-12-21 11:12:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 82 proven. 988 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:12:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743139382] [2023-12-21 11:12:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743139382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036216798] [2023-12-21 11:12:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:22,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:22,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 11:12:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:22,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-21 11:12:22,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 169 proven. 901 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:12:23,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:12:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 30 proven. 1040 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:12:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036216798] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:12:24,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:12:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 38 [2023-12-21 11:12:24,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8650953] [2023-12-21 11:12:24,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:12:24,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 11:12:24,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:24,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 11:12:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 11:12:24,108 INFO L87 Difference]: Start difference. First operand 1378 states and 1464 transitions. Second operand has 38 states, 38 states have (on average 24.236842105263158) internal successors, (921), 38 states have internal predecessors, (921), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:25,257 INFO L93 Difference]: Finished difference Result 2573 states and 2726 transitions. [2023-12-21 11:12:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-21 11:12:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 24.236842105263158) internal successors, (921), 38 states have internal predecessors, (921), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 609 [2023-12-21 11:12:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:25,261 INFO L225 Difference]: With dead ends: 2573 [2023-12-21 11:12:25,261 INFO L226 Difference]: Without dead ends: 2570 [2023-12-21 11:12:25,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=4727, Unknown=0, NotChecked=0, Total=5112 [2023-12-21 11:12:25,263 INFO L413 NwaCegarLoop]: 778 mSDtfsCounter, 1444 mSDsluCounter, 19286 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 20064 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 20064 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 11:12:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2023-12-21 11:12:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2074. [2023-12-21 11:12:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2071 states have (on average 1.0598744567841623) internal successors, (2195), 2072 states have internal predecessors, (2195), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2197 transitions. [2023-12-21 11:12:25,365 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2197 transitions. Word has length 609 [2023-12-21 11:12:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:25,365 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2197 transitions. [2023-12-21 11:12:25,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 24.236842105263158) internal successors, (921), 38 states have internal predecessors, (921), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2197 transitions. [2023-12-21 11:12:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2023-12-21 11:12:25,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:12:25,370 INFO L195 NwaCegarLoop]: trace histogram [13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:12:25,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-21 11:12:25,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-21 11:12:25,577 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:12:25,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:12:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -534576180, now seen corresponding path program 1 times [2023-12-21 11:12:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:12:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853433176] [2023-12-21 11:12:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:12:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 229 proven. 916 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-21 11:12:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:12:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853433176] [2023-12-21 11:12:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853433176] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:12:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501550909] [2023-12-21 11:12:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:12:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:12:26,303 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:12:26,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 11:12:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:12:26,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 11:12:26,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:12:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-12-21 11:12:26,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:12:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501550909] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:12:26,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:12:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 24 [2023-12-21 11:12:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985006742] [2023-12-21 11:12:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:12:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:12:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:12:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:12:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2023-12-21 11:12:26,830 INFO L87 Difference]: Start difference. First operand 2074 states and 2197 transitions. Second operand has 9 states, 9 states have (on average 51.44444444444444) internal successors, (463), 9 states have internal predecessors, (463), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:12:26,994 INFO L93 Difference]: Finished difference Result 2087 states and 2210 transitions. [2023-12-21 11:12:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 11:12:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 51.44444444444444) internal successors, (463), 9 states have internal predecessors, (463), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 654 [2023-12-21 11:12:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:12:26,997 INFO L225 Difference]: With dead ends: 2087 [2023-12-21 11:12:26,997 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 11:12:26,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2023-12-21 11:12:26,999 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 587 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:12:26,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1710 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:12:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 11:12:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 11:12:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-12-21 11:12:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 11:12:27,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 654 [2023-12-21 11:12:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:12:27,000 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 11:12:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 51.44444444444444) internal successors, (463), 9 states have internal predecessors, (463), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:12:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 11:12:27,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 11:12:27,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:12:27,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 11:12:27,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:12:27,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 11:12:39,586 WARN L293 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 274 DAG size of output: 344 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:12:58,030 WARN L293 SmtUtils]: Spent 17.42s on a formula simplification. DAG size of input: 342 DAG size of output: 428 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:23:01,148 WARN L293 SmtUtils]: Spent 10.05m on a formula simplification. DAG size of input: 281 DAG size of output: 303 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:23:28,284 WARN L293 SmtUtils]: Spent 25.32s on a formula simplification. DAG size of input: 259 DAG size of output: 261 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point L828(lines 820 837) no Hoare annotation was computed. [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 774 818) no Hoare annotation was computed. [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point $Ultimate##648(lines 1335 1343) no Hoare annotation was computed. [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point L1225(lines 1225 1229) no Hoare annotation was computed. [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point L1159(lines 1159 1166) no Hoare annotation was computed. [2023-12-21 11:23:39,361 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 782 817) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L961(lines 886 1116) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 833) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 790 816) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 966) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 798 815) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 861 1122) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 806 814) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L567(lines 537 568) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 374 382) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 828 836) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L766(lines 766 819) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 771) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1281 1325) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 705) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1289 1324) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L1098(lines 1098 1102) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1297 1323) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L636(lines 628 645) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 95 854) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##630(lines 1305 1322) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1313 1321) no Hoare annotation was computed. [2023-12-21 11:23:39,362 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 641) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L895 garLoopResultBuilder]: At program point L505-2(lines 505 533) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~s_memory2~0 52)) (.cse2 (= ~c_req_type~0 0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse6 (not (= ~c_m_lock~0 1))) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ~s_memory1~0 51))) (or (let ((.cse4 (+ ~req_tt_a~0 50))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 ~c_rsp_d~0) .cse5 .cse6 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 2) .cse7 .cse8 (<= .cse4 ~s_memory1~0) (= ~a_t~0 1) .cse9 .cse10 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse1 .cse3 .cse5 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) (= 52 ~c_req_d~0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse13 .cse14 (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 .cse3 (<= ~req_tt_a~0 0) .cse5 .cse6 .cse7 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~a_t~0 0) .cse13 .cse14 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1302) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 245) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1180 1359) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L506(lines 505 533) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L374(lines 144 490) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L1233(lines 1233 1237) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1010 1037) no Hoare annotation was computed. [2023-12-21 11:23:39,363 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 627) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 140) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 845) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L839-1(lines 839 845) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 579) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L1105(lines 1097 1114) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L895 garLoopResultBuilder]: At program point L841(line 841) the Hoare annotation is: false [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L775(lines 775 779) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 713) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 139) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L1106(lines 1106 1110) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L1306(lines 1306 1310) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 253) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 980) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L184(lines 154 185) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 138) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L1043(lines 1043 1096) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-12-21 11:23:39,364 INFO L899 garLoopResultBuilder]: For program point L1044(lines 1044 1048) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L895 garLoopResultBuilder]: At program point L648-2(lines 648 676) the Hoare annotation is: (let ((.cse19 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse11 (<= 2 |ULTIMATE.start_m_run_~a~0#1|)) (.cse12 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 2)) (.cse16 (= ~req_tt_a~0 2)) (.cse26 (= 2 ~c_req_a~0)) (.cse18 (<= 2 ~a_t~0)) (.cse21 (= ~a_t~0 0)) (.cse20 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse2 (<= 1 ~a_t~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse14 (= ~c_empty_req~0 1)) (.cse7 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse9 (= ~s_memory2~0 52)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse27 (= ~c_req_a~0 1)) (.cse22 (= ~req_tt_a~0 1)) (.cse13 (= ~s_memory0~0 50)) (.cse23 (= |ULTIMATE.start_m_run_~a~0#1| 1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse24 (= ~a_t~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse17 (= ~s_memory1~0 51)) (.cse25 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 (= 52 ~c_rsp_d~0) .cse1 .cse3 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse8 .cse16 .cse17 .cse18) (and .cse9 .cse10 .cse0 (= ~c_req_a~0 0) .cse1 .cse19 .cse13 .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse20 .cse8 .cse17) (and .cse9 .cse10 .cse0 .cse1 (= ~c_rsp_d~0 50) .cse3 .cse19 (= ~req_tt_a~0 0) .cse13 .cse4 .cse14 .cse5 .cse15 .cse21 .cse20 .cse8 .cse17) (and .cse9 .cse10 .cse0 .cse1 (= 51 ~c_rsp_d~0) .cse3 .cse22 .cse13 .cse23 .cse4 .cse24 .cse14 .cse5 .cse15 .cse8 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse21 .cse20 .cse8) (and .cse9 .cse10 .cse0 .cse1 .cse12 .cse13 .cse4 (<= (+ ~req_tt_a~0 50) ~s_memory1~0) .cse24 .cse5 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse6 .cse15 .cse8 .cse17 .cse26) (and .cse9 .cse10 .cse0 .cse1 .cse11 .cse12 .cse13 .cse4 .cse5 .cse6 .cse15 .cse8 .cse16 .cse17 .cse26 .cse18) (and .cse0 .cse1 .cse3 .cse23 .cse4 .cse5 .cse6 .cse21 .cse8) (and .cse9 .cse10 .cse0 .cse1 (<= (+ 51 ~req_tt_a~0) ~s_memory1~0) .cse27 .cse13 .cse23 .cse4 .cse5 .cse6 .cse15 .cse21 .cse8 .cse17 .cse25) (and .cse15 (let ((.cse28 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse3 .cse28 .cse4 .cse14 .cse5 .cse6 .cse21 .cse20 .cse8) (and .cse0 .cse2 .cse3 .cse28 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8)))) (and .cse9 .cse10 .cse0 .cse1 .cse27 .cse22 .cse13 .cse23 .cse4 .cse24 .cse5 .cse6 .cse15 .cse8 .cse17 .cse25))) [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L649(lines 648 676) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 587) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 137) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L914(lines 888 915) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L895 garLoopResultBuilder]: At program point L188-2(lines 188 216) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse10 (= ~s_memory0~0 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse16 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse0 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse18 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse14 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse10 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse11 .cse12 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)) (and .cse16 .cse8 .cse17 .cse9 .cse0 .cse2 .cse18 .cse12 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7) (and (= 2 |ULTIMATE.start_m_run_~req_a~0#1|) .cse8 .cse9 .cse1 .cse10 .cse11 .cse12 (= ~a_t~0 1) (= 52 |ULTIMATE.start_m_run_~req_d~0#1|) .cse3 .cse4 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse5 .cse13 .cse15 (= ~s_memory1~0 51)) (and .cse16 .cse8 .cse17 .cse9 .cse0 .cse1 .cse18 .cse11 .cse12 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7))) [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 787) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 721) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 582 626) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 216) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L1313(lines 1265 1354) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1251) no Hoare annotation was computed. [2023-12-21 11:23:39,365 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 136) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L983(lines 975 992) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L1314(lines 1314 1318) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 261) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1186) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L1182-2(lines 1180 1359) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L984(lines 984 988) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L456(lines 144 490) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L457(lines 457 461) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 945 971) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 456 464) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L1052(lines 1052 1056) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 478 486) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L921(lines 921 974) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 595) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L327(lines 297 328) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 926) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L724(lines 495 847) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L1187-1(lines 1180 1359) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 134) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L791(lines 791 795) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 729) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 396 404) no Hoare annotation was computed. [2023-12-21 11:23:39,366 INFO L899 garLoopResultBuilder]: For program point L396(lines 388 405) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L264(lines 144 490) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L1255(lines 1255 1259) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 424 468) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 401) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 269) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 432 467) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 440 466) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 929 973) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 937 972) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 75) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 448 465) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1064) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 387) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L1193(lines 1193 1197) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1009) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 590 625) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 598 624) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L930(lines 930 934) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 606 623) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point L534(lines 504 535) no Hoare annotation was computed. [2023-12-21 11:23:39,367 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1051 1095) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 614 622) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L799(lines 799 803) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1129 1170) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 953 970) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 961 969) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 475) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L141(lines 111 853) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: false [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 68 75) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 983 991) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L895 garLoopResultBuilder]: At program point L538-2(lines 538 566) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse12 (= ~m_run_pc~0 6)) (.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~s_memory2~0 52)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ~s_memory1~0 51))) (or (let ((.cse5 (+ ~req_tt_a~0 50))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 ~c_rsp_d~0) .cse6 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 2) .cse7 .cse8 (<= .cse5 ~s_memory1~0) (= ~a_t~0 1) .cse9 .cse10 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~req_tt_a~0 0) .cse6 .cse7 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~a_t~0 0) .cse13 .cse14 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) (= 52 ~c_req_d~0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse13 .cse14 (<= 2 ~a_t~0)))) [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L1001(lines 1001 1008) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L539(lines 538 566) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 413) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 407 413) no Hoare annotation was computed. [2023-12-21 11:23:39,368 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1138) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1134-1(lines 1129 1170) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1201(lines 1201 1205) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L895 garLoopResultBuilder]: At program point L144-2(lines 144 490) the Hoare annotation is: (let ((.cse14 (= ~s_run_pc~0 0)) (.cse3 (= ~s_memory0~0 50)) (.cse8 (= ~m_run_pc~0 3)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~a_t~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse16 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~c_req_d~0 50)) (and (= ~s_memory2~0 52) .cse0 .cse1 .cse2 .cse3 (<= 3 |ULTIMATE.start_m_run_~a~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 (= 52 ~c_req_d~0) .cse10 .cse11 (<= 2 ~a_t~0)) (and .cse12 .cse0 .cse13 .cse14 .cse2 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse16) (and .cse1 .cse14 .cse2 .cse5 .cse6 .cse7 .cse15 .cse16) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 1) .cse5 .cse6 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse7 .cse8 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse16))) [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L871(lines 871 883) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L739(lines 739 743) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 611) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L895 garLoopResultBuilder]: At program point L409(line 409) the Hoare annotation is: false [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L145(lines 144 490) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L938(lines 938 942) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L806(lines 495 847) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1335(lines 1265 1354) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L807(lines 807 811) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1336(lines 1336 1340) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L279(lines 279 283) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 882) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L478(lines 470 487) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 89) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L677(lines 647 678) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 483) no Hoare annotation was computed. [2023-12-21 11:23:39,369 INFO L899 garLoopResultBuilder]: For program point L1140(lines 1129 1170) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1273(lines 1273 1326) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 89) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L877(lines 877 881) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1278) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L217(lines 187 218) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 1080) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L746(lines 738 755) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L614(lines 495 847) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 469) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1209(lines 1209 1213) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1177 1360) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 89) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L895 garLoopResultBuilder]: At program point L1011-1(lines 1011 1035) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse10 (= ~a_t~0 0)) (.cse17 (= ~c_req_d~0 50)) (.cse14 (= ~a_t~0 1)) (.cse1 (= ~c_req_type~0 0)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse0 (= ~s_memory2~0 52)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51)) (.cse18 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~req_tt_a~0 0) .cse4 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15 .cse12 .cse13) (and .cse2 .cse3 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse4 .cse6 .cse16 .cse7 .cse8 .cse15 .cse10 .cse12 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse15 .cse10 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 52) .cse7 .cse8 .cse9 .cse11 .cse12 (= ~req_tt_a~0 2) .cse13 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 (= 52 |ULTIMATE.start_s_run_~req_d~1#1|) (= 52 ~c_req_d~0) .cse12 .cse13 .cse18))) [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 751) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 619) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1151) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1011 1035) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L946(lines 946 950) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L286(lines 278 295) no Hoare annotation was computed. [2023-12-21 11:23:39,370 INFO L899 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L895 garLoopResultBuilder]: At program point L155-2(lines 155 183) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse17 (= ~s_memory0~0 50)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse18 (= ~m_run_pc~0 3)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= 2 |ULTIMATE.start_m_run_~req_a~0#1|) .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 (= ~a_t~0 1) (= 52 |ULTIMATE.start_m_run_~req_d~0#1|) .cse9 .cse10 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse11 .cse18 .cse14 (= ~s_memory1~0 51)) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse16 .cse5 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse1 .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 .cse17 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse14 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-12-21 11:23:39,371 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: false [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 80 92) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 737) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 342 386) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L156(lines 155 183) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 689) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 350 385) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 358 384) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1254 1262) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 366 383) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 277) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L1083(lines 886 1116) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1352) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L895 garLoopResultBuilder]: At program point L1348-1(lines 1265 1354) the Hoare annotation is: (let ((.cse1 (<= 1 ~a_t~0)) (.cse20 (= ~a_t~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse10 (= ~a_t~0 0)) (.cse14 (= ~m_run_pc~0 0)) (.cse13 (= ~c_req_a~0 0)) (.cse19 (= ~s_run_pc~0 0)) (.cse12 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory2~0 52)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_memory0~0 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse18 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~a_t~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= ~m_run_st~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 3))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9)) .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse14) (and .cse15 .cse12 .cse0 .cse16 (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) .cse4 .cse17 .cse5 .cse6 .cse7 .cse11 .cse10 .cse9 .cse18) (and .cse13 .cse2 .cse19 .cse3 .cse6 .cse7 .cse8 .cse14) (and (= 51 ~c_req_d~0) .cse0 .cse16 .cse2 .cse4 .cse17 .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse18) (and .cse0 .cse16 .cse2 .cse4 .cse17 .cse5 .cse6 .cse7 .cse21 .cse10 .cse9 (= ~c_req_d~0 50)) (and (or (and .cse0 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9) (and .cse0 .cse16 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse9)) .cse11) (and .cse15 .cse12 .cse0 .cse16 (= 51 ~c_rsp_d~0) .cse2 (= ~req_tt_a~0 1) .cse4 .cse17 .cse5 .cse20 .cse6 .cse7 .cse11 .cse9 .cse18) (and .cse15 .cse12 .cse0 (= 52 ~c_rsp_d~0) .cse16 .cse2 .cse4 .cse17 .cse5 .cse6 .cse7 .cse11 .cse9 (= ~req_tt_a~0 2) .cse18 .cse22) (and .cse12 .cse0 .cse13 .cse19 .cse3 .cse6 .cse7 .cse8 .cse10 .cse9 .cse14) (and .cse13 .cse2 .cse19 .cse4 .cse7 .cse8 .cse21 (not .cse12)) (and .cse5 .cse6 .cse7 .cse8 .cse21) (and .cse15 .cse0 .cse16 .cse2 .cse4 .cse17 .cse5 .cse6 .cse7 .cse21 (= 52 ~c_req_d~0) .cse9 .cse18 .cse22) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse8 .cse21))) [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L1282(lines 1282 1286) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 229) no Hoare annotation was computed. [2023-12-21 11:23:39,371 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1088) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L895 garLoopResultBuilder]: At program point L886-1(lines 886 1116) the Hoare annotation is: (let ((.cse13 (= ~a_t~0 1)) (.cse12 (<= 2 ~a_t~0)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse0 (= ~s_memory2~0 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse18 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (= 52 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 52) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 2) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= 51 ~c_req_d~0) .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse4 .cse13 .cse6 .cse7 .cse14 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse14 (= 52 |ULTIMATE.start_s_run_~req_d~1#1|) (= 52 ~c_req_d~0) .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse15 .cse16 (not (= ~c_m_lock~0 1)) .cse6 .cse7 .cse17 .cse18 .cse10 (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse14 .cse18 .cse10 .cse19) (and .cse2 .cse15 .cse3 (= ~c_req_type~0 1) .cse16 (= ~s_run_pc~0 0) .cse7 .cse17 .cse14 .cse18 .cse10 .cse19) (and .cse0 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) .cse4 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11))) [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1232 1240) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1224 1241) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 248 274) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 716 733) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 724 732) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1221) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 256 273) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 825) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1216 1242) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L491(lines 143 492) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 264 272) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1208 1243) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point L954(lines 954 958) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 746 754) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1200 1244) no Hoare annotation was computed. [2023-12-21 11:23:39,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 286 294) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L895 garLoopResultBuilder]: At program point L889-1(lines 889 913) the Hoare annotation is: (let ((.cse21 (= 51 ~c_req_d~0)) (.cse11 (= ~req_tt_a~0 2)) (.cse26 (= 52 ~c_req_d~0)) (.cse25 (= 2 ~c_req_a~0)) (.cse13 (<= 2 ~a_t~0)) (.cse18 (= ~c_req_type~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse20 (= ~c_req_d~0 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse22 (= ~c_req_a~0 1)) (.cse24 (= ~req_tt_a~0 1)) (.cse23 (= ~a_t~0 1)) (.cse0 (= ~s_memory2~0 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse27 (= ~req_tt_a~0 0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (= 52 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 52) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse5 .cse6 .cse7 .cse15 .cse16) (and .cse2 .cse17 .cse3 .cse18 .cse14 .cse5 .cse7 .cse15 .cse16 .cse19 .cse10 .cse20) (and .cse21 .cse2 .cse3 .cse18 .cse22 .cse14 .cse4 .cse5 .cse23 .cse7 .cse15 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 51 ~c_rsp_d~0) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) .cse24 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse21 .cse2 .cse3 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse4 .cse23 .cse6 .cse7 .cse16 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse25 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 (= 52 |ULTIMATE.start_s_run_~req_d~1#1|) .cse26 .cse10 .cse12 .cse13) (and .cse1 .cse2 .cse17 .cse14 (not (= ~c_m_lock~0 1)) .cse6 .cse7 .cse15 .cse19 .cse10 (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse18 .cse14 .cse4 .cse5 .cse7 .cse15 .cse16 .cse26 .cse10 .cse12 .cse25 .cse13) (and .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse16 .cse19 .cse10 .cse20) (and .cse2 .cse17 .cse3 .cse18 .cse14 (= ~s_run_pc~0 0) .cse7 .cse15 .cse16 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 50) .cse27 .cse4 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse14 .cse24 .cse4 .cse5 .cse23 .cse7 .cse15 .cse8 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse14 .cse27 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse10 .cse12))) [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 763) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point L757-1(lines 757 763) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1059 1094) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1123 1176) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point L890(lines 889 913) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 636 644) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L895 garLoopResultBuilder]: At program point L1155(lines 1129 1170) the Hoare annotation is: (let ((.cse19 (= ~c_req_a~0 1)) (.cse27 (= ~req_tt_a~0 2)) (.cse9 (= 52 ~c_req_d~0)) (.cse28 (= 2 ~c_req_a~0)) (.cse12 (<= 2 ~a_t~0)) (.cse20 (= ~req_tt_a~0 1)) (.cse26 (= 51 ~c_req_d~0)) (.cse21 (= ~a_t~0 1)) (.cse14 (= ~s_run_pc~0 0)) (.cse0 (= ~s_memory2~0 52)) (.cse30 (= ~req_tt_a~0 0)) (.cse11 (= ~s_memory1~0 51)) (.cse29 (<= 1 ~a_t~0)) (.cse22 (= ~m_run_pc~0 6)) (.cse4 (= ~s_memory0~0 50)) (.cse18 (= ~c_req_type~0 0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse15 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_req~0 1)) (.cse17 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse23 (= ~c_req_type~0 1)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse24 (= ~a_t~0 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse25 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse3 .cse14 .cse15 .cse6 .cse7 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse20 .cse4 .cse5 .cse21 .cse7 .cse16 .cse22 .cse10 .cse11) (and .cse1 .cse13 .cse2 .cse23 .cse14 .cse7 .cse16 .cse8 .cse24 .cse10 .cse25) (and .cse26 .cse1 .cse2 .cse23 .cse19 .cse4 .cse5 .cse21 .cse7 .cse16 .cse8 .cse10) (and .cse0 .cse18 .cse1 (= 52 ~c_rsp_d~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse10 .cse27 .cse11 .cse12) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse7 .cse16 .cse22 .cse10 .cse27 .cse11 .cse28 .cse12) (and .cse1 .cse2 .cse23 .cse4 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12) (and .cse0 .cse18 .cse1 .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse10 .cse11) (and .cse18 .cse1 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse24 .cse10 .cse17) (and .cse5 .cse6 .cse7 .cse16 .cse8) (and .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse5 .cse7 .cse16 .cse8) (and .cse13 .cse3 .cse14 .cse7 .cse16 .cse8 (not .cse18)) (and .cse22 (or (and .cse1 .cse2 .cse29 .cse3 .cse5 .cse7 .cse16 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse7 .cse16 .cse24 .cse10))) (and .cse0 .cse18 .cse1 .cse13 .cse2 .cse30 .cse4 .cse5 .cse7 .cse16 .cse22 .cse24 .cse10 .cse11) (and .cse0 .cse18 .cse1 .cse2 (= ~c_rsp_d~0 50) .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse22 .cse24 .cse10 .cse11) (and (or (and .cse1 .cse29 .cse3 .cse15 .cse5 .cse6 .cse7 .cse16 .cse10) (and .cse1 .cse3 .cse15 .cse5 .cse6 .cse7 .cse16 .cse24 .cse10)) .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse25) (and .cse18 .cse1 .cse13 .cse3 .cse15 .cse5 .cse6 .cse7 .cse16 .cse24 .cse10 .cse17) (and .cse1 .cse13 .cse2 .cse23 .cse5 .cse7 .cse16 .cse8 .cse24 .cse10 .cse25))) [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1067 1093) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L895 garLoopResultBuilder]: At program point L759(line 759) the Hoare annotation is: false [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point L693(lines 693 697) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 847) the Hoare annotation is: (let ((.cse13 (<= 2 ~a_t~0)) (.cse14 (= ~s_memory2~0 52)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| (+ |ULTIMATE.start_m_run_~req_a___0~0#1| 50))) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 |ULTIMATE.start_m_run_~a~0#1|) .cse5 .cse6 .cse7 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0)) .cse8 .cse9 .cse10 (<= (+ 51 |ULTIMATE.start_m_run_~req_a___0~0#1|) (+ ~s_memory1~0 |ULTIMATE.start_m_run_~a~0#1|)) .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~m_run_pc~0 3) (= 52 ~c_req_d~0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_m_run_~req_a___0~0#1| 1) .cse0 .cse1 (<= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~a_t~0 0) .cse11 .cse12) (let ((.cse15 (+ ~req_tt_a~0 50)) (.cse16 (+ 49 |ULTIMATE.start_m_run_~req_a___0~0#1|))) (and .cse14 .cse0 .cse1 (<= .cse15 ~c_rsp_d~0) .cse2 (<= .cse16 ~c_rsp_d~0) .cse3 .cse4 .cse5 (<= .cse15 ~s_memory1~0) (= ~a_t~0 1) .cse6 .cse7 .cse8 (= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse9 .cse10 (<= .cse16 ~s_memory1~0) .cse11 .cse12)))) [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point $Ultimate##580(lines 1075 1092) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1083 1091) no Hoare annotation was computed. [2023-12-21 11:23:39,373 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 847) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L895 garLoopResultBuilder]: At program point L298-2(lines 298 326) the Hoare annotation is: (let ((.cse12 (<= 2 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= 52 ~c_req_d~0)) (.cse8 (= ~a_t~0 1)) (.cse14 (= ~s_memory1~0 51)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (= ~m_run_pc~0 3)) (.cse15 (not (= ~s_run_st~0 0))) (.cse18 (= ~c_req_a~0 0)) (.cse22 (= ~s_run_pc~0 0)) (.cse20 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse21 (= ~c_req_d~0 50)) (.cse0 (= 51 ~c_req_d~0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (= ~c_req_a~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 1)) (.cse7 (= 2 ~s_run_pc~0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (<= 1 ~a_t~0) .cse12 .cse5 .cse7 .cse9 .cse10 .cse13 .cse11 .cse14 (= 2 ~c_req_a~0)) (and (= ~s_memory2~0 52) .cse1 .cse2 .cse15 .cse12 .cse5 .cse7 .cse16 .cse9 .cse17 .cse13 .cse11 .cse14 (<= 2 ~a_t~0)) (and .cse1 .cse18 .cse2 .cse3 .cse7 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21) (and .cse1 .cse15 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse15 .cse5 .cse7 .cse16 .cse9 .cse17 .cse19 .cse20 .cse11 .cse21) (and .cse0 .cse1 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse17 .cse11 .cse14) (and .cse7 .cse16 .cse9 .cse10 .cse17) (and .cse18 .cse15 .cse22 .cse9 .cse10 (not (= ~c_req_type~0 0))) (and .cse1 .cse18 .cse2 .cse3 .cse22 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse11))) [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##598(lines 1105 1113) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 692 736) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point L299(lines 298 326) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 237) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 232 276) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 700 735) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 240 275) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 708 734) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-21 11:23:39,374 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-21 11:23:39,374 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-21 11:23:39,377 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:23:39,378 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:23:39,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:23:39 BoogieIcfgContainer [2023-12-21 11:23:39,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:23:39,414 INFO L158 Benchmark]: Toolchain (without parser) took 703692.59ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 151.3MB in the beginning and 1.0GB in the end (delta: -886.8MB). Peak memory consumption was 765.8MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,414 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 192.9MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:23:39,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.43ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 129.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.52ms. Allocated memory is still 192.9MB. Free memory was 129.8MB in the beginning and 126.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,415 INFO L158 Benchmark]: Boogie Preprocessor took 81.90ms. Allocated memory is still 192.9MB. Free memory was 126.3MB in the beginning and 121.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,415 INFO L158 Benchmark]: RCFGBuilder took 700.84ms. Allocated memory was 192.9MB in the beginning and 286.3MB in the end (delta: 93.3MB). Free memory was 121.7MB in the beginning and 228.7MB in the end (delta: -107.1MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,415 INFO L158 Benchmark]: TraceAbstraction took 702542.90ms. Allocated memory was 286.3MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 228.2MB in the beginning and 1.0GB in the end (delta: -810.0MB). Peak memory consumption was 748.3MB. Max. memory is 8.0GB. [2023-12-21 11:23:39,416 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.08ms. Allocated memory is still 192.9MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.43ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 129.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.52ms. Allocated memory is still 192.9MB. Free memory was 129.8MB in the beginning and 126.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.90ms. Allocated memory is still 192.9MB. Free memory was 126.3MB in the beginning and 121.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 700.84ms. Allocated memory was 192.9MB in the beginning and 286.3MB in the end (delta: 93.3MB). Free memory was 121.7MB in the beginning and 228.7MB in the end (delta: -107.1MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * TraceAbstraction took 702542.90ms. Allocated memory was 286.3MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 228.2MB in the beginning and 1.0GB in the end (delta: -810.0MB). Peak memory consumption was 748.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 251 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 702.5s, OverallIterations: 30, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 672.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18183 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18183 mSDsluCounter, 87357 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73437 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10523 IncrementalHoareTripleChecker+Invalid, 11178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 13920 mSDtfsCounter, 10523 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7510 GetRequests, 7094 SyntacticMatches, 0 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4456 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9743occurred in iteration=13, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 17149 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 140 PreInvPairs, 330 NumberOfFragments, 4896 HoareAnnotationTreeSize, 140 FormulaSimplifications, 66794924 FormulaSimplificationTreeSizeReduction, 664.4s HoareSimplificationTime, 19 FormulaSimplificationsInter, 193017 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 10187 NumberOfCodeBlocks, 10187 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 13062 ConstructedInterpolants, 0 QuantifiedInterpolants, 37552 SizeOfPredicates, 89 NumberOfNonLiveVariables, 12085 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 49 InterpolantComputations, 23 PerfectInterpolantSequences, 7895/16044 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (52 == c_rsp_d)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (rsp_d == 52)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == c_rsp_d)) && (51 == rsp_d)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == req_d)) && (s_memory0 == 50)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 == c_req_a)) && (2 <= a_t))) || ((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (52 == req_d)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 == c_req_a)) && (2 <= a_t))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev)) || (((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (52 == c_rsp_d)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 <= a)) && (req_a___0 == 2)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == c_rsp_d)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (req_a___0 == 2)) && (s_memory0 == 50)) && (2 == s_run_pc)) && ((req_tt_a + 50) <= s_memory1)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 == c_req_a))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (2 <= a)) && (req_a___0 == 2)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 == c_req_a)) && (2 <= a_t))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && ((51 + req_tt_a) <= s_memory1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((m_run_pc == 6) && (((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((2 == req_a) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (a_t == 1)) && (52 == req_d)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (3 <= a)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (rsp_d___0 == (req_a___0 + 50))) && ((51 + req_tt_a) <= (s_memory1 + a_t))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && ((51 + req_a___0) <= (s_memory1 + a))) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t)) || (((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((((((((s_memory2 == 52) && (req_a___0 <= 1)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (req_tt_a <= 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (rsp_d___0 == (req_a___0 + 50))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && ((req_tt_a + 50) <= c_rsp_d)) && !((s_run_st == 0))) && ((49 + req_a___0) <= c_rsp_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && ((req_tt_a + 50) <= s_memory1)) && (a_t == 1)) && (c_empty_req == 1)) && (rsp_d___0 == (req_a___0 + 50))) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && ((49 + req_a___0) <= s_memory1)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && ((req_tt_a + 50) <= c_rsp_d)) && !((s_run_st == 0))) && (req_a___0 == 2)) && (s_memory0 == 50)) && (2 == s_run_pc)) && ((req_tt_a + 50) <= s_memory1)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (req_tt_a <= 0)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (52 == c_rsp_d)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 == c_req_a)) && (2 <= a_t))) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 == c_req_a)) && (2 <= a_t))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == c_rsp_d)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || ((m_run_pc == 6) && (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))))) || ((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) || (((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))) && (m_run_pc == 6))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (a_t == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (2 <= a)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 == c_req_a))) || ((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 <= a)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (51 <= req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))) - InvariantResult [Line: 1011]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == rsp_d)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (rsp_d == 52)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == req_d)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || (((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (3 <= a)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 886]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (52 == c_rsp_d)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (rsp_d == 52)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t)) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == c_rsp_d)) && (51 == rsp_d)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == req_d)) && (s_memory0 == 50)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (52 == req_d)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && ((req_tt_a + 50) <= c_rsp_d)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_a___0 == 2)) && (s_memory0 == 50)) && (2 == s_run_pc)) && ((req_tt_a + 50) <= s_memory1)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (52 == c_req_d)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || ((((((((((((((((((req_type___0 == 0) && (s_memory2 == 52)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (req_tt_a <= 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((2 == req_a) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (a_t == 1)) && (52 == req_d)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (2 == a)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (51 == req_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 1265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))) && (m_run_pc == 6)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev))) && (m_run_pc == 6))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (51 == c_rsp_d)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (a_t == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((s_memory2 == 52) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (52 == c_rsp_d)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (req_tt_a == 2)) && (s_memory1 == 51)) && (2 <= a_t))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((s_memory2 == 52) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (52 == c_req_d)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (2 <= a_t))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) RESULT: Ultimate proved your program to be correct! [2023-12-21 11:23:39,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...