/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 00:46:34,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 00:46:34,698 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-20 00:46:34,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 00:46:34,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 00:46:34,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 00:46:34,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 00:46:34,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 00:46:34,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 00:46:34,715 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 00:46:34,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 00:46:34,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 00:46:34,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 00:46:34,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 00:46:34,717 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 00:46:34,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 00:46:34,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 00:46:34,717 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 00:46:34,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 00:46:34,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 00:46:34,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 00:46:34,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 00:46:34,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 00:46:34,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 00:46:34,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 00:46:34,720 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 00:46:34,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 00:46:34,720 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 00:46:34,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 00:46:34,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 00:46:34,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 00:46:34,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 00:46:34,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:46:34,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 00:46:34,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 00:46:34,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 00:46:34,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 00:46:34,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 00:46:34,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 00:46:34,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 00:46:34,723 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 00:46:34,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 00:46:34,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 00:46:34,724 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 -> true [2023-12-20 00:46:34,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 00:46:34,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 00:46:34,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 00:46:34,930 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 00:46:34,930 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 00:46:34,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2023-12-20 00:46:35,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 00:46:36,059 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 00:46:36,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2023-12-20 00:46:36,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f458d43/b30604cb439148078baa823d1f0baf69/FLAG20660e40c [2023-12-20 00:46:36,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f458d43/b30604cb439148078baa823d1f0baf69 [2023-12-20 00:46:36,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 00:46:36,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 00:46:36,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 00:46:36,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 00:46:36,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 00:46:36,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774154c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36, skipping insertion in model container [2023-12-20 00:46:36,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,129 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 00:46:36,241 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/toy1.cil.c[698,711] [2023-12-20 00:46:36,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:46:36,309 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 00:46:36,318 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/toy1.cil.c[698,711] [2023-12-20 00:46:36,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:46:36,371 INFO L206 MainTranslator]: Completed translation [2023-12-20 00:46:36,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36 WrapperNode [2023-12-20 00:46:36,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 00:46:36,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 00:46:36,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 00:46:36,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 00:46:36,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,415 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 364 [2023-12-20 00:46:36,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 00:46:36,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 00:46:36,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 00:46:36,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 00:46:36,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,452 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-20 00:46:36,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 00:46:36,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 00:46:36,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 00:46:36,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 00:46:36,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (1/1) ... [2023-12-20 00:46:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:46:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:46:36,506 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-20 00:46:36,532 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-20 00:46:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 00:46:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 00:46:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-20 00:46:36,539 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-20 00:46:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 00:46:36,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 00:46:36,626 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 00:46:36,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 00:46:37,019 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 00:46:37,065 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 00:46:37,066 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-20 00:46:37,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:46:37 BoogieIcfgContainer [2023-12-20 00:46:37,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 00:46:37,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 00:46:37,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 00:46:37,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 00:46:37,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:46:36" (1/3) ... [2023-12-20 00:46:37,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163b784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:46:37, skipping insertion in model container [2023-12-20 00:46:37,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:46:36" (2/3) ... [2023-12-20 00:46:37,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163b784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:46:37, skipping insertion in model container [2023-12-20 00:46:37,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:46:37" (3/3) ... [2023-12-20 00:46:37,072 INFO L112 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2023-12-20 00:46:37,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 00:46:37,083 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 00:46:37,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 00:46:37,139 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;@44661a78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 00:46:37,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 00:46:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 119 states have (on average 1.9243697478991597) internal successors, (229), 122 states have internal predecessors, (229), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 00:46:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:37,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:37,153 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] [2023-12-20 00:46:37,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:37,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2028212331, now seen corresponding path program 1 times [2023-12-20 00:46:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76134217] [2023-12-20 00:46:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:37,367 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-20 00:46:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76134217] [2023-12-20 00:46:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76134217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:37,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595985046] [2023-12-20 00:46:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:37,399 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.9243697478991597) internal successors, (229), 122 states have internal predecessors, (229), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:37,449 INFO L93 Difference]: Finished difference Result 240 states and 454 transitions. [2023-12-20 00:46:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:37,460 INFO L225 Difference]: With dead ends: 240 [2023-12-20 00:46:37,460 INFO L226 Difference]: Without dead ends: 121 [2023-12-20 00:46:37,464 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-20 00:46:37,469 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:37,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 206 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-20 00:46:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-20 00:46:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.805084745762712) internal successors, (213), 119 states have internal predecessors, (213), 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-20 00:46:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2023-12-20 00:46:37,512 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 215 transitions. Word has length 34 [2023-12-20 00:46:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:37,512 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 215 transitions. [2023-12-20 00:46:37,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 215 transitions. [2023-12-20 00:46:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:37,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:37,514 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] [2023-12-20 00:46:37,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 00:46:37,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:37,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2005580077, now seen corresponding path program 1 times [2023-12-20 00:46:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784300420] [2023-12-20 00:46:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:37,589 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-20 00:46:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784300420] [2023-12-20 00:46:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784300420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302361320] [2023-12-20 00:46:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:37,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:37,592 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:37,685 INFO L93 Difference]: Finished difference Result 327 states and 579 transitions. [2023-12-20 00:46:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:37,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:37,687 INFO L225 Difference]: With dead ends: 327 [2023-12-20 00:46:37,687 INFO L226 Difference]: Without dead ends: 208 [2023-12-20 00:46:37,687 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-20 00:46:37,688 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 558 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:37,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 343 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:46:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-20 00:46:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2023-12-20 00:46:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7860696517412935) internal successors, (359), 202 states have internal predecessors, (359), 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-20 00:46:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 361 transitions. [2023-12-20 00:46:37,708 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 361 transitions. Word has length 34 [2023-12-20 00:46:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:37,708 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 361 transitions. [2023-12-20 00:46:37,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 361 transitions. [2023-12-20 00:46:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:37,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:37,709 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] [2023-12-20 00:46:37,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 00:46:37,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:37,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1496106987, now seen corresponding path program 1 times [2023-12-20 00:46:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:37,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489136772] [2023-12-20 00:46:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:37,760 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-20 00:46:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489136772] [2023-12-20 00:46:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489136772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393241072] [2023-12-20 00:46:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:37,763 INFO L87 Difference]: Start difference. First operand 204 states and 361 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:37,792 INFO L93 Difference]: Finished difference Result 400 states and 710 transitions. [2023-12-20 00:46:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:37,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:37,794 INFO L225 Difference]: With dead ends: 400 [2023-12-20 00:46:37,794 INFO L226 Difference]: Without dead ends: 204 [2023-12-20 00:46:37,795 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-20 00:46:37,796 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 185 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:37,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-20 00:46:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2023-12-20 00:46:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7263681592039801) internal successors, (347), 202 states have internal predecessors, (347), 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-20 00:46:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 349 transitions. [2023-12-20 00:46:37,807 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 349 transitions. Word has length 34 [2023-12-20 00:46:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:37,808 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 349 transitions. [2023-12-20 00:46:37,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 349 transitions. [2023-12-20 00:46:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:37,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:37,809 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] [2023-12-20 00:46:37,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 00:46:37,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:37,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2139471343, now seen corresponding path program 1 times [2023-12-20 00:46:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:37,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812651105] [2023-12-20 00:46:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:37,844 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-20 00:46:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812651105] [2023-12-20 00:46:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812651105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:37,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:37,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035073526] [2023-12-20 00:46:37,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:37,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:37,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:37,846 INFO L87 Difference]: Start difference. First operand 204 states and 349 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:37,924 INFO L93 Difference]: Finished difference Result 555 states and 952 transitions. [2023-12-20 00:46:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:37,927 INFO L225 Difference]: With dead ends: 555 [2023-12-20 00:46:37,928 INFO L226 Difference]: Without dead ends: 360 [2023-12-20 00:46:37,928 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-20 00:46:37,929 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 359 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:37,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 419 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:46:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-20 00:46:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 204. [2023-12-20 00:46:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7114427860696517) internal successors, (344), 202 states have internal predecessors, (344), 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-20 00:46:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 346 transitions. [2023-12-20 00:46:37,943 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 346 transitions. Word has length 34 [2023-12-20 00:46:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:37,943 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 346 transitions. [2023-12-20 00:46:37,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 346 transitions. [2023-12-20 00:46:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:37,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:37,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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:46:37,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 00:46:37,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:37,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2093456339, now seen corresponding path program 1 times [2023-12-20 00:46:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258561375] [2023-12-20 00:46:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:37,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-20 00:46:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258561375] [2023-12-20 00:46:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258561375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998115701] [2023-12-20 00:46:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:37,976 INFO L87 Difference]: Start difference. First operand 204 states and 346 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,041 INFO L93 Difference]: Finished difference Result 558 states and 948 transitions. [2023-12-20 00:46:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,043 INFO L225 Difference]: With dead ends: 558 [2023-12-20 00:46:38,043 INFO L226 Difference]: Without dead ends: 364 [2023-12-20 00:46:38,044 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-20 00:46:38,045 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 358 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 429 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-12-20 00:46:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2023-12-20 00:46:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.6965174129353233) internal successors, (341), 202 states have internal predecessors, (341), 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-20 00:46:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 343 transitions. [2023-12-20 00:46:38,093 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 343 transitions. Word has length 34 [2023-12-20 00:46:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,093 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 343 transitions. [2023-12-20 00:46:38,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 343 transitions. [2023-12-20 00:46:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,094 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] [2023-12-20 00:46:38,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 00:46:38,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1952907729, now seen corresponding path program 1 times [2023-12-20 00:46:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100420171] [2023-12-20 00:46:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,146 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-20 00:46:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100420171] [2023-12-20 00:46:38,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100420171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321339611] [2023-12-20 00:46:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:38,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:38,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:38,149 INFO L87 Difference]: Start difference. First operand 204 states and 343 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,223 INFO L93 Difference]: Finished difference Result 570 states and 959 transitions. [2023-12-20 00:46:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,229 INFO L225 Difference]: With dead ends: 570 [2023-12-20 00:46:38,229 INFO L226 Difference]: Without dead ends: 377 [2023-12-20 00:46:38,230 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-20 00:46:38,236 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 363 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 436 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-20 00:46:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 210. [2023-12-20 00:46:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 207 states have (on average 1.6666666666666667) internal successors, (345), 208 states have internal predecessors, (345), 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-20 00:46:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 347 transitions. [2023-12-20 00:46:38,255 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 347 transitions. Word has length 34 [2023-12-20 00:46:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,256 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 347 transitions. [2023-12-20 00:46:38,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 347 transitions. [2023-12-20 00:46:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,258 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] [2023-12-20 00:46:38,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 00:46:38,259 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2086921235, now seen corresponding path program 1 times [2023-12-20 00:46:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984735211] [2023-12-20 00:46:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,312 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-20 00:46:38,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984735211] [2023-12-20 00:46:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984735211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752499075] [2023-12-20 00:46:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:38,314 INFO L87 Difference]: Start difference. First operand 210 states and 347 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,401 INFO L93 Difference]: Finished difference Result 716 states and 1184 transitions. [2023-12-20 00:46:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,406 INFO L225 Difference]: With dead ends: 716 [2023-12-20 00:46:38,406 INFO L226 Difference]: Without dead ends: 518 [2023-12-20 00:46:38,406 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-20 00:46:38,407 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 359 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 520 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:46:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-20 00:46:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 342. [2023-12-20 00:46:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 339 states have (on average 1.654867256637168) internal successors, (561), 340 states have internal predecessors, (561), 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-20 00:46:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 563 transitions. [2023-12-20 00:46:38,427 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 563 transitions. Word has length 34 [2023-12-20 00:46:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,427 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 563 transitions. [2023-12-20 00:46:38,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 563 transitions. [2023-12-20 00:46:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,430 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] [2023-12-20 00:46:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 00:46:38,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 402607727, now seen corresponding path program 1 times [2023-12-20 00:46:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443113397] [2023-12-20 00:46:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,474 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-20 00:46:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443113397] [2023-12-20 00:46:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443113397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485079595] [2023-12-20 00:46:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:38,477 INFO L87 Difference]: Start difference. First operand 342 states and 563 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,522 INFO L93 Difference]: Finished difference Result 816 states and 1349 transitions. [2023-12-20 00:46:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,524 INFO L225 Difference]: With dead ends: 816 [2023-12-20 00:46:38,524 INFO L226 Difference]: Without dead ends: 497 [2023-12-20 00:46:38,525 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-20 00:46:38,526 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 173 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-12-20 00:46:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2023-12-20 00:46:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.653061224489796) internal successors, (810), 491 states have internal predecessors, (810), 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-20 00:46:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 812 transitions. [2023-12-20 00:46:38,547 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 812 transitions. Word has length 34 [2023-12-20 00:46:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,547 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 812 transitions. [2023-12-20 00:46:38,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 812 transitions. [2023-12-20 00:46:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,548 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] [2023-12-20 00:46:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 00:46:38,548 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1772546189, now seen corresponding path program 1 times [2023-12-20 00:46:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591098841] [2023-12-20 00:46:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,595 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-20 00:46:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591098841] [2023-12-20 00:46:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591098841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330314154] [2023-12-20 00:46:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:38,597 INFO L87 Difference]: Start difference. First operand 493 states and 812 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,669 INFO L93 Difference]: Finished difference Result 1258 states and 2072 transitions. [2023-12-20 00:46:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,674 INFO L225 Difference]: With dead ends: 1258 [2023-12-20 00:46:38,674 INFO L226 Difference]: Without dead ends: 781 [2023-12-20 00:46:38,675 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-20 00:46:38,680 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 469 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 303 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-20 00:46:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2023-12-20 00:46:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.636734693877551) internal successors, (802), 491 states have internal predecessors, (802), 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-20 00:46:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 804 transitions. [2023-12-20 00:46:38,702 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 804 transitions. Word has length 34 [2023-12-20 00:46:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,702 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 804 transitions. [2023-12-20 00:46:38,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 804 transitions. [2023-12-20 00:46:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,703 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] [2023-12-20 00:46:38,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 00:46:38,703 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1501352753, now seen corresponding path program 1 times [2023-12-20 00:46:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950980486] [2023-12-20 00:46:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,739 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-20 00:46:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950980486] [2023-12-20 00:46:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950980486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436963222] [2023-12-20 00:46:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:38,743 INFO L87 Difference]: Start difference. First operand 493 states and 804 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,834 INFO L93 Difference]: Finished difference Result 1254 states and 2045 transitions. [2023-12-20 00:46:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,837 INFO L225 Difference]: With dead ends: 1254 [2023-12-20 00:46:38,837 INFO L226 Difference]: Without dead ends: 783 [2023-12-20 00:46:38,839 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-20 00:46:38,839 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 451 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2023-12-20 00:46:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 493. [2023-12-20 00:46:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.620408163265306) internal successors, (794), 491 states have internal predecessors, (794), 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-20 00:46:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 796 transitions. [2023-12-20 00:46:38,863 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 796 transitions. Word has length 34 [2023-12-20 00:46:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:38,865 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 796 transitions. [2023-12-20 00:46:38,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 796 transitions. [2023-12-20 00:46:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:38,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:38,865 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] [2023-12-20 00:46:38,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 00:46:38,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:38,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash 490235503, now seen corresponding path program 1 times [2023-12-20 00:46:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324081537] [2023-12-20 00:46:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:38,892 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-20 00:46:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324081537] [2023-12-20 00:46:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324081537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775892702] [2023-12-20 00:46:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:38,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:38,894 INFO L87 Difference]: Start difference. First operand 493 states and 796 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:38,972 INFO L93 Difference]: Finished difference Result 1194 states and 1922 transitions. [2023-12-20 00:46:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:46:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:38,975 INFO L225 Difference]: With dead ends: 1194 [2023-12-20 00:46:38,975 INFO L226 Difference]: Without dead ends: 717 [2023-12-20 00:46:38,976 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-20 00:46:38,977 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 463 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:38,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 322 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-12-20 00:46:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 541. [2023-12-20 00:46:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 538 states have (on average 1.5817843866171004) internal successors, (851), 539 states have internal predecessors, (851), 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-20 00:46:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2023-12-20 00:46:39,000 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 34 [2023-12-20 00:46:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,000 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2023-12-20 00:46:39,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-20 00:46:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2023-12-20 00:46:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:46:39,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,001 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] [2023-12-20 00:46:39,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 00:46:39,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash 748400941, now seen corresponding path program 1 times [2023-12-20 00:46:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018004040] [2023-12-20 00:46:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,025 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-20 00:46:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018004040] [2023-12-20 00:46:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018004040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076999694] [2023-12-20 00:46:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,026 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,080 INFO L93 Difference]: Finished difference Result 1284 states and 2028 transitions. [2023-12-20 00:46:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2023-12-20 00:46:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,084 INFO L225 Difference]: With dead ends: 1284 [2023-12-20 00:46:39,084 INFO L226 Difference]: Without dead ends: 756 [2023-12-20 00:46:39,085 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-20 00:46:39,085 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 113 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 287 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2023-12-20 00:46:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 753. [2023-12-20 00:46:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 750 states have (on average 1.56) internal successors, (1170), 751 states have internal predecessors, (1170), 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-20 00:46:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1172 transitions. [2023-12-20 00:46:39,112 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1172 transitions. Word has length 34 [2023-12-20 00:46:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,113 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1172 transitions. [2023-12-20 00:46:39,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-20 00:46:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1172 transitions. [2023-12-20 00:46:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 00:46:39,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,113 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, 1, 1] [2023-12-20 00:46:39,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 00:46:39,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1586861811, now seen corresponding path program 1 times [2023-12-20 00:46:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938115130] [2023-12-20 00:46:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,158 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-20 00:46:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938115130] [2023-12-20 00:46:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938115130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851592575] [2023-12-20 00:46:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,160 INFO L87 Difference]: Start difference. First operand 753 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-20 00:46:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,227 INFO L93 Difference]: Finished difference Result 1851 states and 2926 transitions. [2023-12-20 00:46:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 45 [2023-12-20 00:46:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,231 INFO L225 Difference]: With dead ends: 1851 [2023-12-20 00:46:39,231 INFO L226 Difference]: Without dead ends: 1124 [2023-12-20 00:46:39,232 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-20 00:46:39,232 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 78 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 381 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-12-20 00:46:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1120. [2023-12-20 00:46:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1117 states have (on average 1.5783348254252463) internal successors, (1763), 1118 states have internal predecessors, (1763), 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-20 00:46:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1765 transitions. [2023-12-20 00:46:39,274 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1765 transitions. Word has length 45 [2023-12-20 00:46:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,274 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1765 transitions. [2023-12-20 00:46:39,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-20 00:46:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1765 transitions. [2023-12-20 00:46:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 00:46:39,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,275 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, 1, 1] [2023-12-20 00:46:39,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 00:46:39,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1835008305, now seen corresponding path program 1 times [2023-12-20 00:46:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737281028] [2023-12-20 00:46:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 00:46:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737281028] [2023-12-20 00:46:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737281028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608079617] [2023-12-20 00:46:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,301 INFO L87 Difference]: Start difference. First operand 1120 states and 1765 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-20 00:46:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,346 INFO L93 Difference]: Finished difference Result 2192 states and 3472 transitions. [2023-12-20 00:46:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 45 [2023-12-20 00:46:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,350 INFO L225 Difference]: With dead ends: 2192 [2023-12-20 00:46:39,350 INFO L226 Difference]: Without dead ends: 1098 [2023-12-20 00:46:39,351 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-20 00:46:39,351 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 168 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2023-12-20 00:46:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2023-12-20 00:46:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1095 states have (on average 1.5853881278538813) internal successors, (1736), 1096 states have internal predecessors, (1736), 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-20 00:46:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1738 transitions. [2023-12-20 00:46:39,391 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1738 transitions. Word has length 45 [2023-12-20 00:46:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,391 INFO L495 AbstractCegarLoop]: Abstraction has 1098 states and 1738 transitions. [2023-12-20 00:46:39,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-20 00:46:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1738 transitions. [2023-12-20 00:46:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-20 00:46:39,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,392 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, 1, 1, 1] [2023-12-20 00:46:39,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 00:46:39,392 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1916306865, now seen corresponding path program 1 times [2023-12-20 00:46:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140352607] [2023-12-20 00:46:39,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,417 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-20 00:46:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140352607] [2023-12-20 00:46:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140352607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498310478] [2023-12-20 00:46:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,419 INFO L87 Difference]: Start difference. First operand 1098 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-20 00:46:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,509 INFO L93 Difference]: Finished difference Result 2787 states and 4478 transitions. [2023-12-20 00:46:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 46 [2023-12-20 00:46:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,516 INFO L225 Difference]: With dead ends: 2787 [2023-12-20 00:46:39,516 INFO L226 Difference]: Without dead ends: 1715 [2023-12-20 00:46:39,518 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-20 00:46:39,518 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 297 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-12-20 00:46:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1711. [2023-12-20 00:46:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1708 states have (on average 1.6036299765807962) internal successors, (2739), 1709 states have internal predecessors, (2739), 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-20 00:46:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2741 transitions. [2023-12-20 00:46:39,572 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2741 transitions. Word has length 46 [2023-12-20 00:46:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,572 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2741 transitions. [2023-12-20 00:46:39,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-20 00:46:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2741 transitions. [2023-12-20 00:46:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 00:46:39,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,573 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, 1, 1, 1, 1] [2023-12-20 00:46:39,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 00:46:39,573 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1700668417, now seen corresponding path program 1 times [2023-12-20 00:46:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139212648] [2023-12-20 00:46:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,590 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-20 00:46:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139212648] [2023-12-20 00:46:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139212648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562979415] [2023-12-20 00:46:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,592 INFO L87 Difference]: Start difference. First operand 1711 states and 2741 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-20 00:46:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,708 INFO L93 Difference]: Finished difference Result 4629 states and 7502 transitions. [2023-12-20 00:46:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 47 [2023-12-20 00:46:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,716 INFO L225 Difference]: With dead ends: 4629 [2023-12-20 00:46:39,716 INFO L226 Difference]: Without dead ends: 2945 [2023-12-20 00:46:39,719 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-20 00:46:39,719 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 84 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 358 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2023-12-20 00:46:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2941. [2023-12-20 00:46:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2938 states have (on average 1.6143635125936011) internal successors, (4743), 2939 states have internal predecessors, (4743), 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-20 00:46:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4745 transitions. [2023-12-20 00:46:39,834 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4745 transitions. Word has length 47 [2023-12-20 00:46:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:39,834 INFO L495 AbstractCegarLoop]: Abstraction has 2941 states and 4745 transitions. [2023-12-20 00:46:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-20 00:46:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4745 transitions. [2023-12-20 00:46:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 00:46:39,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:39,836 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, 1, 1, 1, 1] [2023-12-20 00:46:39,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 00:46:39,836 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:39,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1452521923, now seen corresponding path program 1 times [2023-12-20 00:46:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:39,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694499891] [2023-12-20 00:46:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 00:46:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694499891] [2023-12-20 00:46:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694499891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:39,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431591182] [2023-12-20 00:46:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:39,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:39,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:39,853 INFO L87 Difference]: Start difference. First operand 2941 states and 4745 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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-20 00:46:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:39,960 INFO L93 Difference]: Finished difference Result 5834 states and 9434 transitions. [2023-12-20 00:46:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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 47 [2023-12-20 00:46:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:39,968 INFO L225 Difference]: With dead ends: 5834 [2023-12-20 00:46:39,968 INFO L226 Difference]: Without dead ends: 2920 [2023-12-20 00:46:39,970 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-20 00:46:39,970 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:39,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2023-12-20 00:46:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2023-12-20 00:46:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2917 states have (on average 1.617415152553994) internal successors, (4718), 2918 states have internal predecessors, (4718), 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-20 00:46:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4720 transitions. [2023-12-20 00:46:40,061 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4720 transitions. Word has length 47 [2023-12-20 00:46:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:40,061 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4720 transitions. [2023-12-20 00:46:40,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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-20 00:46:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4720 transitions. [2023-12-20 00:46:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-20 00:46:40,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:40,062 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, 1, 1, 1, 1, 1] [2023-12-20 00:46:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 00:46:40,063 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:40,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1012692291, now seen corresponding path program 1 times [2023-12-20 00:46:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232448508] [2023-12-20 00:46:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:40,098 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-20 00:46:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232448508] [2023-12-20 00:46:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232448508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139551188] [2023-12-20 00:46:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:40,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:40,100 INFO L87 Difference]: Start difference. First operand 2920 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 00:46:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:40,295 INFO L93 Difference]: Finished difference Result 7399 states and 11983 transitions. [2023-12-20 00:46:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:46:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 48 [2023-12-20 00:46:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:40,307 INFO L225 Difference]: With dead ends: 7399 [2023-12-20 00:46:40,307 INFO L226 Difference]: Without dead ends: 3794 [2023-12-20 00:46:40,312 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-20 00:46:40,313 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 384 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:40,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 276 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2023-12-20 00:46:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2023-12-20 00:46:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3791 states have (on average 1.604062252703772) internal successors, (6081), 3792 states have internal predecessors, (6081), 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-20 00:46:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 6083 transitions. [2023-12-20 00:46:40,482 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 6083 transitions. Word has length 48 [2023-12-20 00:46:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:40,483 INFO L495 AbstractCegarLoop]: Abstraction has 3794 states and 6083 transitions. [2023-12-20 00:46:40,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 00:46:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 6083 transitions. [2023-12-20 00:46:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 00:46:40,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:40,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:46:40,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 00:46:40,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:40,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1448872395, now seen corresponding path program 1 times [2023-12-20 00:46:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990176701] [2023-12-20 00:46:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:40,520 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-20 00:46:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990176701] [2023-12-20 00:46:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990176701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239895195] [2023-12-20 00:46:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:40,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:46:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:46:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:46:40,522 INFO L87 Difference]: Start difference. First operand 3794 states and 6083 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-20 00:46:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:40,815 INFO L93 Difference]: Finished difference Result 9674 states and 15400 transitions. [2023-12-20 00:46:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:46:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 53 [2023-12-20 00:46:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:40,843 INFO L225 Difference]: With dead ends: 9674 [2023-12-20 00:46:40,843 INFO L226 Difference]: Without dead ends: 5901 [2023-12-20 00:46:40,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:46:40,849 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 660 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:40,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 467 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2023-12-20 00:46:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 4438. [2023-12-20 00:46:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4435 states have (on average 1.5682074408117248) internal successors, (6955), 4436 states have internal predecessors, (6955), 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-20 00:46:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 6957 transitions. [2023-12-20 00:46:41,058 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 6957 transitions. Word has length 53 [2023-12-20 00:46:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:41,058 INFO L495 AbstractCegarLoop]: Abstraction has 4438 states and 6957 transitions. [2023-12-20 00:46:41,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-20 00:46:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 6957 transitions. [2023-12-20 00:46:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 00:46:41,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:41,063 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-20 00:46:41,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 00:46:41,064 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:41,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1622132950, now seen corresponding path program 1 times [2023-12-20 00:46:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867453506] [2023-12-20 00:46:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:41,088 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-20 00:46:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:41,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867453506] [2023-12-20 00:46:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867453506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:41,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672705886] [2023-12-20 00:46:41,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:41,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:41,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:41,090 INFO L87 Difference]: Start difference. First operand 4438 states and 6957 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-20 00:46:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:41,252 INFO L93 Difference]: Finished difference Result 9188 states and 14369 transitions. [2023-12-20 00:46:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 84 [2023-12-20 00:46:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:41,262 INFO L225 Difference]: With dead ends: 9188 [2023-12-20 00:46:41,262 INFO L226 Difference]: Without dead ends: 4777 [2023-12-20 00:46:41,268 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-20 00:46:41,269 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 126 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:41,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 278 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2023-12-20 00:46:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4761. [2023-12-20 00:46:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4758 states have (on average 1.5147120638923917) internal successors, (7207), 4759 states have internal predecessors, (7207), 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-20 00:46:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 7209 transitions. [2023-12-20 00:46:41,495 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 7209 transitions. Word has length 84 [2023-12-20 00:46:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:41,495 INFO L495 AbstractCegarLoop]: Abstraction has 4761 states and 7209 transitions. [2023-12-20 00:46:41,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-20 00:46:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 7209 transitions. [2023-12-20 00:46:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 00:46:41,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:41,498 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-20 00:46:41,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 00:46:41,498 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:41,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 35385248, now seen corresponding path program 1 times [2023-12-20 00:46:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631459691] [2023-12-20 00:46:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:41,524 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-20 00:46:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631459691] [2023-12-20 00:46:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631459691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013924731] [2023-12-20 00:46:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:41,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:41,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:41,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:41,525 INFO L87 Difference]: Start difference. First operand 4761 states and 7209 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-20 00:46:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:41,738 INFO L93 Difference]: Finished difference Result 9986 states and 15079 transitions. [2023-12-20 00:46:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:41,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-20 00:46:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:41,746 INFO L225 Difference]: With dead ends: 9986 [2023-12-20 00:46:41,747 INFO L226 Difference]: Without dead ends: 5263 [2023-12-20 00:46:41,752 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-20 00:46:41,752 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 124 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:41,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 277 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2023-12-20 00:46:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5239. [2023-12-20 00:46:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5236 states have (on average 1.4618029029793735) internal successors, (7654), 5237 states have internal predecessors, (7654), 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-20 00:46:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 7656 transitions. [2023-12-20 00:46:41,989 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 7656 transitions. Word has length 85 [2023-12-20 00:46:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:41,989 INFO L495 AbstractCegarLoop]: Abstraction has 5239 states and 7656 transitions. [2023-12-20 00:46:41,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-20 00:46:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 7656 transitions. [2023-12-20 00:46:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-20 00:46:41,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:41,992 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-20 00:46:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 00:46:41,992 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:41,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash -834777524, now seen corresponding path program 1 times [2023-12-20 00:46:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802155980] [2023-12-20 00:46:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:42,015 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-20 00:46:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802155980] [2023-12-20 00:46:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802155980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722420574] [2023-12-20 00:46:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:42,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:42,017 INFO L87 Difference]: Start difference. First operand 5239 states and 7656 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-20 00:46:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:42,272 INFO L93 Difference]: Finished difference Result 10795 states and 15773 transitions. [2023-12-20 00:46:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 86 [2023-12-20 00:46:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:42,283 INFO L225 Difference]: With dead ends: 10795 [2023-12-20 00:46:42,283 INFO L226 Difference]: Without dead ends: 5612 [2023-12-20 00:46:42,290 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-20 00:46:42,290 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 119 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:42,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2023-12-20 00:46:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 5022. [2023-12-20 00:46:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 5019 states have (on average 1.3980872683801555) internal successors, (7017), 5020 states have internal predecessors, (7017), 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-20 00:46:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 7019 transitions. [2023-12-20 00:46:42,496 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 7019 transitions. Word has length 86 [2023-12-20 00:46:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:42,497 INFO L495 AbstractCegarLoop]: Abstraction has 5022 states and 7019 transitions. [2023-12-20 00:46:42,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-20 00:46:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 7019 transitions. [2023-12-20 00:46:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-20 00:46:42,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:42,500 INFO L195 NwaCegarLoop]: trace histogram [3, 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-20 00:46:42,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 00:46:42,500 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:42,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:42,500 INFO L85 PathProgramCache]: Analyzing trace with hash -677566338, now seen corresponding path program 1 times [2023-12-20 00:46:42,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:42,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086059777] [2023-12-20 00:46:42,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 00:46:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086059777] [2023-12-20 00:46:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086059777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934270055] [2023-12-20 00:46:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:42,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:42,554 INFO L87 Difference]: Start difference. First operand 5022 states and 7019 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 00:46:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:42,792 INFO L93 Difference]: Finished difference Result 9338 states and 12971 transitions. [2023-12-20 00:46:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:46:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 87 [2023-12-20 00:46:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:42,799 INFO L225 Difference]: With dead ends: 9338 [2023-12-20 00:46:42,799 INFO L226 Difference]: Without dead ends: 4803 [2023-12-20 00:46:42,804 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-20 00:46:42,805 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 412 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 401 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:46:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2023-12-20 00:46:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4703. [2023-12-20 00:46:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 4700 states have (on average 1.3419148936170213) internal successors, (6307), 4701 states have internal predecessors, (6307), 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-20 00:46:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 6309 transitions. [2023-12-20 00:46:42,971 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 6309 transitions. Word has length 87 [2023-12-20 00:46:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:42,972 INFO L495 AbstractCegarLoop]: Abstraction has 4703 states and 6309 transitions. [2023-12-20 00:46:42,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 00:46:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 6309 transitions. [2023-12-20 00:46:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-20 00:46:42,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:42,978 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2023-12-20 00:46:42,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-20 00:46:42,978 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:42,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -833046779, now seen corresponding path program 1 times [2023-12-20 00:46:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:42,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624592395] [2023-12-20 00:46:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 00:46:43,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:43,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624592395] [2023-12-20 00:46:43,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624592395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:43,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334495147] [2023-12-20 00:46:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:43,020 INFO L87 Difference]: Start difference. First operand 4703 states and 6309 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-20 00:46:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:43,179 INFO L93 Difference]: Finished difference Result 8961 states and 12015 transitions. [2023-12-20 00:46:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 113 [2023-12-20 00:46:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:43,185 INFO L225 Difference]: With dead ends: 8961 [2023-12-20 00:46:43,185 INFO L226 Difference]: Without dead ends: 4653 [2023-12-20 00:46:43,191 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-20 00:46:43,192 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:43,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 277 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2023-12-20 00:46:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 4653. [2023-12-20 00:46:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4650 states have (on average 1.3344086021505377) internal successors, (6205), 4651 states have internal predecessors, (6205), 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-20 00:46:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 6207 transitions. [2023-12-20 00:46:43,351 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 6207 transitions. Word has length 113 [2023-12-20 00:46:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:43,352 INFO L495 AbstractCegarLoop]: Abstraction has 4653 states and 6207 transitions. [2023-12-20 00:46:43,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-20 00:46:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 6207 transitions. [2023-12-20 00:46:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 00:46:43,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:43,358 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-12-20 00:46:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-20 00:46:43,358 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:43,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1125314297, now seen corresponding path program 1 times [2023-12-20 00:46:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138852439] [2023-12-20 00:46:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 00:46:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138852439] [2023-12-20 00:46:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138852439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52059320] [2023-12-20 00:46:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:43,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:43,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:43,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:43,430 INFO L87 Difference]: Start difference. First operand 4653 states and 6207 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-20 00:46:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:43,632 INFO L93 Difference]: Finished difference Result 8253 states and 11041 transitions. [2023-12-20 00:46:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:46:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 125 [2023-12-20 00:46:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:43,639 INFO L225 Difference]: With dead ends: 8253 [2023-12-20 00:46:43,639 INFO L226 Difference]: Without dead ends: 4579 [2023-12-20 00:46:43,643 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-20 00:46:43,644 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 295 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:43,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 283 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2023-12-20 00:46:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4575. [2023-12-20 00:46:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4572 states have (on average 1.3097112860892388) internal successors, (5988), 4573 states have internal predecessors, (5988), 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-20 00:46:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 5990 transitions. [2023-12-20 00:46:43,805 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 5990 transitions. Word has length 125 [2023-12-20 00:46:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:43,805 INFO L495 AbstractCegarLoop]: Abstraction has 4575 states and 5990 transitions. [2023-12-20 00:46:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-20 00:46:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 5990 transitions. [2023-12-20 00:46:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 00:46:43,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:43,812 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-12-20 00:46:43,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-20 00:46:43,812 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:43,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1269120039, now seen corresponding path program 1 times [2023-12-20 00:46:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774148318] [2023-12-20 00:46:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-20 00:46:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774148318] [2023-12-20 00:46:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774148318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:43,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87696218] [2023-12-20 00:46:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:43,843 INFO L87 Difference]: Start difference. First operand 4575 states and 5990 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-20 00:46:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:44,060 INFO L93 Difference]: Finished difference Result 8738 states and 11439 transitions. [2023-12-20 00:46:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:44,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 131 [2023-12-20 00:46:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:44,067 INFO L225 Difference]: With dead ends: 8738 [2023-12-20 00:46:44,067 INFO L226 Difference]: Without dead ends: 4557 [2023-12-20 00:46:44,071 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-20 00:46:44,071 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 23 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:44,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2023-12-20 00:46:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4537. [2023-12-20 00:46:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 4534 states have (on average 1.3030436700485222) internal successors, (5908), 4535 states have internal predecessors, (5908), 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-20 00:46:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 5910 transitions. [2023-12-20 00:46:44,298 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 5910 transitions. Word has length 131 [2023-12-20 00:46:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:44,298 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 5910 transitions. [2023-12-20 00:46:44,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-20 00:46:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 5910 transitions. [2023-12-20 00:46:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 00:46:44,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:44,304 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-12-20 00:46:44,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-20 00:46:44,304 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:44,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1794258707, now seen corresponding path program 1 times [2023-12-20 00:46:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634735935] [2023-12-20 00:46:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-20 00:46:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634735935] [2023-12-20 00:46:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634735935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 00:46:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557807471] [2023-12-20 00:46:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:44,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:44,333 INFO L87 Difference]: Start difference. First operand 4537 states and 5910 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-20 00:46:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:44,540 INFO L93 Difference]: Finished difference Result 8688 states and 11319 transitions. [2023-12-20 00:46:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 131 [2023-12-20 00:46:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:44,548 INFO L225 Difference]: With dead ends: 8688 [2023-12-20 00:46:44,548 INFO L226 Difference]: Without dead ends: 4527 [2023-12-20 00:46:44,553 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-20 00:46:44,554 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:44,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 272 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2023-12-20 00:46:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4507. [2023-12-20 00:46:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4504 states have (on average 1.2959591474245116) internal successors, (5837), 4505 states have internal predecessors, (5837), 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-20 00:46:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 5839 transitions. [2023-12-20 00:46:44,713 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 5839 transitions. Word has length 131 [2023-12-20 00:46:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:44,713 INFO L495 AbstractCegarLoop]: Abstraction has 4507 states and 5839 transitions. [2023-12-20 00:46:44,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-20 00:46:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 5839 transitions. [2023-12-20 00:46:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 00:46:44,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:44,719 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-12-20 00:46:44,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-20 00:46:44,719 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:44,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1338781053, now seen corresponding path program 1 times [2023-12-20 00:46:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:44,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398591406] [2023-12-20 00:46:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-20 00:46:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398591406] [2023-12-20 00:46:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398591406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210962406] [2023-12-20 00:46:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:44,785 INFO L87 Difference]: Start difference. First operand 4507 states and 5839 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-20 00:46:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:44,934 INFO L93 Difference]: Finished difference Result 7346 states and 9569 transitions. [2023-12-20 00:46:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:46:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 134 [2023-12-20 00:46:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:44,939 INFO L225 Difference]: With dead ends: 7346 [2023-12-20 00:46:44,939 INFO L226 Difference]: Without dead ends: 3215 [2023-12-20 00:46:44,943 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-20 00:46:44,943 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 269 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:44,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2023-12-20 00:46:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3211. [2023-12-20 00:46:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 3208 states have (on average 1.263715710723192) internal successors, (4054), 3209 states have internal predecessors, (4054), 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-20 00:46:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4056 transitions. [2023-12-20 00:46:45,063 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4056 transitions. Word has length 134 [2023-12-20 00:46:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:45,063 INFO L495 AbstractCegarLoop]: Abstraction has 3211 states and 4056 transitions. [2023-12-20 00:46:45,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-20 00:46:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4056 transitions. [2023-12-20 00:46:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 00:46:45,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:45,067 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-12-20 00:46:45,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-20 00:46:45,067 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:45,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1962216896, now seen corresponding path program 1 times [2023-12-20 00:46:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579816151] [2023-12-20 00:46:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 00:46:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579816151] [2023-12-20 00:46:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579816151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:45,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:46:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100871794] [2023-12-20 00:46:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:45,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:46:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:46:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:46:45,126 INFO L87 Difference]: Start difference. First operand 3211 states and 4056 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-20 00:46:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:45,232 INFO L93 Difference]: Finished difference Result 5198 states and 6572 transitions. [2023-12-20 00:46:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:46:45,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 134 [2023-12-20 00:46:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:45,235 INFO L225 Difference]: With dead ends: 5198 [2023-12-20 00:46:45,235 INFO L226 Difference]: Without dead ends: 2060 [2023-12-20 00:46:45,240 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-20 00:46:45,241 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 271 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:45,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 253 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2023-12-20 00:46:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2056. [2023-12-20 00:46:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2053 states have (on average 1.230881636629323) internal successors, (2527), 2054 states have internal predecessors, (2527), 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-20 00:46:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2529 transitions. [2023-12-20 00:46:45,314 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2529 transitions. Word has length 134 [2023-12-20 00:46:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:45,314 INFO L495 AbstractCegarLoop]: Abstraction has 2056 states and 2529 transitions. [2023-12-20 00:46:45,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-20 00:46:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2529 transitions. [2023-12-20 00:46:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 00:46:45,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:45,315 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-20 00:46:45,316 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:45,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2145844268, now seen corresponding path program 1 times [2023-12-20 00:46:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92905410] [2023-12-20 00:46:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:46:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92905410] [2023-12-20 00:46:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92905410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:45,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450559290] [2023-12-20 00:46:45,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:45,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:45,352 INFO L87 Difference]: Start difference. First operand 2056 states and 2529 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-20 00:46:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:45,433 INFO L93 Difference]: Finished difference Result 3704 states and 4596 transitions. [2023-12-20 00:46:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 172 [2023-12-20 00:46:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:45,435 INFO L225 Difference]: With dead ends: 3704 [2023-12-20 00:46:45,435 INFO L226 Difference]: Without dead ends: 1994 [2023-12-20 00:46:45,437 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-20 00:46:45,437 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:45,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2023-12-20 00:46:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1926. [2023-12-20 00:46:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1923 states have (on average 1.2111284451378055) internal successors, (2329), 1924 states have internal predecessors, (2329), 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-20 00:46:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2331 transitions. [2023-12-20 00:46:45,508 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2331 transitions. Word has length 172 [2023-12-20 00:46:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:45,508 INFO L495 AbstractCegarLoop]: Abstraction has 1926 states and 2331 transitions. [2023-12-20 00:46:45,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-20 00:46:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2331 transitions. [2023-12-20 00:46:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-20 00:46:45,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:45,510 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-20 00:46:45,510 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:45,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -857419627, now seen corresponding path program 1 times [2023-12-20 00:46:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132751592] [2023-12-20 00:46:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 00:46:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132751592] [2023-12-20 00:46:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132751592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225977424] [2023-12-20 00:46:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:45,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:45,548 INFO L87 Difference]: Start difference. First operand 1926 states and 2331 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-20 00:46:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:45,649 INFO L93 Difference]: Finished difference Result 4141 states and 5050 transitions. [2023-12-20 00:46:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:45,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 178 [2023-12-20 00:46:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:45,653 INFO L225 Difference]: With dead ends: 4141 [2023-12-20 00:46:45,653 INFO L226 Difference]: Without dead ends: 2557 [2023-12-20 00:46:45,655 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-20 00:46:45,655 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 138 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:45,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2023-12-20 00:46:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2208. [2023-12-20 00:46:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2205 states have (on average 1.1941043083900227) internal successors, (2633), 2206 states have internal predecessors, (2633), 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-20 00:46:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2635 transitions. [2023-12-20 00:46:45,737 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2635 transitions. Word has length 178 [2023-12-20 00:46:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:45,737 INFO L495 AbstractCegarLoop]: Abstraction has 2208 states and 2635 transitions. [2023-12-20 00:46:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-20 00:46:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2635 transitions. [2023-12-20 00:46:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 00:46:45,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:45,740 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:45,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-20 00:46:45,740 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:45,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1617142607, now seen corresponding path program 1 times [2023-12-20 00:46:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637766085] [2023-12-20 00:46:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-20 00:46:45,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637766085] [2023-12-20 00:46:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637766085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:45,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235258392] [2023-12-20 00:46:45,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:45,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:45,777 INFO L87 Difference]: Start difference. First operand 2208 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-20 00:46:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:45,872 INFO L93 Difference]: Finished difference Result 4041 states and 4853 transitions. [2023-12-20 00:46:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 181 [2023-12-20 00:46:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:45,879 INFO L225 Difference]: With dead ends: 4041 [2023-12-20 00:46:45,880 INFO L226 Difference]: Without dead ends: 2208 [2023-12-20 00:46:45,882 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-20 00:46:45,882 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:45,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-12-20 00:46:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2208. [2023-12-20 00:46:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2205 states have (on average 1.1931972789115646) internal successors, (2631), 2206 states have internal predecessors, (2631), 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-20 00:46:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2633 transitions. [2023-12-20 00:46:45,976 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2633 transitions. Word has length 181 [2023-12-20 00:46:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:45,976 INFO L495 AbstractCegarLoop]: Abstraction has 2208 states and 2633 transitions. [2023-12-20 00:46:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-20 00:46:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2633 transitions. [2023-12-20 00:46:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 00:46:45,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:45,978 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:45,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-20 00:46:45,978 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:45,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1632661325, now seen corresponding path program 1 times [2023-12-20 00:46:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392798412] [2023-12-20 00:46:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-20 00:46:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392798412] [2023-12-20 00:46:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392798412] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398151407] [2023-12-20 00:46:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:46,011 INFO L87 Difference]: Start difference. First operand 2208 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-20 00:46:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:46,095 INFO L93 Difference]: Finished difference Result 3149 states and 3765 transitions. [2023-12-20 00:46:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 181 [2023-12-20 00:46:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:46,098 INFO L225 Difference]: With dead ends: 3149 [2023-12-20 00:46:46,098 INFO L226 Difference]: Without dead ends: 1316 [2023-12-20 00:46:46,100 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-20 00:46:46,100 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:46,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-12-20 00:46:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2023-12-20 00:46:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1313 states have (on average 1.175932977913176) internal successors, (1544), 1314 states have internal predecessors, (1544), 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-20 00:46:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1546 transitions. [2023-12-20 00:46:46,152 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1546 transitions. Word has length 181 [2023-12-20 00:46:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:46,152 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1546 transitions. [2023-12-20 00:46:46,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-20 00:46:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1546 transitions. [2023-12-20 00:46:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 00:46:46,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:46,154 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:46,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-20 00:46:46,154 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:46,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -418322673, now seen corresponding path program 1 times [2023-12-20 00:46:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10501091] [2023-12-20 00:46:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-20 00:46:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10501091] [2023-12-20 00:46:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10501091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:46:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:46:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:46:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633656563] [2023-12-20 00:46:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:46:46,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:46:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:46:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:46:46,190 INFO L87 Difference]: Start difference. First operand 1316 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-20 00:46:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:46,261 INFO L93 Difference]: Finished difference Result 1323 states and 1554 transitions. [2023-12-20 00:46:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:46:46,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 181 [2023-12-20 00:46:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:46,263 INFO L225 Difference]: With dead ends: 1323 [2023-12-20 00:46:46,263 INFO L226 Difference]: Without dead ends: 1320 [2023-12-20 00:46:46,264 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-20 00:46:46,264 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:46,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 277 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:46:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-12-20 00:46:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1318. [2023-12-20 00:46:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1315 states have (on average 1.1756653992395438) internal successors, (1546), 1316 states have internal predecessors, (1546), 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-20 00:46:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1548 transitions. [2023-12-20 00:46:46,348 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1548 transitions. Word has length 181 [2023-12-20 00:46:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:46,349 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1548 transitions. [2023-12-20 00:46:46,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-20 00:46:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1548 transitions. [2023-12-20 00:46:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 00:46:46,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:46,350 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:46,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-20 00:46:46,351 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:46,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash -418269880, now seen corresponding path program 1 times [2023-12-20 00:46:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545482031] [2023-12-20 00:46:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 00:46:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:46:46,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545482031] [2023-12-20 00:46:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545482031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:46:46,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030649763] [2023-12-20 00:46:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:46,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:46:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:46:46,622 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-20 00:46:46,644 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-20 00:46:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:46:46,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-20 00:46:46,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:46:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 00:46:46,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:46:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 00:46:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030649763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:46:47,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:46:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2023-12-20 00:46:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231133671] [2023-12-20 00:46:47,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:46:47,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-20 00:46:47,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:46:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-20 00:46:47,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2023-12-20 00:46:47,382 INFO L87 Difference]: Start difference. First operand 1318 states and 1548 transitions. Second operand has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 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-20 00:46:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:46:49,266 INFO L93 Difference]: Finished difference Result 4866 states and 5643 transitions. [2023-12-20 00:46:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-20 00:46:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 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 181 [2023-12-20 00:46:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:46:49,275 INFO L225 Difference]: With dead ends: 4866 [2023-12-20 00:46:49,275 INFO L226 Difference]: Without dead ends: 3877 [2023-12-20 00:46:49,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=742, Invalid=5738, Unknown=0, NotChecked=0, Total=6480 [2023-12-20 00:46:49,280 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 3658 mSDsluCounter, 8140 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3658 SdHoareTripleChecker+Valid, 8633 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 00:46:49,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3658 Valid, 8633 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 00:46:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2023-12-20 00:46:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 1739. [2023-12-20 00:46:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1736 states have (on average 1.168778801843318) internal successors, (2029), 1737 states have internal predecessors, (2029), 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-20 00:46:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2031 transitions. [2023-12-20 00:46:49,370 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2031 transitions. Word has length 181 [2023-12-20 00:46:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:46:49,370 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2031 transitions. [2023-12-20 00:46:49,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 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-20 00:46:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2031 transitions. [2023-12-20 00:46:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-20 00:46:49,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:46:49,372 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 00:46:49,577 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,SelfDestructingSolverStorable34 [2023-12-20 00:46:49,578 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:46:49,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:46:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -81898887, now seen corresponding path program 1 times [2023-12-20 00:46:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:46:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113174939] [2023-12-20 00:46:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:46:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:46:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 00:46:49,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 00:46:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 00:46:49,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 00:46:49,654 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 00:46:49,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 00:46:49,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-20 00:46:49,659 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, 1, 1, 1, 1, 1, 1] [2023-12-20 00:46:49,662 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 00:46:49,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:46:49 BoogieIcfgContainer [2023-12-20 00:46:49,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 00:46:49,800 INFO L158 Benchmark]: Toolchain (without parser) took 13718.91ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 157.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 798.3MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,801 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 204.5MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:46:49,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.11ms. Allocated memory is still 204.5MB. Free memory was 156.8MB in the beginning and 141.4MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.70ms. Allocated memory is still 204.5MB. Free memory was 141.4MB in the beginning and 139.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,805 INFO L158 Benchmark]: Boogie Preprocessor took 51.02ms. Allocated memory is still 204.5MB. Free memory was 139.0MB in the beginning and 136.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,805 INFO L158 Benchmark]: RCFGBuilder took 598.12ms. Allocated memory is still 204.5MB. Free memory was 136.2MB in the beginning and 166.5MB in the end (delta: -30.4MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,805 INFO L158 Benchmark]: TraceAbstraction took 12729.51ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 166.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 806.4MB. Max. memory is 8.0GB. [2023-12-20 00:46:49,806 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.35ms. Allocated memory is still 204.5MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.11ms. Allocated memory is still 204.5MB. Free memory was 156.8MB in the beginning and 141.4MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.70ms. Allocated memory is still 204.5MB. Free memory was 141.4MB in the beginning and 139.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.02ms. Allocated memory is still 204.5MB. Free memory was 139.0MB in the beginning and 136.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.12ms. Allocated memory is still 204.5MB. Free memory was 136.2MB in the beginning and 166.5MB in the end (delta: -30.4MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12729.51ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 166.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 806.4MB. 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 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L66] COND TRUE (int )wl_pc == 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L80] wl_st = 2 [L81] wl_pc = 1 [L82] e_wl = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND TRUE (int )c1_pc == 0 VAL [c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND TRUE (int )c2_pc == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND TRUE (int )wb_pc == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L560] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L571] kernel_st = 3 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L582] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L587] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L592] COND TRUE (int )e_wl == 0 [L593] e_wl = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L597] COND TRUE (int )wl_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L598] COND TRUE (int )e_wl == 1 [L599] wl_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L615] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L616] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L624] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L625] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L633] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L634] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L657] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L662] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L667] COND TRUE (int )e_wl == 1 [L668] e_wl = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L672] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L69] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L72] COND TRUE (int )wl_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L87] COND TRUE 1 [L89] t = d [L90] data = d [L91] processed = 0 [L92] e_f = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L93] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )e_f == 1 [L95] c1_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L102] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] COND TRUE (int )e_f == 1 [L104] c2_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L111] e_f = 2 [L112] wl_st = 2 [L113] wl_pc = 2 [L114] t_b = t VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND FALSE !((int )c1_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L152] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L167] COND TRUE ! processed [L168] data += 1 [L169] e_g = 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L170] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L171] COND TRUE (int )e_g == 1 [L172] wb_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L179] e_g = 2 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND FALSE !((int )c2_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L197] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L212] COND TRUE ! processed [L213] data += 1 [L214] e_g = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L215] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L216] COND TRUE (int )e_g == 1 [L217] wb_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L224] e_g = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND FALSE !((int )wb_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L242] COND TRUE (int )wb_pc == 1 [L257] c_t = data [L258] c_req_up = 1 [L259] processed = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L560] COND TRUE (int )c_req_up == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L561] COND TRUE c != c_t [L562] c = c_t [L563] e_c = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] c_req_up = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L571] kernel_st = 3 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L582] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L587] COND TRUE (int )e_c == 0 [L588] e_c = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L592] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND TRUE (int )wl_pc == 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L606] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L615] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L616] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L624] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L625] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L633] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L634] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] r_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L657] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND TRUE (int )e_c == 1 [L663] e_c = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L667] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L672] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L675] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L678] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L681] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L684] COND TRUE (int )r_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND TRUE (int )r_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L329] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L344] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L359] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L374] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L389] COND TRUE (int )r_st == 0 [L391] tmp___3 = __VERIFIER_nondet_int() [L393] COND TRUE \read(tmp___3) [L395] r_st = 1 [L396] CALL read() [L271] d = c [L272] e_e = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L281] COND TRUE (int )wl_pc == 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L282] COND TRUE (int )e_e == 1 [L283] wl_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L291] e_e = 2 [L292] r_st = 2 [L396] RET read() [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L69] COND TRUE (int )wl_pc == 2 [L118] t = t_b VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L119] COND FALSE !(d == t + 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND TRUE d == t + 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L130] COND FALSE !(d == t + 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L134] CALL error() VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L23] reach_error() VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11188 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11188 mSDsluCounter, 19054 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12122 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2857 IncrementalHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 6932 mSDtfsCounter, 2857 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5239occurred in iteration=21, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 6238 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3286 NumberOfCodeBlocks, 3286 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3248 ConstructedInterpolants, 0 QuantifiedInterpolants, 6807 SizeOfPredicates, 6 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 1094/1219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-20 00:46:49,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...