/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 02:42:08,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 02:42:08,231 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 02:42:08,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 02:42:08,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 02:42:08,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 02:42:08,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 02:42:08,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 02:42:08,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 02:42:08,269 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 02:42:08,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 02:42:08,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 02:42:08,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 02:42:08,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 02:42:08,272 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 02:42:08,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 02:42:08,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 02:42:08,272 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 02:42:08,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 02:42:08,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 02:42:08,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 02:42:08,274 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 02:42:08,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 02:42:08,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 02:42:08,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 02:42:08,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 02:42:08,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 02:42:08,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 02:42:08,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 02:42:08,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 02:42:08,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 02:42:08,277 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 02:42:08,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 02:42:08,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 02:42:08,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 02:42:08,495 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 02:42:08,495 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 02:42:08,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-20 02:42:09,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 02:42:09,697 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 02:42:09,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-20 02:42:09,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1120cce4/08bd23133dd044b0ad75ca31c5d987ef/FLAG1c0bb76b7 [2023-12-20 02:42:09,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1120cce4/08bd23133dd044b0ad75ca31c5d987ef [2023-12-20 02:42:09,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 02:42:09,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 02:42:09,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 02:42:09,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 02:42:09,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 02:42:09,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:42:09" (1/1) ... [2023-12-20 02:42:09,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314c16ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:09, skipping insertion in model container [2023-12-20 02:42:09,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:42:09" (1/1) ... [2023-12-20 02:42:09,769 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 02:42:09,948 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2023-12-20 02:42:09,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 02:42:10,016 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 02:42:10,067 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2023-12-20 02:42:10,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 02:42:10,115 INFO L206 MainTranslator]: Completed translation [2023-12-20 02:42:10,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10 WrapperNode [2023-12-20 02:42:10,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 02:42:10,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 02:42:10,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 02:42:10,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 02:42:10,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,170 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 599 [2023-12-20 02:42:10,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 02:42:10,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 02:42:10,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 02:42:10,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 02:42:10,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,191 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 02:42:10,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 02:42:10,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 02:42:10,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 02:42:10,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 02:42:10,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (1/1) ... [2023-12-20 02:42:10,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 02:42:10,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:42:10,246 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 02:42:10,260 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 02:42:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 02:42:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 02:42:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 02:42:10,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 02:42:10,358 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 02:42:10,360 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 02:42:10,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 02:42:10,848 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 02:42:10,848 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-20 02:42:10,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:42:10 BoogieIcfgContainer [2023-12-20 02:42:10,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 02:42:10,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 02:42:10,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 02:42:10,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 02:42:10,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 02:42:09" (1/3) ... [2023-12-20 02:42:10,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:42:10, skipping insertion in model container [2023-12-20 02:42:10,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:42:10" (2/3) ... [2023-12-20 02:42:10,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:42:10, skipping insertion in model container [2023-12-20 02:42:10,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:42:10" (3/3) ... [2023-12-20 02:42:10,856 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-20 02:42:10,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 02:42:10,870 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 02:42:10,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 02:42:10,922 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;@5c49ee3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 02:42:10,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 02:42:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 02:42:10,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:10,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:10,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:10,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1045916224, now seen corresponding path program 1 times [2023-12-20 02:42:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460968537] [2023-12-20 02:42:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:11,295 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 02:42:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460968537] [2023-12-20 02:42:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460968537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 02:42:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909598121] [2023-12-20 02:42:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:11,333 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:11,504 INFO L93 Difference]: Finished difference Result 461 states and 749 transitions. [2023-12-20 02:42:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:11,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-12-20 02:42:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:11,521 INFO L225 Difference]: With dead ends: 461 [2023-12-20 02:42:11,521 INFO L226 Difference]: Without dead ends: 392 [2023-12-20 02:42:11,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:11,529 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 821 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:11,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 843 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 02:42:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-20 02:42:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 230. [2023-12-20 02:42:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5109170305676856) internal successors, (346), 229 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 346 transitions. [2023-12-20 02:42:11,588 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 346 transitions. Word has length 47 [2023-12-20 02:42:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:11,588 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 346 transitions. [2023-12-20 02:42:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 346 transitions. [2023-12-20 02:42:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 02:42:11,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:11,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:11,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 02:42:11,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:11,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash -375563424, now seen corresponding path program 1 times [2023-12-20 02:42:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511033817] [2023-12-20 02:42:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:11,699 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 02:42:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511033817] [2023-12-20 02:42:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511033817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:11,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108475361] [2023-12-20 02:42:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:11,706 INFO L87 Difference]: Start difference. First operand 230 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:11,727 INFO L93 Difference]: Finished difference Result 568 states and 874 transitions. [2023-12-20 02:42:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-20 02:42:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:11,730 INFO L225 Difference]: With dead ends: 568 [2023-12-20 02:42:11,730 INFO L226 Difference]: Without dead ends: 400 [2023-12-20 02:42:11,731 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 02:42:11,732 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 143 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:11,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-20 02:42:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2023-12-20 02:42:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.513853904282116) internal successors, (601), 397 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 601 transitions. [2023-12-20 02:42:11,751 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 601 transitions. Word has length 50 [2023-12-20 02:42:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:11,751 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 601 transitions. [2023-12-20 02:42:11,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 601 transitions. [2023-12-20 02:42:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 02:42:11,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:11,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 02:42:11,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:11,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash -44113567, now seen corresponding path program 1 times [2023-12-20 02:42:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:11,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037781613] [2023-12-20 02:42:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:11,856 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 02:42:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037781613] [2023-12-20 02:42:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037781613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147083699] [2023-12-20 02:42:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:11,860 INFO L87 Difference]: Start difference. First operand 398 states and 601 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:11,879 INFO L93 Difference]: Finished difference Result 978 states and 1497 transitions. [2023-12-20 02:42:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-20 02:42:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:11,881 INFO L225 Difference]: With dead ends: 978 [2023-12-20 02:42:11,881 INFO L226 Difference]: Without dead ends: 690 [2023-12-20 02:42:11,885 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 02:42:11,887 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 130 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:11,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-12-20 02:42:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2023-12-20 02:42:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.5036390101892285) internal successors, (1033), 687 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1033 transitions. [2023-12-20 02:42:11,899 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1033 transitions. Word has length 50 [2023-12-20 02:42:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:11,903 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1033 transitions. [2023-12-20 02:42:11,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1033 transitions. [2023-12-20 02:42:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 02:42:11,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:11,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:11,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 02:42:11,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:11,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1648416127, now seen corresponding path program 1 times [2023-12-20 02:42:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815756431] [2023-12-20 02:42:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:11,956 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 02:42:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815756431] [2023-12-20 02:42:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815756431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732181873] [2023-12-20 02:42:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:11,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:11,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:11,957 INFO L87 Difference]: Start difference. First operand 688 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:11,988 INFO L93 Difference]: Finished difference Result 1810 states and 2728 transitions. [2023-12-20 02:42:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-20 02:42:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:11,992 INFO L225 Difference]: With dead ends: 1810 [2023-12-20 02:42:11,993 INFO L226 Difference]: Without dead ends: 1208 [2023-12-20 02:42:11,993 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 02:42:11,995 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2023-12-20 02:42:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2023-12-20 02:42:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1205 states have (on average 1.467219917012448) internal successors, (1768), 1205 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1768 transitions. [2023-12-20 02:42:12,016 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1768 transitions. Word has length 50 [2023-12-20 02:42:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:12,016 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1768 transitions. [2023-12-20 02:42:12,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1768 transitions. [2023-12-20 02:42:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 02:42:12,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:12,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:12,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 02:42:12,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:12,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 123430489, now seen corresponding path program 1 times [2023-12-20 02:42:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303745385] [2023-12-20 02:42:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:12,116 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 02:42:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303745385] [2023-12-20 02:42:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303745385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:12,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 02:42:12,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128528964] [2023-12-20 02:42:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:12,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:12,118 INFO L87 Difference]: Start difference. First operand 1206 states and 1768 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:12,187 INFO L93 Difference]: Finished difference Result 2346 states and 3505 transitions. [2023-12-20 02:42:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-20 02:42:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:12,194 INFO L225 Difference]: With dead ends: 2346 [2023-12-20 02:42:12,194 INFO L226 Difference]: Without dead ends: 2000 [2023-12-20 02:42:12,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:12,196 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 562 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:12,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 892 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2023-12-20 02:42:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1610. [2023-12-20 02:42:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 1.4748290863890616) internal successors, (2373), 1609 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2373 transitions. [2023-12-20 02:42:12,226 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2373 transitions. Word has length 51 [2023-12-20 02:42:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:12,226 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2373 transitions. [2023-12-20 02:42:12,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2373 transitions. [2023-12-20 02:42:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 02:42:12,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:12,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:12,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 02:42:12,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:12,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash -42268309, now seen corresponding path program 1 times [2023-12-20 02:42:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:12,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900251038] [2023-12-20 02:42:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:12,309 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 02:42:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900251038] [2023-12-20 02:42:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900251038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:12,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 02:42:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311879419] [2023-12-20 02:42:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:12,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:12,311 INFO L87 Difference]: Start difference. First operand 1610 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:12,383 INFO L93 Difference]: Finished difference Result 2720 states and 4065 transitions. [2023-12-20 02:42:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-20 02:42:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:12,390 INFO L225 Difference]: With dead ends: 2720 [2023-12-20 02:42:12,390 INFO L226 Difference]: Without dead ends: 2374 [2023-12-20 02:42:12,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:12,391 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 566 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:12,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 926 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2023-12-20 02:42:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1920. [2023-12-20 02:42:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1919 states have (on average 1.4804585721730068) internal successors, (2841), 1919 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2841 transitions. [2023-12-20 02:42:12,442 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2841 transitions. Word has length 51 [2023-12-20 02:42:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:12,442 INFO L495 AbstractCegarLoop]: Abstraction has 1920 states and 2841 transitions. [2023-12-20 02:42:12,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2841 transitions. [2023-12-20 02:42:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 02:42:12,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:12,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:12,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 02:42:12,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:12,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2011229715, now seen corresponding path program 1 times [2023-12-20 02:42:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803602975] [2023-12-20 02:42:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:12,515 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 02:42:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803602975] [2023-12-20 02:42:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803602975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 02:42:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186503970] [2023-12-20 02:42:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:12,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:12,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:12,516 INFO L87 Difference]: Start difference. First operand 1920 states and 2841 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:12,579 INFO L93 Difference]: Finished difference Result 3134 states and 4686 transitions. [2023-12-20 02:42:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-20 02:42:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:12,586 INFO L225 Difference]: With dead ends: 3134 [2023-12-20 02:42:12,586 INFO L226 Difference]: Without dead ends: 2788 [2023-12-20 02:42:12,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:12,587 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 570 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:12,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1001 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2023-12-20 02:42:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2215. [2023-12-20 02:42:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 1.485546522131888) internal successors, (3289), 2214 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3289 transitions. [2023-12-20 02:42:12,618 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3289 transitions. Word has length 52 [2023-12-20 02:42:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:12,619 INFO L495 AbstractCegarLoop]: Abstraction has 2215 states and 3289 transitions. [2023-12-20 02:42:12,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3289 transitions. [2023-12-20 02:42:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 02:42:12,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:12,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:12,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 02:42:12,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:12,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 817234416, now seen corresponding path program 1 times [2023-12-20 02:42:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890004819] [2023-12-20 02:42:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:12,682 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 02:42:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890004819] [2023-12-20 02:42:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890004819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 02:42:12,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938299208] [2023-12-20 02:42:12,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:12,683 INFO L87 Difference]: Start difference. First operand 2215 states and 3289 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:12,811 INFO L93 Difference]: Finished difference Result 5193 states and 7715 transitions. [2023-12-20 02:42:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-20 02:42:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:12,819 INFO L225 Difference]: With dead ends: 5193 [2023-12-20 02:42:12,819 INFO L226 Difference]: Without dead ends: 3054 [2023-12-20 02:42:12,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:12,822 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 774 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:12,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 211 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 02:42:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2023-12-20 02:42:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 3036. [2023-12-20 02:42:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 1.4721581548599671) internal successors, (4468), 3035 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4468 transitions. [2023-12-20 02:42:12,864 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4468 transitions. Word has length 55 [2023-12-20 02:42:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:12,864 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 4468 transitions. [2023-12-20 02:42:12,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4468 transitions. [2023-12-20 02:42:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 02:42:12,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:12,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:12,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 02:42:12,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:12,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1475033810, now seen corresponding path program 1 times [2023-12-20 02:42:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196872083] [2023-12-20 02:42:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:12,929 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 02:42:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196872083] [2023-12-20 02:42:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196872083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 02:42:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028625604] [2023-12-20 02:42:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:12,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:12,931 INFO L87 Difference]: Start difference. First operand 3036 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:13,070 INFO L93 Difference]: Finished difference Result 7095 states and 10424 transitions. [2023-12-20 02:42:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-20 02:42:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:13,081 INFO L225 Difference]: With dead ends: 7095 [2023-12-20 02:42:13,082 INFO L226 Difference]: Without dead ends: 4144 [2023-12-20 02:42:13,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:13,087 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 806 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:13,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 199 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 02:42:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2023-12-20 02:42:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 3036. [2023-12-20 02:42:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 1.4556836902800658) internal successors, (4418), 3035 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4418 transitions. [2023-12-20 02:42:13,144 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4418 transitions. Word has length 56 [2023-12-20 02:42:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:13,144 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 4418 transitions. [2023-12-20 02:42:13,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4418 transitions. [2023-12-20 02:42:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 02:42:13,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:13,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:13,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 02:42:13,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:13,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 235925500, now seen corresponding path program 1 times [2023-12-20 02:42:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630022171] [2023-12-20 02:42:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:13,212 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 02:42:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630022171] [2023-12-20 02:42:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630022171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 02:42:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027988874] [2023-12-20 02:42:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:13,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:13,213 INFO L87 Difference]: Start difference. First operand 3036 states and 4418 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:13,341 INFO L93 Difference]: Finished difference Result 7241 states and 10531 transitions. [2023-12-20 02:42:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-20 02:42:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:13,352 INFO L225 Difference]: With dead ends: 7241 [2023-12-20 02:42:13,352 INFO L226 Difference]: Without dead ends: 4245 [2023-12-20 02:42:13,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:13,355 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 783 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:13,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 209 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 02:42:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2023-12-20 02:42:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4220. [2023-12-20 02:42:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4219 states have (on average 1.4418108556529983) internal successors, (6083), 4219 states have internal predecessors, (6083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6083 transitions. [2023-12-20 02:42:13,414 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6083 transitions. Word has length 56 [2023-12-20 02:42:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:13,415 INFO L495 AbstractCegarLoop]: Abstraction has 4220 states and 6083 transitions. [2023-12-20 02:42:13,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6083 transitions. [2023-12-20 02:42:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 02:42:13,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:13,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:13,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 02:42:13,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:13,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1475937801, now seen corresponding path program 1 times [2023-12-20 02:42:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:13,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245022674] [2023-12-20 02:42:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:13,505 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 02:42:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245022674] [2023-12-20 02:42:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245022674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:13,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 02:42:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601588514] [2023-12-20 02:42:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:13,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 02:42:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 02:42:13,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:13,507 INFO L87 Difference]: Start difference. First operand 4220 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:13,874 INFO L93 Difference]: Finished difference Result 17864 states and 25674 transitions. [2023-12-20 02:42:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 02:42:13,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-20 02:42:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:13,918 INFO L225 Difference]: With dead ends: 17864 [2023-12-20 02:42:13,918 INFO L226 Difference]: Without dead ends: 16494 [2023-12-20 02:42:13,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-20 02:42:13,925 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 2547 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2547 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2547 Valid, 389 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:42:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2023-12-20 02:42:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 4232. [2023-12-20 02:42:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4231 states have (on average 1.4415031907350508) internal successors, (6099), 4231 states have internal predecessors, (6099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6099 transitions. [2023-12-20 02:42:14,047 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6099 transitions. Word has length 57 [2023-12-20 02:42:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:14,047 INFO L495 AbstractCegarLoop]: Abstraction has 4232 states and 6099 transitions. [2023-12-20 02:42:14,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6099 transitions. [2023-12-20 02:42:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 02:42:14,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:14,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:14,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 02:42:14,050 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:14,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -349521333, now seen corresponding path program 1 times [2023-12-20 02:42:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:14,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783644662] [2023-12-20 02:42:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:14,123 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 02:42:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783644662] [2023-12-20 02:42:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783644662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 02:42:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315016427] [2023-12-20 02:42:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 02:42:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 02:42:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:14,125 INFO L87 Difference]: Start difference. First operand 4232 states and 6099 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:14,408 INFO L93 Difference]: Finished difference Result 16287 states and 23326 transitions. [2023-12-20 02:42:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 02:42:14,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-20 02:42:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:14,427 INFO L225 Difference]: With dead ends: 16287 [2023-12-20 02:42:14,427 INFO L226 Difference]: Without dead ends: 14073 [2023-12-20 02:42:14,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-20 02:42:14,433 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1908 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 331 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:42:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14073 states. [2023-12-20 02:42:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14073 to 4252. [2023-12-20 02:42:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 4251 states have (on average 1.4403669724770642) internal successors, (6123), 4251 states have internal predecessors, (6123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 6123 transitions. [2023-12-20 02:42:14,542 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 6123 transitions. Word has length 58 [2023-12-20 02:42:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:14,542 INFO L495 AbstractCegarLoop]: Abstraction has 4252 states and 6123 transitions. [2023-12-20 02:42:14,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 6123 transitions. [2023-12-20 02:42:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 02:42:14,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:14,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:14,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 02:42:14,545 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:14,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1946389460, now seen corresponding path program 1 times [2023-12-20 02:42:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552663414] [2023-12-20 02:42:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:14,618 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 02:42:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552663414] [2023-12-20 02:42:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552663414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 02:42:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861673256] [2023-12-20 02:42:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 02:42:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 02:42:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 02:42:14,620 INFO L87 Difference]: Start difference. First operand 4252 states and 6123 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:14,924 INFO L93 Difference]: Finished difference Result 19116 states and 27393 transitions. [2023-12-20 02:42:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 02:42:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-20 02:42:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:14,946 INFO L225 Difference]: With dead ends: 19116 [2023-12-20 02:42:14,946 INFO L226 Difference]: Without dead ends: 17074 [2023-12-20 02:42:14,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-20 02:42:14,952 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 2147 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:14,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 371 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:42:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17074 states. [2023-12-20 02:42:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17074 to 4330. [2023-12-20 02:42:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.4375144375144375) internal successors, (6223), 4329 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6223 transitions. [2023-12-20 02:42:15,067 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6223 transitions. Word has length 58 [2023-12-20 02:42:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:15,067 INFO L495 AbstractCegarLoop]: Abstraction has 4330 states and 6223 transitions. [2023-12-20 02:42:15,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6223 transitions. [2023-12-20 02:42:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 02:42:15,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:15,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:15,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 02:42:15,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:15,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1193614241, now seen corresponding path program 1 times [2023-12-20 02:42:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479153228] [2023-12-20 02:42:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:15,271 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 02:42:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479153228] [2023-12-20 02:42:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479153228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 02:42:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315232815] [2023-12-20 02:42:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:15,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 02:42:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 02:42:15,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 02:42:15,273 INFO L87 Difference]: Start difference. First operand 4330 states and 6223 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:16,024 INFO L93 Difference]: Finished difference Result 14785 states and 21199 transitions. [2023-12-20 02:42:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 02:42:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-20 02:42:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:16,038 INFO L225 Difference]: With dead ends: 14785 [2023-12-20 02:42:16,039 INFO L226 Difference]: Without dead ends: 11208 [2023-12-20 02:42:16,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2023-12-20 02:42:16,045 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1661 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:16,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 1114 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 02:42:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11208 states. [2023-12-20 02:42:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11208 to 4330. [2023-12-20 02:42:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.436128436128436) internal successors, (6217), 4329 states have internal predecessors, (6217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6217 transitions. [2023-12-20 02:42:16,125 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6217 transitions. Word has length 60 [2023-12-20 02:42:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:16,125 INFO L495 AbstractCegarLoop]: Abstraction has 4330 states and 6217 transitions. [2023-12-20 02:42:16,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6217 transitions. [2023-12-20 02:42:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 02:42:16,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:16,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:16,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 02:42:16,127 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:16,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1573545695, now seen corresponding path program 1 times [2023-12-20 02:42:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949847714] [2023-12-20 02:42:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:16,324 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 02:42:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949847714] [2023-12-20 02:42:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949847714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 02:42:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872855150] [2023-12-20 02:42:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:16,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 02:42:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:16,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 02:42:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 02:42:16,326 INFO L87 Difference]: Start difference. First operand 4330 states and 6217 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:17,077 INFO L93 Difference]: Finished difference Result 14336 states and 20584 transitions. [2023-12-20 02:42:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 02:42:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-20 02:42:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:17,093 INFO L225 Difference]: With dead ends: 14336 [2023-12-20 02:42:17,093 INFO L226 Difference]: Without dead ends: 10892 [2023-12-20 02:42:17,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2023-12-20 02:42:17,099 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 1732 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:17,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 1093 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 02:42:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10892 states. [2023-12-20 02:42:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10892 to 4248. [2023-12-20 02:42:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 4247 states have (on average 1.4325406169060513) internal successors, (6084), 4247 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 6084 transitions. [2023-12-20 02:42:17,168 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 6084 transitions. Word has length 60 [2023-12-20 02:42:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:17,169 INFO L495 AbstractCegarLoop]: Abstraction has 4248 states and 6084 transitions. [2023-12-20 02:42:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 6084 transitions. [2023-12-20 02:42:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 02:42:17,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:17,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 02:42:17,171 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:17,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1904995552, now seen corresponding path program 1 times [2023-12-20 02:42:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412378610] [2023-12-20 02:42:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:17,373 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 02:42:17,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:17,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412378610] [2023-12-20 02:42:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412378610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:17,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:17,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 02:42:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126015117] [2023-12-20 02:42:17,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:17,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 02:42:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 02:42:17,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-20 02:42:17,374 INFO L87 Difference]: Start difference. First operand 4248 states and 6084 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:18,089 INFO L93 Difference]: Finished difference Result 14863 states and 21311 transitions. [2023-12-20 02:42:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 02:42:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-20 02:42:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:18,103 INFO L225 Difference]: With dead ends: 14863 [2023-12-20 02:42:18,103 INFO L226 Difference]: Without dead ends: 11291 [2023-12-20 02:42:18,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2023-12-20 02:42:18,108 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 1517 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:18,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1205 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 02:42:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2023-12-20 02:42:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 4073. [2023-12-20 02:42:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4072 states have (on average 1.4287819253438114) internal successors, (5818), 4072 states have internal predecessors, (5818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5818 transitions. [2023-12-20 02:42:18,174 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5818 transitions. Word has length 60 [2023-12-20 02:42:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:18,174 INFO L495 AbstractCegarLoop]: Abstraction has 4073 states and 5818 transitions. [2023-12-20 02:42:18,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5818 transitions. [2023-12-20 02:42:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 02:42:18,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:18,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:18,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 02:42:18,177 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:18,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1386526584, now seen corresponding path program 1 times [2023-12-20 02:42:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:18,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147101540] [2023-12-20 02:42:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:18,208 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 02:42:18,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147101540] [2023-12-20 02:42:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147101540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:18,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617514758] [2023-12-20 02:42:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:18,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:18,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:18,210 INFO L87 Difference]: Start difference. First operand 4073 states and 5818 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:18,242 INFO L93 Difference]: Finished difference Result 6079 states and 8709 transitions. [2023-12-20 02:42:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:18,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-20 02:42:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:18,247 INFO L225 Difference]: With dead ends: 6079 [2023-12-20 02:42:18,247 INFO L226 Difference]: Without dead ends: 3966 [2023-12-20 02:42:18,249 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 02:42:18,249 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 132 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:18,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 474 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2023-12-20 02:42:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3964. [2023-12-20 02:42:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3963 states have (on average 1.4130709058793842) internal successors, (5600), 3963 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 5600 transitions. [2023-12-20 02:42:18,279 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 5600 transitions. Word has length 61 [2023-12-20 02:42:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:18,279 INFO L495 AbstractCegarLoop]: Abstraction has 3964 states and 5600 transitions. [2023-12-20 02:42:18,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 5600 transitions. [2023-12-20 02:42:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 02:42:18,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:18,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:18,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 02:42:18,281 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:18,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 163801939, now seen corresponding path program 1 times [2023-12-20 02:42:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215368786] [2023-12-20 02:42:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:18,318 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 02:42:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215368786] [2023-12-20 02:42:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215368786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17384634] [2023-12-20 02:42:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:18,319 INFO L87 Difference]: Start difference. First operand 3964 states and 5600 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:18,337 INFO L93 Difference]: Finished difference Result 5466 states and 7721 transitions. [2023-12-20 02:42:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-20 02:42:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:18,344 INFO L225 Difference]: With dead ends: 5466 [2023-12-20 02:42:18,345 INFO L226 Difference]: Without dead ends: 3371 [2023-12-20 02:42:18,347 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 02:42:18,347 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 120 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:18,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 463 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2023-12-20 02:42:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3369. [2023-12-20 02:42:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.3865795724465557) internal successors, (4670), 3368 states have internal predecessors, (4670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4670 transitions. [2023-12-20 02:42:18,374 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4670 transitions. Word has length 61 [2023-12-20 02:42:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:18,374 INFO L495 AbstractCegarLoop]: Abstraction has 3369 states and 4670 transitions. [2023-12-20 02:42:18,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4670 transitions. [2023-12-20 02:42:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 02:42:18,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:18,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:18,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 02:42:18,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:18,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1149979677, now seen corresponding path program 1 times [2023-12-20 02:42:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:18,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108462308] [2023-12-20 02:42:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:18,405 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 02:42:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108462308] [2023-12-20 02:42:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108462308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463767245] [2023-12-20 02:42:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:18,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:18,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:18,407 INFO L87 Difference]: Start difference. First operand 3369 states and 4670 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:18,428 INFO L93 Difference]: Finished difference Result 4118 states and 5685 transitions. [2023-12-20 02:42:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-20 02:42:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:18,431 INFO L225 Difference]: With dead ends: 4118 [2023-12-20 02:42:18,431 INFO L226 Difference]: Without dead ends: 2781 [2023-12-20 02:42:18,432 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 02:42:18,432 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:18,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 479 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2023-12-20 02:42:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2779. [2023-12-20 02:42:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2778 states have (on average 1.3538516918646508) internal successors, (3761), 2778 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3761 transitions. [2023-12-20 02:42:18,455 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3761 transitions. Word has length 61 [2023-12-20 02:42:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:18,455 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 3761 transitions. [2023-12-20 02:42:18,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3761 transitions. [2023-12-20 02:42:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 02:42:18,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:18,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:18,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 02:42:18,456 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:18,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1379218415, now seen corresponding path program 1 times [2023-12-20 02:42:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260825869] [2023-12-20 02:42:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:18,888 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 02:42:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260825869] [2023-12-20 02:42:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260825869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:18,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:18,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 02:42:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103492200] [2023-12-20 02:42:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:18,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 02:42:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:18,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 02:42:18,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-20 02:42:18,891 INFO L87 Difference]: Start difference. First operand 2779 states and 3761 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:19,754 INFO L93 Difference]: Finished difference Result 5775 states and 7912 transitions. [2023-12-20 02:42:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 02:42:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-20 02:42:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:19,762 INFO L225 Difference]: With dead ends: 5775 [2023-12-20 02:42:19,762 INFO L226 Difference]: Without dead ends: 5387 [2023-12-20 02:42:19,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2023-12-20 02:42:19,763 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 1652 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:19,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2206 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 02:42:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2023-12-20 02:42:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 2690. [2023-12-20 02:42:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2689 states have (on average 1.3536630717738936) internal successors, (3640), 2689 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3640 transitions. [2023-12-20 02:42:19,808 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3640 transitions. Word has length 62 [2023-12-20 02:42:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:19,808 INFO L495 AbstractCegarLoop]: Abstraction has 2690 states and 3640 transitions. [2023-12-20 02:42:19,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3640 transitions. [2023-12-20 02:42:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 02:42:19,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:19,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:19,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 02:42:19,811 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:19,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -657539413, now seen corresponding path program 1 times [2023-12-20 02:42:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788182807] [2023-12-20 02:42:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:20,239 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 02:42:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788182807] [2023-12-20 02:42:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788182807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 02:42:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292836762] [2023-12-20 02:42:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:20,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 02:42:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 02:42:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-20 02:42:20,241 INFO L87 Difference]: Start difference. First operand 2690 states and 3640 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:21,293 INFO L93 Difference]: Finished difference Result 6768 states and 9274 transitions. [2023-12-20 02:42:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 02:42:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-20 02:42:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:21,300 INFO L225 Difference]: With dead ends: 6768 [2023-12-20 02:42:21,301 INFO L226 Difference]: Without dead ends: 6404 [2023-12-20 02:42:21,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2023-12-20 02:42:21,307 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 1800 mSDsluCounter, 3071 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:21,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 3501 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 02:42:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2023-12-20 02:42:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 2605. [2023-12-20 02:42:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2604 states have (on average 1.3533026113671276) internal successors, (3524), 2604 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3524 transitions. [2023-12-20 02:42:21,348 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3524 transitions. Word has length 62 [2023-12-20 02:42:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:21,348 INFO L495 AbstractCegarLoop]: Abstraction has 2605 states and 3524 transitions. [2023-12-20 02:42:21,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3524 transitions. [2023-12-20 02:42:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-20 02:42:21,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:21,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:21,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 02:42:21,351 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:21,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2050966729, now seen corresponding path program 1 times [2023-12-20 02:42:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447096098] [2023-12-20 02:42:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:21,407 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 02:42:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447096098] [2023-12-20 02:42:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447096098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:21,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 02:42:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579923351] [2023-12-20 02:42:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:21,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 02:42:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 02:42:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:21,408 INFO L87 Difference]: Start difference. First operand 2605 states and 3524 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:21,450 INFO L93 Difference]: Finished difference Result 2611 states and 3527 transitions. [2023-12-20 02:42:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:42:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-12-20 02:42:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:21,453 INFO L225 Difference]: With dead ends: 2611 [2023-12-20 02:42:21,453 INFO L226 Difference]: Without dead ends: 2385 [2023-12-20 02:42:21,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 02:42:21,455 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 515 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:21,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 627 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2023-12-20 02:42:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2381. [2023-12-20 02:42:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.3550420168067228) internal successors, (3225), 2380 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3225 transitions. [2023-12-20 02:42:21,477 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3225 transitions. Word has length 64 [2023-12-20 02:42:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:21,477 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3225 transitions. [2023-12-20 02:42:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3225 transitions. [2023-12-20 02:42:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 02:42:21,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:21,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:21,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 02:42:21,479 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:21,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash 942548057, now seen corresponding path program 1 times [2023-12-20 02:42:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:21,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494487883] [2023-12-20 02:42:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:21,542 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 02:42:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494487883] [2023-12-20 02:42:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494487883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698596538] [2023-12-20 02:42:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:21,544 INFO L87 Difference]: Start difference. First operand 2381 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:21,560 INFO L93 Difference]: Finished difference Result 5820 states and 8009 transitions. [2023-12-20 02:42:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-20 02:42:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:21,564 INFO L225 Difference]: With dead ends: 5820 [2023-12-20 02:42:21,564 INFO L226 Difference]: Without dead ends: 4023 [2023-12-20 02:42:21,566 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 02:42:21,567 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 103 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:21,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 411 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2023-12-20 02:42:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 3755. [2023-12-20 02:42:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.363612147043154) internal successors, (5119), 3754 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5119 transitions. [2023-12-20 02:42:21,599 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5119 transitions. Word has length 67 [2023-12-20 02:42:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:21,599 INFO L495 AbstractCegarLoop]: Abstraction has 3755 states and 5119 transitions. [2023-12-20 02:42:21,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5119 transitions. [2023-12-20 02:42:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-20 02:42:21,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:21,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:21,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-20 02:42:21,604 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:21,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1222049860, now seen corresponding path program 1 times [2023-12-20 02:42:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695279475] [2023-12-20 02:42:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:21,653 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 02:42:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695279475] [2023-12-20 02:42:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695279475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:21,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545084789] [2023-12-20 02:42:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:21,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:21,656 INFO L87 Difference]: Start difference. First operand 3755 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:21,678 INFO L93 Difference]: Finished difference Result 9787 states and 13453 transitions. [2023-12-20 02:42:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:21,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-12-20 02:42:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:21,689 INFO L225 Difference]: With dead ends: 9787 [2023-12-20 02:42:21,689 INFO L226 Difference]: Without dead ends: 6616 [2023-12-20 02:42:21,693 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 02:42:21,693 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 92 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:21,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2023-12-20 02:42:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 6082. [2023-12-20 02:42:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6082 states, 6081 states have (on average 1.363427067916461) internal successors, (8291), 6081 states have internal predecessors, (8291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 8291 transitions. [2023-12-20 02:42:21,765 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 8291 transitions. Word has length 68 [2023-12-20 02:42:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:21,765 INFO L495 AbstractCegarLoop]: Abstraction has 6082 states and 8291 transitions. [2023-12-20 02:42:21,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 8291 transitions. [2023-12-20 02:42:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-20 02:42:21,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:21,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:21,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-20 02:42:21,767 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:21,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 580845370, now seen corresponding path program 1 times [2023-12-20 02:42:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213713718] [2023-12-20 02:42:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:21,870 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 02:42:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213713718] [2023-12-20 02:42:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213713718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:21,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:21,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 02:42:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420719295] [2023-12-20 02:42:21,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:21,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 02:42:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:21,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 02:42:21,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 02:42:21,871 INFO L87 Difference]: Start difference. First operand 6082 states and 8291 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:21,930 INFO L93 Difference]: Finished difference Result 12862 states and 17293 transitions. [2023-12-20 02:42:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 02:42:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-12-20 02:42:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:21,944 INFO L225 Difference]: With dead ends: 12862 [2023-12-20 02:42:21,944 INFO L226 Difference]: Without dead ends: 12860 [2023-12-20 02:42:21,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-20 02:42:21,948 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 312 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:21,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 993 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2023-12-20 02:42:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 6574. [2023-12-20 02:42:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6574 states, 6573 states have (on average 1.3362239464475887) internal successors, (8783), 6573 states have internal predecessors, (8783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6574 states to 6574 states and 8783 transitions. [2023-12-20 02:42:22,034 INFO L78 Accepts]: Start accepts. Automaton has 6574 states and 8783 transitions. Word has length 71 [2023-12-20 02:42:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:22,034 INFO L495 AbstractCegarLoop]: Abstraction has 6574 states and 8783 transitions. [2023-12-20 02:42:22,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states and 8783 transitions. [2023-12-20 02:42:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-20 02:42:22,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:22,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:22,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-20 02:42:22,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:22,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1426787329, now seen corresponding path program 1 times [2023-12-20 02:42:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543950411] [2023-12-20 02:42:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:22,069 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 02:42:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543950411] [2023-12-20 02:42:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543950411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:22,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112967337] [2023-12-20 02:42:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:22,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:22,071 INFO L87 Difference]: Start difference. First operand 6574 states and 8783 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:22,112 INFO L93 Difference]: Finished difference Result 17170 states and 22930 transitions. [2023-12-20 02:42:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:22,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-20 02:42:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:22,125 INFO L225 Difference]: With dead ends: 17170 [2023-12-20 02:42:22,125 INFO L226 Difference]: Without dead ends: 11088 [2023-12-20 02:42:22,132 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 02:42:22,133 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 122 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:22,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 315 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2023-12-20 02:42:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 10922. [2023-12-20 02:42:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10922 states, 10921 states have (on average 1.3022616976467356) internal successors, (14222), 10921 states have internal predecessors, (14222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 14222 transitions. [2023-12-20 02:42:22,257 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 14222 transitions. Word has length 72 [2023-12-20 02:42:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:22,257 INFO L495 AbstractCegarLoop]: Abstraction has 10922 states and 14222 transitions. [2023-12-20 02:42:22,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 14222 transitions. [2023-12-20 02:42:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-20 02:42:22,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:22,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:42:22,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-20 02:42:22,259 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:22,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1064758803, now seen corresponding path program 1 times [2023-12-20 02:42:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:22,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075069921] [2023-12-20 02:42:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:22,308 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 02:42:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075069921] [2023-12-20 02:42:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075069921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:42:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:42:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:42:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801579828] [2023-12-20 02:42:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:42:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:42:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:42:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:42:22,310 INFO L87 Difference]: Start difference. First operand 10922 states and 14222 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:42:22,368 INFO L93 Difference]: Finished difference Result 27478 states and 35764 transitions. [2023-12-20 02:42:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:42:22,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-12-20 02:42:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:42:22,387 INFO L225 Difference]: With dead ends: 27478 [2023-12-20 02:42:22,387 INFO L226 Difference]: Without dead ends: 17031 [2023-12-20 02:42:22,398 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 02:42:22,398 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 96 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:42:22,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 398 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:42:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17031 states. [2023-12-20 02:42:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17031 to 15445. [2023-12-20 02:42:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15445 states, 15444 states have (on average 1.2905335405335405) internal successors, (19931), 15444 states have internal predecessors, (19931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15445 states to 15445 states and 19931 transitions. [2023-12-20 02:42:22,544 INFO L78 Accepts]: Start accepts. Automaton has 15445 states and 19931 transitions. Word has length 73 [2023-12-20 02:42:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:42:22,544 INFO L495 AbstractCegarLoop]: Abstraction has 15445 states and 19931 transitions. [2023-12-20 02:42:22,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:42:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 15445 states and 19931 transitions. [2023-12-20 02:42:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-20 02:42:22,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:42:22,549 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:42:22,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-20 02:42:22,549 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:42:22,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:42:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1185902139, now seen corresponding path program 1 times [2023-12-20 02:42:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:42:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005835212] [2023-12-20 02:42:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:42:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:42:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:42:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005835212] [2023-12-20 02:42:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005835212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:42:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181216553] [2023-12-20 02:42:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:42:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:42:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:42:22,863 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 02:42:22,910 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 02:42:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:42:22,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 02:42:23,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:42:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:42:23,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:42:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:42:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181216553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:42:24,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:42:24,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 31 [2023-12-20 02:42:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096976421] [2023-12-20 02:42:24,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:42:24,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 02:42:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:42:24,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 02:42:24,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2023-12-20 02:42:24,353 INFO L87 Difference]: Start difference. First operand 15445 states and 19931 transitions. Second operand has 32 states, 32 states have (on average 7.625) internal successors, (244), 31 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:00,611 INFO L93 Difference]: Finished difference Result 186733 states and 236254 transitions. [2023-12-20 02:43:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 473 states. [2023-12-20 02:43:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.625) internal successors, (244), 31 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-20 02:43:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:00,845 INFO L225 Difference]: With dead ends: 186733 [2023-12-20 02:43:00,845 INFO L226 Difference]: Without dead ends: 179023 [2023-12-20 02:43:00,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 501 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119571 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=32544, Invalid=219962, Unknown=0, NotChecked=0, Total=252506 [2023-12-20 02:43:00,899 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 11306 mSDsluCounter, 10212 mSDsCounter, 0 mSdLazyCounter, 9195 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11306 SdHoareTripleChecker+Valid, 10682 SdHoareTripleChecker+Invalid, 9343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 9195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:00,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11306 Valid, 10682 Invalid, 9343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [148 Valid, 9195 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-20 02:43:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179023 states. [2023-12-20 02:43:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179023 to 32176. [2023-12-20 02:43:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32176 states, 32175 states have (on average 1.2914685314685315) internal successors, (41553), 32175 states have internal predecessors, (41553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32176 states to 32176 states and 41553 transitions. [2023-12-20 02:43:01,914 INFO L78 Accepts]: Start accepts. Automaton has 32176 states and 41553 transitions. Word has length 91 [2023-12-20 02:43:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:01,915 INFO L495 AbstractCegarLoop]: Abstraction has 32176 states and 41553 transitions. [2023-12-20 02:43:01,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.625) internal successors, (244), 31 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32176 states and 41553 transitions. [2023-12-20 02:43:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-20 02:43:01,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:01,921 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:43:01,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 02:43:02,126 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,SelfDestructingSolverStorable27 [2023-12-20 02:43:02,126 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:02,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 560481407, now seen corresponding path program 1 times [2023-12-20 02:43:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705017050] [2023-12-20 02:43:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:02,354 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 02:43:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705017050] [2023-12-20 02:43:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705017050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:43:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:43:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 02:43:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974060807] [2023-12-20 02:43:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:43:02,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 02:43:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 02:43:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 02:43:02,356 INFO L87 Difference]: Start difference. First operand 32176 states and 41553 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:03,298 INFO L93 Difference]: Finished difference Result 92649 states and 118439 transitions. [2023-12-20 02:43:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 02:43:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-20 02:43:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:03,389 INFO L225 Difference]: With dead ends: 92649 [2023-12-20 02:43:03,389 INFO L226 Difference]: Without dead ends: 80057 [2023-12-20 02:43:03,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2023-12-20 02:43:03,426 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1175 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1057 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 02:43:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80057 states. [2023-12-20 02:43:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80057 to 46602. [2023-12-20 02:43:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46602 states, 46601 states have (on average 1.289993776957576) internal successors, (60115), 46601 states have internal predecessors, (60115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46602 states to 46602 states and 60115 transitions. [2023-12-20 02:43:04,055 INFO L78 Accepts]: Start accepts. Automaton has 46602 states and 60115 transitions. Word has length 91 [2023-12-20 02:43:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:04,056 INFO L495 AbstractCegarLoop]: Abstraction has 46602 states and 60115 transitions. [2023-12-20 02:43:04,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 46602 states and 60115 transitions. [2023-12-20 02:43:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 02:43:04,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:04,062 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:43:04,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-20 02:43:04,063 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:04,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 997528935, now seen corresponding path program 1 times [2023-12-20 02:43:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473206196] [2023-12-20 02:43:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473206196] [2023-12-20 02:43:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473206196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:43:04,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:43:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:43:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164380085] [2023-12-20 02:43:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:43:04,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:43:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:43:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:43:04,106 INFO L87 Difference]: Start difference. First operand 46602 states and 60115 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:04,557 INFO L93 Difference]: Finished difference Result 92619 states and 119576 transitions. [2023-12-20 02:43:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:43:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-20 02:43:04,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:04,622 INFO L225 Difference]: With dead ends: 92619 [2023-12-20 02:43:04,622 INFO L226 Difference]: Without dead ends: 46604 [2023-12-20 02:43:04,654 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 02:43:04,654 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 88 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:04,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 343 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:43:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46604 states. [2023-12-20 02:43:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46604 to 44891. [2023-12-20 02:43:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44891 states, 44890 states have (on average 1.2710180441078192) internal successors, (57056), 44890 states have internal predecessors, (57056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44891 states to 44891 states and 57056 transitions. [2023-12-20 02:43:05,336 INFO L78 Accepts]: Start accepts. Automaton has 44891 states and 57056 transitions. Word has length 92 [2023-12-20 02:43:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:05,336 INFO L495 AbstractCegarLoop]: Abstraction has 44891 states and 57056 transitions. [2023-12-20 02:43:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44891 states and 57056 transitions. [2023-12-20 02:43:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 02:43:05,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:05,353 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:43:05,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-20 02:43:05,354 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:05,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 32256659, now seen corresponding path program 1 times [2023-12-20 02:43:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:05,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260099347] [2023-12-20 02:43:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260099347] [2023-12-20 02:43:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260099347] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:43:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399835546] [2023-12-20 02:43:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:43:05,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:43:05,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 02:43:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:05,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 02:43:05,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:43:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-20 02:43:06,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 02:43:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399835546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:43:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 02:43:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2023-12-20 02:43:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312305522] [2023-12-20 02:43:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:43:06,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 02:43:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:06,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 02:43:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-20 02:43:06,180 INFO L87 Difference]: Start difference. First operand 44891 states and 57056 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:06,965 INFO L93 Difference]: Finished difference Result 96545 states and 122889 transitions. [2023-12-20 02:43:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 02:43:06,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-20 02:43:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:07,041 INFO L225 Difference]: With dead ends: 96545 [2023-12-20 02:43:07,041 INFO L226 Difference]: Without dead ends: 61395 [2023-12-20 02:43:07,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-12-20 02:43:07,076 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 2038 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:07,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 1620 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:43:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61395 states. [2023-12-20 02:43:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61395 to 48802. [2023-12-20 02:43:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48802 states, 48801 states have (on average 1.2691953033749308) internal successors, (61938), 48801 states have internal predecessors, (61938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48802 states to 48802 states and 61938 transitions. [2023-12-20 02:43:07,661 INFO L78 Accepts]: Start accepts. Automaton has 48802 states and 61938 transitions. Word has length 92 [2023-12-20 02:43:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:07,662 INFO L495 AbstractCegarLoop]: Abstraction has 48802 states and 61938 transitions. [2023-12-20 02:43:07,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 48802 states and 61938 transitions. [2023-12-20 02:43:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 02:43:07,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:07,666 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:43:07,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 02:43:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-20 02:43:07,884 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:07,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2088287275, now seen corresponding path program 1 times [2023-12-20 02:43:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149000558] [2023-12-20 02:43:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:07,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149000558] [2023-12-20 02:43:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149000558] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:43:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154839738] [2023-12-20 02:43:07,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:07,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:43:07,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:43:07,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 02:43:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:08,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 02:43:08,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:43:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:08,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:43:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154839738] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:43:08,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:43:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-20 02:43:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288963468] [2023-12-20 02:43:08,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:43:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 02:43:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 02:43:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 02:43:08,419 INFO L87 Difference]: Start difference. First operand 48802 states and 61938 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:08,684 INFO L93 Difference]: Finished difference Result 142777 states and 179796 transitions. [2023-12-20 02:43:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 02:43:08,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-20 02:43:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:08,794 INFO L225 Difference]: With dead ends: 142777 [2023-12-20 02:43:08,795 INFO L226 Difference]: Without dead ends: 94421 [2023-12-20 02:43:08,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 02:43:08,837 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 311 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1028 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:43:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94421 states. [2023-12-20 02:43:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94421 to 73798. [2023-12-20 02:43:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73798 states, 73797 states have (on average 1.2612707833651775) internal successors, (93078), 73797 states have internal predecessors, (93078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73798 states to 73798 states and 93078 transitions. [2023-12-20 02:43:09,796 INFO L78 Accepts]: Start accepts. Automaton has 73798 states and 93078 transitions. Word has length 92 [2023-12-20 02:43:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:09,796 INFO L495 AbstractCegarLoop]: Abstraction has 73798 states and 93078 transitions. [2023-12-20 02:43:09,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 73798 states and 93078 transitions. [2023-12-20 02:43:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 02:43:09,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:09,803 INFO L195 NwaCegarLoop]: trace histogram [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 02:43:09,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 02:43:10,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:10,009 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:10,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1460878145, now seen corresponding path program 1 times [2023-12-20 02:43:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903016485] [2023-12-20 02:43:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903016485] [2023-12-20 02:43:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903016485] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:43:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123936836] [2023-12-20 02:43:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:43:10,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:43:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 02:43:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:10,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 02:43:10,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:43:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:10,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:43:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123936836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:43:10,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:43:10,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-12-20 02:43:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96754871] [2023-12-20 02:43:10,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:43:10,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 02:43:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 02:43:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-20 02:43:10,695 INFO L87 Difference]: Start difference. First operand 73798 states and 93078 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:11,475 INFO L93 Difference]: Finished difference Result 157904 states and 198733 transitions. [2023-12-20 02:43:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 02:43:11,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-20 02:43:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:11,572 INFO L225 Difference]: With dead ends: 157904 [2023-12-20 02:43:11,572 INFO L226 Difference]: Without dead ends: 84513 [2023-12-20 02:43:11,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-12-20 02:43:11,619 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 2726 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:11,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 807 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 02:43:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84513 states. [2023-12-20 02:43:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84513 to 59755. [2023-12-20 02:43:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59755 states, 59754 states have (on average 1.24150684473006) internal successors, (74185), 59754 states have internal predecessors, (74185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59755 states to 59755 states and 74185 transitions. [2023-12-20 02:43:12,449 INFO L78 Accepts]: Start accepts. Automaton has 59755 states and 74185 transitions. Word has length 99 [2023-12-20 02:43:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:12,449 INFO L495 AbstractCegarLoop]: Abstraction has 59755 states and 74185 transitions. [2023-12-20 02:43:12,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 59755 states and 74185 transitions. [2023-12-20 02:43:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 02:43:12,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:12,456 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 02:43:12,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 02:43:12,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:12,661 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:12,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2001168869, now seen corresponding path program 1 times [2023-12-20 02:43:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245110933] [2023-12-20 02:43:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245110933] [2023-12-20 02:43:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245110933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:43:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932291957] [2023-12-20 02:43:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:43:12,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:43:12,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 02:43:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:12,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 02:43:12,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:43:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:13,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:43:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932291957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:43:13,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:43:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-12-20 02:43:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264573309] [2023-12-20 02:43:13,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:43:13,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 02:43:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 02:43:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-20 02:43:13,343 INFO L87 Difference]: Start difference. First operand 59755 states and 74185 transitions. Second operand has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:43:14,008 INFO L93 Difference]: Finished difference Result 131339 states and 162869 transitions. [2023-12-20 02:43:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 02:43:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-20 02:43:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:43:14,085 INFO L225 Difference]: With dead ends: 131339 [2023-12-20 02:43:14,085 INFO L226 Difference]: Without dead ends: 72017 [2023-12-20 02:43:14,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-12-20 02:43:14,104 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1706 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:43:14,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 696 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:43:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72017 states. [2023-12-20 02:43:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72017 to 53297. [2023-12-20 02:43:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53297 states, 53296 states have (on average 1.2158886220354248) internal successors, (64802), 53296 states have internal predecessors, (64802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53297 states to 53297 states and 64802 transitions. [2023-12-20 02:43:14,894 INFO L78 Accepts]: Start accepts. Automaton has 53297 states and 64802 transitions. Word has length 103 [2023-12-20 02:43:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:43:14,895 INFO L495 AbstractCegarLoop]: Abstraction has 53297 states and 64802 transitions. [2023-12-20 02:43:14,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:43:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 53297 states and 64802 transitions. [2023-12-20 02:43:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 02:43:14,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:43:14,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:43:14,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 02:43:15,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-20 02:43:15,105 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:43:15,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:43:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1448035695, now seen corresponding path program 1 times [2023-12-20 02:43:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:43:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849139463] [2023-12-20 02:43:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:43:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:43:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849139463] [2023-12-20 02:43:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849139463] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:43:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162683711] [2023-12-20 02:43:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:43:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:43:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:43:15,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:43:15,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 02:43:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:43:15,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 02:43:15,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:43:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:16,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:43:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:43:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162683711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:43:17,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:43:17,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2023-12-20 02:43:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905551745] [2023-12-20 02:43:17,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:43:17,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-20 02:43:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:43:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-20 02:43:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 02:43:17,053 INFO L87 Difference]: Start difference. First operand 53297 states and 64802 transitions. Second operand has 35 states, 35 states have (on average 8.371428571428572) internal successors, (293), 35 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:21,718 INFO L93 Difference]: Finished difference Result 492699 states and 587739 transitions. [2023-12-20 02:44:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 618 states. [2023-12-20 02:44:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.371428571428572) internal successors, (293), 35 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-20 02:44:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:22,878 INFO L225 Difference]: With dead ends: 492699 [2023-12-20 02:44:22,878 INFO L226 Difference]: Without dead ends: 472528 [2023-12-20 02:44:22,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193806 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=38323, Invalid=384827, Unknown=0, NotChecked=0, Total=423150 [2023-12-20 02:44:23,001 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 17579 mSDsluCounter, 12713 mSDsCounter, 0 mSdLazyCounter, 13215 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17579 SdHoareTripleChecker+Valid, 13178 SdHoareTripleChecker+Invalid, 13419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 13215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:23,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17579 Valid, 13178 Invalid, 13419 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [204 Valid, 13215 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-12-20 02:44:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472528 states. [2023-12-20 02:44:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472528 to 50961. [2023-12-20 02:44:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50961 states, 50960 states have (on average 1.215168759811617) internal successors, (61925), 50960 states have internal predecessors, (61925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50961 states to 50961 states and 61925 transitions. [2023-12-20 02:44:25,270 INFO L78 Accepts]: Start accepts. Automaton has 50961 states and 61925 transitions. Word has length 106 [2023-12-20 02:44:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:25,271 INFO L495 AbstractCegarLoop]: Abstraction has 50961 states and 61925 transitions. [2023-12-20 02:44:25,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.371428571428572) internal successors, (293), 35 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50961 states and 61925 transitions. [2023-12-20 02:44:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 02:44:25,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:25,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:25,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 02:44:25,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:25,482 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:25,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 328696657, now seen corresponding path program 1 times [2023-12-20 02:44:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:25,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296625484] [2023-12-20 02:44:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 02:44:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296625484] [2023-12-20 02:44:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296625484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:44:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 02:44:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681886683] [2023-12-20 02:44:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:25,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 02:44:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 02:44:25,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 02:44:25,524 INFO L87 Difference]: Start difference. First operand 50961 states and 61925 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:25,827 INFO L93 Difference]: Finished difference Result 92517 states and 112264 transitions. [2023-12-20 02:44:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 02:44:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-20 02:44:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:25,910 INFO L225 Difference]: With dead ends: 92517 [2023-12-20 02:44:25,910 INFO L226 Difference]: Without dead ends: 73721 [2023-12-20 02:44:25,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 02:44:25,939 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 349 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:25,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 429 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 02:44:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73721 states. [2023-12-20 02:44:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73721 to 58009. [2023-12-20 02:44:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58009 states, 58008 states have (on average 1.2163322300372363) internal successors, (70557), 58008 states have internal predecessors, (70557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58009 states to 58009 states and 70557 transitions. [2023-12-20 02:44:26,879 INFO L78 Accepts]: Start accepts. Automaton has 58009 states and 70557 transitions. Word has length 106 [2023-12-20 02:44:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:26,879 INFO L495 AbstractCegarLoop]: Abstraction has 58009 states and 70557 transitions. [2023-12-20 02:44:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58009 states and 70557 transitions. [2023-12-20 02:44:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 02:44:26,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:26,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:26,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-20 02:44:26,884 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:26,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1987918070, now seen corresponding path program 1 times [2023-12-20 02:44:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279859368] [2023-12-20 02:44:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279859368] [2023-12-20 02:44:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279859368] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62890940] [2023-12-20 02:44:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:27,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:27,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:27,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 02:44:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:27,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 02:44:27,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:27,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 02:44:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62890940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 02:44:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 25 [2023-12-20 02:44:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563406139] [2023-12-20 02:44:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:27,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 02:44:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 02:44:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2023-12-20 02:44:27,935 INFO L87 Difference]: Start difference. First operand 58009 states and 70557 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:28,526 INFO L93 Difference]: Finished difference Result 109316 states and 133146 transitions. [2023-12-20 02:44:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 02:44:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-20 02:44:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:28,615 INFO L225 Difference]: With dead ends: 109316 [2023-12-20 02:44:28,615 INFO L226 Difference]: Without dead ends: 88257 [2023-12-20 02:44:28,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 02:44:28,646 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 888 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:28,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2888 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:44:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88257 states. [2023-12-20 02:44:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88257 to 72798. [2023-12-20 02:44:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72798 states, 72797 states have (on average 1.2171930161957223) internal successors, (88608), 72797 states have internal predecessors, (88608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72798 states to 72798 states and 88608 transitions. [2023-12-20 02:44:29,587 INFO L78 Accepts]: Start accepts. Automaton has 72798 states and 88608 transitions. Word has length 106 [2023-12-20 02:44:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:29,587 INFO L495 AbstractCegarLoop]: Abstraction has 72798 states and 88608 transitions. [2023-12-20 02:44:29,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72798 states and 88608 transitions. [2023-12-20 02:44:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 02:44:29,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:29,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:29,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 02:44:29,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:29,798 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:29,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 216788115, now seen corresponding path program 1 times [2023-12-20 02:44:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126713387] [2023-12-20 02:44:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126713387] [2023-12-20 02:44:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126713387] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293698497] [2023-12-20 02:44:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:29,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:29,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:29,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:30,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 02:44:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:30,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 02:44:30,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:30,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 02:44:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293698497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 02:44:30,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 20 [2023-12-20 02:44:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954584076] [2023-12-20 02:44:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:30,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 02:44:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 02:44:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-12-20 02:44:30,635 INFO L87 Difference]: Start difference. First operand 72798 states and 88608 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:31,257 INFO L93 Difference]: Finished difference Result 109535 states and 133415 transitions. [2023-12-20 02:44:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 02:44:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-20 02:44:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:31,351 INFO L225 Difference]: With dead ends: 109535 [2023-12-20 02:44:31,351 INFO L226 Difference]: Without dead ends: 88492 [2023-12-20 02:44:31,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2023-12-20 02:44:31,383 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 980 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:31,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 3105 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 02:44:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88492 states. [2023-12-20 02:44:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88492 to 73017. [2023-12-20 02:44:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73017 states, 73016 states have (on average 1.216541579927687) internal successors, (88827), 73016 states have internal predecessors, (88827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73017 states to 73017 states and 88827 transitions. [2023-12-20 02:44:32,243 INFO L78 Accepts]: Start accepts. Automaton has 73017 states and 88827 transitions. Word has length 107 [2023-12-20 02:44:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:32,245 INFO L495 AbstractCegarLoop]: Abstraction has 73017 states and 88827 transitions. [2023-12-20 02:44:32,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 73017 states and 88827 transitions. [2023-12-20 02:44:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 02:44:32,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:32,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:32,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 02:44:32,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-20 02:44:32,456 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:32,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -690477828, now seen corresponding path program 1 times [2023-12-20 02:44:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194052008] [2023-12-20 02:44:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 02:44:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194052008] [2023-12-20 02:44:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194052008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:44:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:44:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121788506] [2023-12-20 02:44:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:32,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:44:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:44:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:44:32,488 INFO L87 Difference]: Start difference. First operand 73017 states and 88827 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:32,772 INFO L93 Difference]: Finished difference Result 140267 states and 170495 transitions. [2023-12-20 02:44:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:44:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-20 02:44:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:33,090 INFO L225 Difference]: With dead ends: 140267 [2023-12-20 02:44:33,090 INFO L226 Difference]: Without dead ends: 67828 [2023-12-20 02:44:33,131 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 02:44:33,132 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 136 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:44:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67828 states. [2023-12-20 02:44:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67828 to 67487. [2023-12-20 02:44:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67487 states, 67486 states have (on average 1.198159618291201) internal successors, (80859), 67486 states have internal predecessors, (80859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67487 states to 67487 states and 80859 transitions. [2023-12-20 02:44:33,914 INFO L78 Accepts]: Start accepts. Automaton has 67487 states and 80859 transitions. Word has length 107 [2023-12-20 02:44:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:33,914 INFO L495 AbstractCegarLoop]: Abstraction has 67487 states and 80859 transitions. [2023-12-20 02:44:33,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67487 states and 80859 transitions. [2023-12-20 02:44:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 02:44:33,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:33,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:33,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-20 02:44:33,920 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:33,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash 180224356, now seen corresponding path program 1 times [2023-12-20 02:44:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:33,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659700974] [2023-12-20 02:44:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:33,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659700974] [2023-12-20 02:44:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659700974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213815997] [2023-12-20 02:44:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:34,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 02:44:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:34,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 02:44:34,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:35,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:44:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213815997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:44:35,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:44:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 37 [2023-12-20 02:44:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730784966] [2023-12-20 02:44:35,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:44:35,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-20 02:44:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-20 02:44:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2023-12-20 02:44:35,775 INFO L87 Difference]: Start difference. First operand 67487 states and 80859 transitions. Second operand has 37 states, 37 states have (on average 7.891891891891892) internal successors, (292), 37 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:37,368 INFO L93 Difference]: Finished difference Result 206153 states and 248390 transitions. [2023-12-20 02:44:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 02:44:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.891891891891892) internal successors, (292), 37 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-20 02:44:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:37,634 INFO L225 Difference]: With dead ends: 206153 [2023-12-20 02:44:37,634 INFO L226 Difference]: Without dead ends: 184378 [2023-12-20 02:44:37,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=461, Invalid=2401, Unknown=0, NotChecked=0, Total=2862 [2023-12-20 02:44:37,689 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 2649 mSDsluCounter, 5015 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2649 SdHoareTripleChecker+Valid, 5368 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:37,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2649 Valid, 5368 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 02:44:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184378 states. [2023-12-20 02:44:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184378 to 67692. [2023-12-20 02:44:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67692 states, 67691 states have (on average 1.1980470077262857) internal successors, (81097), 67691 states have internal predecessors, (81097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67692 states to 67692 states and 81097 transitions. [2023-12-20 02:44:39,050 INFO L78 Accepts]: Start accepts. Automaton has 67692 states and 81097 transitions. Word has length 108 [2023-12-20 02:44:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:39,051 INFO L495 AbstractCegarLoop]: Abstraction has 67692 states and 81097 transitions. [2023-12-20 02:44:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.891891891891892) internal successors, (292), 37 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 67692 states and 81097 transitions. [2023-12-20 02:44:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-20 02:44:39,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:39,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:39,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 02:44:39,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-20 02:44:39,265 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:39,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1176351420, now seen corresponding path program 1 times [2023-12-20 02:44:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722946026] [2023-12-20 02:44:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722946026] [2023-12-20 02:44:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722946026] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373036734] [2023-12-20 02:44:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:39,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:39,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:39,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 02:44:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:39,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-20 02:44:39,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:41,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 02:44:41,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373036734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:41,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 02:44:41,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [20] total 41 [2023-12-20 02:44:41,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503263813] [2023-12-20 02:44:41,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:41,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-20 02:44:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-20 02:44:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2023-12-20 02:44:41,661 INFO L87 Difference]: Start difference. First operand 67692 states and 81097 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:44,912 INFO L93 Difference]: Finished difference Result 106693 states and 127895 transitions. [2023-12-20 02:44:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-20 02:44:44,916 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-20 02:44:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:45,013 INFO L225 Difference]: With dead ends: 106693 [2023-12-20 02:44:45,013 INFO L226 Difference]: Without dead ends: 78952 [2023-12-20 02:44:45,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=590, Invalid=5110, Unknown=0, NotChecked=0, Total=5700 [2023-12-20 02:44:45,045 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 1417 mSDsluCounter, 5608 mSDsCounter, 0 mSdLazyCounter, 3346 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 5992 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:45,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 5992 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3346 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 02:44:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78952 states. [2023-12-20 02:44:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78952 to 66722. [2023-12-20 02:44:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66722 states, 66721 states have (on average 1.1954407158166094) internal successors, (79761), 66721 states have internal predecessors, (79761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66722 states to 66722 states and 79761 transitions. [2023-12-20 02:44:45,778 INFO L78 Accepts]: Start accepts. Automaton has 66722 states and 79761 transitions. Word has length 110 [2023-12-20 02:44:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:45,778 INFO L495 AbstractCegarLoop]: Abstraction has 66722 states and 79761 transitions. [2023-12-20 02:44:45,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 66722 states and 79761 transitions. [2023-12-20 02:44:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-20 02:44:45,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:45,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:45,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-20 02:44:45,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-12-20 02:44:45,993 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:45,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1757181968, now seen corresponding path program 1 times [2023-12-20 02:44:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569208939] [2023-12-20 02:44:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569208939] [2023-12-20 02:44:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569208939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:44:46,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 02:44:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170895104] [2023-12-20 02:44:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:46,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 02:44:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 02:44:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-12-20 02:44:46,499 INFO L87 Difference]: Start difference. First operand 66722 states and 79761 transitions. Second operand has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:48,179 INFO L93 Difference]: Finished difference Result 133996 states and 159933 transitions. [2023-12-20 02:44:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-20 02:44:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-20 02:44:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:48,319 INFO L225 Difference]: With dead ends: 133996 [2023-12-20 02:44:48,320 INFO L226 Difference]: Without dead ends: 113462 [2023-12-20 02:44:48,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=1917, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 02:44:48,347 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 2086 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:48,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 2446 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 02:44:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113462 states. [2023-12-20 02:44:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113462 to 73002. [2023-12-20 02:44:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73002 states, 73001 states have (on average 1.19591512445035) internal successors, (87303), 73001 states have internal predecessors, (87303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73002 states to 73002 states and 87303 transitions. [2023-12-20 02:44:49,257 INFO L78 Accepts]: Start accepts. Automaton has 73002 states and 87303 transitions. Word has length 110 [2023-12-20 02:44:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:49,257 INFO L495 AbstractCegarLoop]: Abstraction has 73002 states and 87303 transitions. [2023-12-20 02:44:49,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73002 states and 87303 transitions. [2023-12-20 02:44:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-20 02:44:49,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:49,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:49,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-20 02:44:49,263 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:49,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2068671527, now seen corresponding path program 1 times [2023-12-20 02:44:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154914543] [2023-12-20 02:44:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154914543] [2023-12-20 02:44:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154914543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:44:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 02:44:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 02:44:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099833497] [2023-12-20 02:44:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:44:49,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 02:44:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 02:44:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 02:44:49,317 INFO L87 Difference]: Start difference. First operand 73002 states and 87303 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:49,762 INFO L93 Difference]: Finished difference Result 94643 states and 112826 transitions. [2023-12-20 02:44:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 02:44:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-20 02:44:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:49,789 INFO L225 Difference]: With dead ends: 94643 [2023-12-20 02:44:49,789 INFO L226 Difference]: Without dead ends: 22284 [2023-12-20 02:44:49,818 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 02:44:49,819 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 65 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:49,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 02:44:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22284 states. [2023-12-20 02:44:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22284 to 22282. [2023-12-20 02:44:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22282 states, 22281 states have (on average 1.1557829540864413) internal successors, (25752), 22281 states have internal predecessors, (25752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22282 states to 22282 states and 25752 transitions. [2023-12-20 02:44:49,997 INFO L78 Accepts]: Start accepts. Automaton has 22282 states and 25752 transitions. Word has length 111 [2023-12-20 02:44:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:49,997 INFO L495 AbstractCegarLoop]: Abstraction has 22282 states and 25752 transitions. [2023-12-20 02:44:49,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 22282 states and 25752 transitions. [2023-12-20 02:44:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-20 02:44:50,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:50,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:50,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-20 02:44:50,000 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:50,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2117066175, now seen corresponding path program 1 times [2023-12-20 02:44:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:50,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128216154] [2023-12-20 02:44:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128216154] [2023-12-20 02:44:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128216154] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778622262] [2023-12-20 02:44:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:50,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:50,473 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 02:44:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:50,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 02:44:50,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:51,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:44:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778622262] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:44:51,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:44:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 32 [2023-12-20 02:44:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952061800] [2023-12-20 02:44:51,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:44:51,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 02:44:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:51,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 02:44:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2023-12-20 02:44:51,706 INFO L87 Difference]: Start difference. First operand 22282 states and 25752 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:44:52,956 INFO L93 Difference]: Finished difference Result 45066 states and 51638 transitions. [2023-12-20 02:44:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-20 02:44:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-20 02:44:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:44:52,991 INFO L225 Difference]: With dead ends: 45066 [2023-12-20 02:44:52,992 INFO L226 Difference]: Without dead ends: 40549 [2023-12-20 02:44:52,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=765, Invalid=2895, Unknown=0, NotChecked=0, Total=3660 [2023-12-20 02:44:52,998 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 2017 mSDsluCounter, 5782 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 6178 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 02:44:52,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 6178 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 02:44:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2023-12-20 02:44:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 23280. [2023-12-20 02:44:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23280 states, 23279 states have (on average 1.1540014605438378) internal successors, (26864), 23279 states have internal predecessors, (26864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23280 states to 23280 states and 26864 transitions. [2023-12-20 02:44:53,232 INFO L78 Accepts]: Start accepts. Automaton has 23280 states and 26864 transitions. Word has length 111 [2023-12-20 02:44:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:44:53,232 INFO L495 AbstractCegarLoop]: Abstraction has 23280 states and 26864 transitions. [2023-12-20 02:44:53,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:44:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 23280 states and 26864 transitions. [2023-12-20 02:44:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-20 02:44:53,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:44:53,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:44:53,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-20 02:44:53,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-12-20 02:44:53,440 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:44:53,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:44:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1286577601, now seen corresponding path program 1 times [2023-12-20 02:44:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:44:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595803038] [2023-12-20 02:44:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:44:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:44:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595803038] [2023-12-20 02:44:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595803038] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:44:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244401431] [2023-12-20 02:44:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:44:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:44:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:44:53,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:44:53,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 02:44:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:44:54,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-20 02:44:54,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:44:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:55,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:44:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:44:57,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244401431] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:44:57,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:44:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-12-20 02:44:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960621054] [2023-12-20 02:44:57,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:44:57,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-20 02:44:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:44:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-20 02:44:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2278, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 02:44:57,058 INFO L87 Difference]: Start difference. First operand 23280 states and 26864 transitions. Second operand has 50 states, 50 states have (on average 6.22) internal successors, (311), 50 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:45:29,367 INFO L93 Difference]: Finished difference Result 69813 states and 79991 transitions. [2023-12-20 02:45:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2023-12-20 02:45:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.22) internal successors, (311), 50 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2023-12-20 02:45:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:45:29,429 INFO L225 Difference]: With dead ends: 69813 [2023-12-20 02:45:29,430 INFO L226 Difference]: Without dead ends: 64242 [2023-12-20 02:45:29,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24653 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=7639, Invalid=66617, Unknown=0, NotChecked=0, Total=74256 [2023-12-20 02:45:29,452 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 6234 mSDsluCounter, 36923 mSDsCounter, 0 mSdLazyCounter, 13945 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6234 SdHoareTripleChecker+Valid, 38307 SdHoareTripleChecker+Invalid, 13984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-12-20 02:45:29,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6234 Valid, 38307 Invalid, 13984 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 13945 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-12-20 02:45:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64242 states. [2023-12-20 02:45:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64242 to 20376. [2023-12-20 02:45:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20376 states, 20375 states have (on average 1.1538650306748466) internal successors, (23510), 20375 states have internal predecessors, (23510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 23510 transitions. [2023-12-20 02:45:29,813 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 23510 transitions. Word has length 112 [2023-12-20 02:45:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:45:29,813 INFO L495 AbstractCegarLoop]: Abstraction has 20376 states and 23510 transitions. [2023-12-20 02:45:29,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.22) internal successors, (311), 50 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 23510 transitions. [2023-12-20 02:45:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-20 02:45:29,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:45:29,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:45:29,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 02:45:30,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-12-20 02:45:30,031 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:45:30,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:45:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash -937767464, now seen corresponding path program 1 times [2023-12-20 02:45:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:45:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818846102] [2023-12-20 02:45:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:45:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:45:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:45:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:45:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:45:30,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818846102] [2023-12-20 02:45:30,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818846102] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:45:30,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343941787] [2023-12-20 02:45:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:45:30,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:45:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:45:30,504 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:45:30,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 02:45:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:45:30,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-20 02:45:30,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:45:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:45:31,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 02:45:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343941787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 02:45:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 02:45:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [21] total 43 [2023-12-20 02:45:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460821205] [2023-12-20 02:45:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 02:45:31,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-20 02:45:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:45:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-20 02:45:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1656, Unknown=0, NotChecked=0, Total=1806 [2023-12-20 02:45:31,885 INFO L87 Difference]: Start difference. First operand 20376 states and 23510 transitions. Second operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:45:33,859 INFO L93 Difference]: Finished difference Result 29167 states and 33589 transitions. [2023-12-20 02:45:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-20 02:45:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-20 02:45:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:45:33,888 INFO L225 Difference]: With dead ends: 29167 [2023-12-20 02:45:33,888 INFO L226 Difference]: Without dead ends: 27363 [2023-12-20 02:45:33,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=714, Invalid=4542, Unknown=0, NotChecked=0, Total=5256 [2023-12-20 02:45:33,896 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 1713 mSDsluCounter, 5157 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 5558 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 02:45:33,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 5558 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 02:45:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27363 states. [2023-12-20 02:45:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27363 to 20355. [2023-12-20 02:45:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20354 states have (on average 1.1536307359732731) internal successors, (23481), 20354 states have internal predecessors, (23481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 23481 transitions. [2023-12-20 02:45:34,084 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 23481 transitions. Word has length 113 [2023-12-20 02:45:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:45:34,084 INFO L495 AbstractCegarLoop]: Abstraction has 20355 states and 23481 transitions. [2023-12-20 02:45:34,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 23481 transitions. [2023-12-20 02:45:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-20 02:45:34,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:45:34,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:45:34,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-20 02:45:34,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-12-20 02:45:34,296 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:45:34,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:45:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1582854041, now seen corresponding path program 1 times [2023-12-20 02:45:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:45:34,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547113086] [2023-12-20 02:45:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:45:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:45:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:45:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:45:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 02:45:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547113086] [2023-12-20 02:45:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547113086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 02:45:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448861189] [2023-12-20 02:45:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:45:34,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:45:34,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 02:45:34,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 02:45:34,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 02:45:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 02:45:34,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 02:45:34,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 02:45:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:45:35,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 02:45:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 02:45:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448861189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 02:45:35,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 02:45:35,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 33 [2023-12-20 02:45:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213282663] [2023-12-20 02:45:35,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 02:45:35,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-20 02:45:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 02:45:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-20 02:45:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2023-12-20 02:45:35,704 INFO L87 Difference]: Start difference. First operand 20355 states and 23481 transitions. Second operand has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 02:45:37,055 INFO L93 Difference]: Finished difference Result 27100 states and 31201 transitions. [2023-12-20 02:45:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 02:45:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-20 02:45:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 02:45:37,077 INFO L225 Difference]: With dead ends: 27100 [2023-12-20 02:45:37,077 INFO L226 Difference]: Without dead ends: 23120 [2023-12-20 02:45:37,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=690, Invalid=2502, Unknown=0, NotChecked=0, Total=3192 [2023-12-20 02:45:37,083 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 2329 mSDsluCounter, 4406 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 02:45:37,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 4723 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 02:45:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23120 states. [2023-12-20 02:45:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23120 to 20629. [2023-12-20 02:45:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20629 states, 20628 states have (on average 1.1513476827612954) internal successors, (23750), 20628 states have internal predecessors, (23750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20629 states to 20629 states and 23750 transitions. [2023-12-20 02:45:37,254 INFO L78 Accepts]: Start accepts. Automaton has 20629 states and 23750 transitions. Word has length 114 [2023-12-20 02:45:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 02:45:37,255 INFO L495 AbstractCegarLoop]: Abstraction has 20629 states and 23750 transitions. [2023-12-20 02:45:37,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 02:45:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20629 states and 23750 transitions. [2023-12-20 02:45:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 02:45:37,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 02:45:37,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2023-12-20 02:45:37,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 02:45:37,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 02:45:37,466 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 02:45:37,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 02:45:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -549015721, now seen corresponding path program 1 times [2023-12-20 02:45:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 02:45:37,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115667220] [2023-12-20 02:45:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 02:45:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 02:45:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 02:45:37,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 02:45:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 02:45:37,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 02:45:37,589 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 02:45:37,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 02:45:37,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-20 02:45:37,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 02:45:37,595 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 02:45:37,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 02:45:37 BoogieIcfgContainer [2023-12-20 02:45:37,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 02:45:37,692 INFO L158 Benchmark]: Toolchain (without parser) took 207970.41ms. Allocated memory was 194.0MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 153.5MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-20 02:45:37,692 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 02:45:37,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.06ms. Allocated memory is still 194.0MB. Free memory was 153.2MB in the beginning and 133.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-20 02:45:37,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 194.0MB. Free memory was 133.3MB in the beginning and 129.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 02:45:37,692 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 194.0MB. Free memory was 129.6MB in the beginning and 126.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 02:45:37,692 INFO L158 Benchmark]: RCFGBuilder took 643.44ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 126.1MB in the beginning and 216.8MB in the end (delta: -90.7MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2023-12-20 02:45:37,693 INFO L158 Benchmark]: TraceAbstraction took 206841.01ms. Allocated memory was 263.2MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 216.3MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-20 02:45:37,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 392.06ms. Allocated memory is still 194.0MB. Free memory was 153.2MB in the beginning and 133.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 194.0MB. Free memory was 133.3MB in the beginning and 129.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 194.0MB. Free memory was 129.6MB in the beginning and 126.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 643.44ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 126.1MB in the beginning and 216.8MB in the end (delta: -90.7MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * TraceAbstraction took 206841.01ms. Allocated memory was 263.2MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 216.3MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. 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: 391]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] _Bool alive1 = 0; [L36] port_t p2 = 0; [L37] char p2_old = '\x0'; [L38] char p2_new = '\x0'; [L39] char id2 = '\x0'; [L40] char st2 = '\x0'; [L41] msg_t send2 = '\x0'; [L42] _Bool mode2 = 0; [L43] _Bool alive2 = 0; [L44] port_t p3 = 0; [L45] char p3_old = '\x0'; [L46] char p3_new = '\x0'; [L47] char id3 = '\x0'; [L48] char st3 = '\x0'; [L49] msg_t send3 = '\x0'; [L50] _Bool mode3 = 0; [L51] _Bool alive3 = 0; [L55] void (*nodes[3])() = { &node1, &node2, &node3 }; [L59] int __return_5979; [L60] int __return_6056; [L61] int __return_6117; [L62] int __return_6183; [L63] int __return_6353; [L66] int main__c1; [L67] int main__i2; [L68] main__c1 = 0 [L69] r1 = __VERIFIER_nondet_uchar() [L70] id1 = __VERIFIER_nondet_char() [L71] st1 = __VERIFIER_nondet_char() [L72] send1 = __VERIFIER_nondet_char() [L73] mode1 = __VERIFIER_nondet_bool() [L74] alive1 = __VERIFIER_nondet_bool() [L75] id2 = __VERIFIER_nondet_char() [L76] st2 = __VERIFIER_nondet_char() [L77] send2 = __VERIFIER_nondet_char() [L78] mode2 = __VERIFIER_nondet_bool() [L79] alive2 = __VERIFIER_nondet_bool() [L80] id3 = __VERIFIER_nondet_char() [L81] st3 = __VERIFIER_nondet_char() [L82] send3 = __VERIFIER_nondet_char() [L83] mode3 = __VERIFIER_nondet_bool() [L84] alive3 = __VERIFIER_nondet_bool() [L86] int init__tmp; VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L87] COND TRUE ((int)r1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L89] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L91] COND TRUE ((int)id1) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L93] COND TRUE ((int)st1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L95] COND TRUE ((int)send1) == ((int)id1) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L97] COND TRUE ((int)mode1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L99] COND TRUE ((int)id2) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L101] COND TRUE ((int)st2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L103] COND TRUE ((int)send2) == ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L105] COND TRUE ((int)mode2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND TRUE ((int)id3) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L109] COND TRUE ((int)st3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L111] COND TRUE ((int)send3) == ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L113] COND TRUE ((int)mode3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L115] COND TRUE ((int)id1) != ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L117] COND TRUE ((int)id1) != ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L119] COND TRUE ((int)id2) != ((int)id3) [L121] init__tmp = 1 [L122] __return_5979 = init__tmp [L123] main__i2 = __return_5979 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L124] COND TRUE main__i2 != 0 [L126] p1_old = nomsg [L127] p1_new = nomsg [L128] p2_old = nomsg [L129] p2_new = nomsg [L130] p3_old = nomsg [L131] p3_new = nomsg [L132] main__i2 = 0 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L142] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L153] mode1 = 1 [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L921] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L174] mode2 = 1 [L176] msg_t node3__m3; [L177] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L178] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE !(alive3 == 0) [L186] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L187] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L189] COND TRUE p3_new == nomsg [L191] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L193] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L195] mode3 = 1 [L196] p1_old = p1_new [L197] p1_new = nomsg [L198] p2_old = p2_new [L199] p2_new = nomsg [L200] p3_old = p3_new [L201] p3_new = nomsg [L203] int check__tmp; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)r1) < 3 [L208] check__tmp = 1 [L209] __return_6056 = check__tmp [L210] main__c1 = __return_6056 [L212] _Bool __tmp_1; [L213] __tmp_1 = main__c1 [L214] _Bool assert__arg; [L215] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND FALSE !(assert__arg == 0) [L223] msg_t node1__m1; [L224] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L225] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L227] COND FALSE !(r1 == 255) [L233] r1 = r1 + 1 [L234] node1__m1 = p3_old [L235] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L236] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L238] COND FALSE !(!(alive1 == 0)) [L835] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L245] mode1 = 0 [L247] msg_t node2__m2; [L248] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L249] COND TRUE !(mode2 == 0) [L251] node2__m2 = p1_old [L252] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L253] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L262] mode2 = 0 [L264] msg_t node3__m3; [L265] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE !(mode3 == 0) [L268] node3__m3 = p2_old [L269] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L270] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] mode3 = 0 [L280] p1_old = p1_new [L281] p1_new = nomsg [L282] p2_old = p2_new [L283] p2_new = nomsg [L284] p3_old = p3_new [L285] p3_new = nomsg [L287] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L288] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L290] COND TRUE ((int)r1) < 3 [L292] check__tmp = 1 [L293] __return_6117 = check__tmp [L294] main__c1 = __return_6117 [L296] _Bool __tmp_2; [L297] __tmp_2 = main__c1 [L298] _Bool assert__arg; [L299] assert__arg = __tmp_2 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L300] COND FALSE !(assert__arg == 0) [L307] msg_t node1__m1; [L308] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L309] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L711] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L722] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L452] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L463] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND FALSE !(((int)r1) < 3) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L489] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L496] check__tmp = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND TRUE assert__arg == 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L391] reach_error() VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=1, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 206.7s, OverallIterations: 48, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 161.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79679 SdHoareTripleChecker+Valid, 32.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79679 mSDsluCounter, 125045 SdHoareTripleChecker+Invalid, 28.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111545 mSDsCounter, 784 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56748 IncrementalHoareTripleChecker+Invalid, 57532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 784 mSolverCounterUnsat, 13500 mSDtfsCounter, 56748 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4393 GetRequests, 2230 SyntacticMatches, 10 SemanticMatches, 2153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343113 ImplicationChecksByTransitivity, 119.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73798occurred in iteration=32, InterpolantAutomatonStates: 1832, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.0s AutomataMinimizationTime, 47 MinimizatonAttempts, 1040924 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 5271 NumberOfCodeBlocks, 5271 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 6004 ConstructedInterpolants, 0 QuantifiedInterpolants, 53409 SizeOfPredicates, 92 NumberOfNonLiveVariables, 5612 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 70 InterpolantComputations, 38 PerfectInterpolantSequences, 284/400 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 02:45:37,728 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...