./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:34:13,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:34:13,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:34:13,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:34:13,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:34:13,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:34:13,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:34:13,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:34:13,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:34:13,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:34:13,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:34:13,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:34:13,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:34:13,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:34:13,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:34:13,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:34:13,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:34:13,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:34:13,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:34:13,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:34:13,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:34:13,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:34:13,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:34:13,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:34:13,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:34:13,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:34:13,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:34:13,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:34:13,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:34:13,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:34:13,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:34:13,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:34:13,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:34:13,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:34:13,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:34:13,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:34:13,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:34:13,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:34:13,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:34:13,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:34:13,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:34:13,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:34:13,198 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 [2024-10-12 20:34:13,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:34:13,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:34:13,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:34:13,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:34:13,517 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:34:13,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-12 20:34:15,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:34:15,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:34:15,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-12 20:34:15,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334e89e83/6997389e8544427f80b9ccd34edbf41b/FLAGfad1108ea [2024-10-12 20:34:15,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334e89e83/6997389e8544427f80b9ccd34edbf41b [2024-10-12 20:34:15,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:34:15,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:34:15,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:34:15,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:34:15,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:34:15,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:34:15" (1/1) ... [2024-10-12 20:34:15,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73533fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:15, skipping insertion in model container [2024-10-12 20:34:15,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:34:15" (1/1) ... [2024-10-12 20:34:15,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:34:16,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-10-12 20:34:16,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:34:16,138 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:34:16,206 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-10-12 20:34:16,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:34:16,263 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:34:16,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16 WrapperNode [2024-10-12 20:34:16,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:34:16,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:34:16,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:34:16,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:34:16,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,339 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2024-10-12 20:34:16,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:34:16,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:34:16,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:34:16,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:34:16,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,397 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]. [2024-10-12 20:34:16,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:34:16,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:34:16,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:34:16,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:34:16,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (1/1) ... [2024-10-12 20:34:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:34:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:34:16,509 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) [2024-10-12 20:34:16,512 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 [2024-10-12 20:34:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:34:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:34:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:34:16,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:34:16,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:34:16,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:34:17,745 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-12 20:34:17,745 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:34:17,843 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:34:17,847 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:34:17,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:34:17 BoogieIcfgContainer [2024-10-12 20:34:17,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:34:17,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:34:17,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:34:17,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:34:17,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:34:15" (1/3) ... [2024-10-12 20:34:17,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e0c276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:34:17, skipping insertion in model container [2024-10-12 20:34:17,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:16" (2/3) ... [2024-10-12 20:34:17,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e0c276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:34:17, skipping insertion in model container [2024-10-12 20:34:17,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:34:17" (3/3) ... [2024-10-12 20:34:17,856 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-12 20:34:17,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:34:17,873 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:34:17,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:34:17,951 INFO L333 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, 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;@22090cdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:34:17,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:34:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 237 states have (on average 1.7721518987341771) internal successors, (420), 238 states have internal predecessors, (420), 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) [2024-10-12 20:34:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:34:17,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:17,977 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:17,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:17,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash 813659977, now seen corresponding path program 1 times [2024-10-12 20:34:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761448340] [2024-10-12 20:34:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761448340] [2024-10-12 20:34:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761448340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822508573] [2024-10-12 20:34:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:18,620 INFO L87 Difference]: Start difference. First operand has 239 states, 237 states have (on average 1.7721518987341771) internal successors, (420), 238 states have internal predecessors, (420), 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 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:18,770 INFO L93 Difference]: Finished difference Result 478 states and 827 transitions. [2024-10-12 20:34:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:18,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-12 20:34:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:18,793 INFO L225 Difference]: With dead ends: 478 [2024-10-12 20:34:18,793 INFO L226 Difference]: Without dead ends: 357 [2024-10-12 20:34:18,797 INFO L431 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 [2024-10-12 20:34:18,800 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 290 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:18,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 651 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-12 20:34:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2024-10-12 20:34:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.5310734463276836) internal successors, (542), 354 states have internal predecessors, (542), 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) [2024-10-12 20:34:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2024-10-12 20:34:18,886 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 99 [2024-10-12 20:34:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2024-10-12 20:34:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2024-10-12 20:34:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:34:18,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:18,891 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:18,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:34:18,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:18,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1266138381, now seen corresponding path program 1 times [2024-10-12 20:34:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792227833] [2024-10-12 20:34:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:19,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:19,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792227833] [2024-10-12 20:34:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792227833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407514618] [2024-10-12 20:34:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:19,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:19,582 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:19,718 INFO L93 Difference]: Finished difference Result 1708 states and 2595 transitions. [2024-10-12 20:34:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-12 20:34:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:19,728 INFO L225 Difference]: With dead ends: 1708 [2024-10-12 20:34:19,729 INFO L226 Difference]: Without dead ends: 1361 [2024-10-12 20:34:19,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:19,736 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 992 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:19,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1542 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-10-12 20:34:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 684. [2024-10-12 20:34:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.5124450951683748) internal successors, (1033), 683 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) [2024-10-12 20:34:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1033 transitions. [2024-10-12 20:34:19,787 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1033 transitions. Word has length 99 [2024-10-12 20:34:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:19,787 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1033 transitions. [2024-10-12 20:34:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1033 transitions. [2024-10-12 20:34:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:34:19,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:19,792 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:34:19,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:19,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash -224738807, now seen corresponding path program 1 times [2024-10-12 20:34:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633665515] [2024-10-12 20:34:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:19,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633665515] [2024-10-12 20:34:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633665515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418682342] [2024-10-12 20:34:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:19,901 INFO L87 Difference]: Start difference. First operand 684 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2024-10-12 20:34:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:19,926 INFO L93 Difference]: Finished difference Result 1343 states and 2024 transitions. [2024-10-12 20:34:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2024-10-12 20:34:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:19,930 INFO L225 Difference]: With dead ends: 1343 [2024-10-12 20:34:19,931 INFO L226 Difference]: Without dead ends: 686 [2024-10-12 20:34:19,933 INFO L431 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 [2024-10-12 20:34:19,935 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:19,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 701 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-12 20:34:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-10-12 20:34:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.510948905109489) internal successors, (1035), 685 states have internal predecessors, (1035), 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) [2024-10-12 20:34:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1035 transitions. [2024-10-12 20:34:19,960 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1035 transitions. Word has length 100 [2024-10-12 20:34:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:19,962 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1035 transitions. [2024-10-12 20:34:19,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2024-10-12 20:34:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1035 transitions. [2024-10-12 20:34:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:34:19,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:19,967 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:19,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:34:19,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:19,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash -755687727, now seen corresponding path program 1 times [2024-10-12 20:34:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:19,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907904284] [2024-10-12 20:34:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:20,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907904284] [2024-10-12 20:34:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907904284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:20,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914433039] [2024-10-12 20:34:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:20,117 INFO L87 Difference]: Start difference. First operand 686 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:20,166 INFO L93 Difference]: Finished difference Result 1817 states and 2760 transitions. [2024-10-12 20:34:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:34:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:20,172 INFO L225 Difference]: With dead ends: 1817 [2024-10-12 20:34:20,173 INFO L226 Difference]: Without dead ends: 1325 [2024-10-12 20:34:20,174 INFO L431 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 [2024-10-12 20:34:20,178 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 282 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:20,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 990 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-12 20:34:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1323. [2024-10-12 20:34:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1322 states have (on average 1.4962178517397882) internal successors, (1978), 1322 states have internal predecessors, (1978), 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) [2024-10-12 20:34:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1978 transitions. [2024-10-12 20:34:20,213 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1978 transitions. Word has length 101 [2024-10-12 20:34:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:20,213 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1978 transitions. [2024-10-12 20:34:20,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1978 transitions. [2024-10-12 20:34:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:34:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:20,217 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:20,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:34:20,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:20,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash 679674670, now seen corresponding path program 1 times [2024-10-12 20:34:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637674883] [2024-10-12 20:34:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637674883] [2024-10-12 20:34:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637674883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768873330] [2024-10-12 20:34:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:20,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:20,638 INFO L87 Difference]: Start difference. First operand 1323 states and 1978 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:20,673 INFO L93 Difference]: Finished difference Result 2152 states and 3238 transitions. [2024-10-12 20:34:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:34:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:20,678 INFO L225 Difference]: With dead ends: 2152 [2024-10-12 20:34:20,678 INFO L226 Difference]: Without dead ends: 1011 [2024-10-12 20:34:20,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:20,681 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 25 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1135 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 [2024-10-12 20:34:20,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-10-12 20:34:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2024-10-12 20:34:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.491089108910891) internal successors, (1506), 1010 states have internal predecessors, (1506), 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) [2024-10-12 20:34:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1506 transitions. [2024-10-12 20:34:20,706 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1506 transitions. Word has length 101 [2024-10-12 20:34:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:20,706 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1506 transitions. [2024-10-12 20:34:20,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1506 transitions. [2024-10-12 20:34:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:34:20,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:20,710 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:34:20,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 955890742, now seen corresponding path program 1 times [2024-10-12 20:34:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653093318] [2024-10-12 20:34:20,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653093318] [2024-10-12 20:34:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653093318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562286262] [2024-10-12 20:34:20,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:20,804 INFO L87 Difference]: Start difference. First operand 1011 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:20,856 INFO L93 Difference]: Finished difference Result 2286 states and 3526 transitions. [2024-10-12 20:34:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:34:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:20,864 INFO L225 Difference]: With dead ends: 2286 [2024-10-12 20:34:20,865 INFO L226 Difference]: Without dead ends: 1459 [2024-10-12 20:34:20,866 INFO L431 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 [2024-10-12 20:34:20,869 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 225 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:20,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 712 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-12 20:34:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1427. [2024-10-12 20:34:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.532258064516129) internal successors, (2185), 1426 states have internal predecessors, (2185), 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) [2024-10-12 20:34:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2185 transitions. [2024-10-12 20:34:20,925 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2185 transitions. Word has length 101 [2024-10-12 20:34:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:20,926 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2185 transitions. [2024-10-12 20:34:20,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2185 transitions. [2024-10-12 20:34:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:34:20,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:20,929 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:34:20,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash -333217733, now seen corresponding path program 1 times [2024-10-12 20:34:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164674175] [2024-10-12 20:34:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:21,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:21,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164674175] [2024-10-12 20:34:21,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164674175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:21,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356949077] [2024-10-12 20:34:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:21,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:21,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:21,033 INFO L87 Difference]: Start difference. First operand 1427 states and 2185 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2024-10-12 20:34:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:21,082 INFO L93 Difference]: Finished difference Result 3392 states and 5352 transitions. [2024-10-12 20:34:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 [2024-10-12 20:34:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:21,091 INFO L225 Difference]: With dead ends: 3392 [2024-10-12 20:34:21,092 INFO L226 Difference]: Without dead ends: 2233 [2024-10-12 20:34:21,094 INFO L431 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 [2024-10-12 20:34:21,096 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 237 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:21,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 687 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2024-10-12 20:34:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2171. [2024-10-12 20:34:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2170 states have (on average 1.5626728110599077) internal successors, (3391), 2170 states have internal predecessors, (3391), 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) [2024-10-12 20:34:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3391 transitions. [2024-10-12 20:34:21,150 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3391 transitions. Word has length 103 [2024-10-12 20:34:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:21,151 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3391 transitions. [2024-10-12 20:34:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2024-10-12 20:34:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3391 transitions. [2024-10-12 20:34:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:34:21,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:21,154 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:34:21,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -803864846, now seen corresponding path program 1 times [2024-10-12 20:34:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737249881] [2024-10-12 20:34:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:21,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737249881] [2024-10-12 20:34:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737249881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605044401] [2024-10-12 20:34:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:21,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:21,559 INFO L87 Difference]: Start difference. First operand 2171 states and 3391 transitions. Second operand has 4 states, 4 states have (on average 26.0) 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) [2024-10-12 20:34:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:21,651 INFO L93 Difference]: Finished difference Result 5606 states and 8768 transitions. [2024-10-12 20:34:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:21,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) 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 104 [2024-10-12 20:34:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:21,666 INFO L225 Difference]: With dead ends: 5606 [2024-10-12 20:34:21,667 INFO L226 Difference]: Without dead ends: 3453 [2024-10-12 20:34:21,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:21,673 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 284 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:21,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1356 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2024-10-12 20:34:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3451. [2024-10-12 20:34:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.552463768115942) internal successors, (5356), 3450 states have internal predecessors, (5356), 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) [2024-10-12 20:34:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5356 transitions. [2024-10-12 20:34:21,763 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5356 transitions. Word has length 104 [2024-10-12 20:34:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5356 transitions. [2024-10-12 20:34:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) 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) [2024-10-12 20:34:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5356 transitions. [2024-10-12 20:34:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:34:21,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:21,767 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:34:21,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1246982117, now seen corresponding path program 1 times [2024-10-12 20:34:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590395417] [2024-10-12 20:34:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590395417] [2024-10-12 20:34:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590395417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294411590] [2024-10-12 20:34:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:22,136 INFO L87 Difference]: Start difference. First operand 3451 states and 5356 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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) [2024-10-12 20:34:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:22,186 INFO L93 Difference]: Finished difference Result 6106 states and 9505 transitions. [2024-10-12 20:34:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:22,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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 [2024-10-12 20:34:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:22,200 INFO L225 Difference]: With dead ends: 6106 [2024-10-12 20:34:22,200 INFO L226 Difference]: Without dead ends: 3451 [2024-10-12 20:34:22,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:22,207 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 19 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:22,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1101 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2024-10-12 20:34:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2024-10-12 20:34:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.5521739130434782) internal successors, (5355), 3450 states have internal predecessors, (5355), 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) [2024-10-12 20:34:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5355 transitions. [2024-10-12 20:34:22,329 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5355 transitions. Word has length 106 [2024-10-12 20:34:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:22,329 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5355 transitions. [2024-10-12 20:34:22,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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) [2024-10-12 20:34:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5355 transitions. [2024-10-12 20:34:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:34:22,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:22,331 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:34:22,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1060212066, now seen corresponding path program 1 times [2024-10-12 20:34:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432328331] [2024-10-12 20:34:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:22,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432328331] [2024-10-12 20:34:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432328331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:22,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609626125] [2024-10-12 20:34:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:22,429 INFO L87 Difference]: Start difference. First operand 3451 states and 5355 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2024-10-12 20:34:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:22,497 INFO L93 Difference]: Finished difference Result 8388 states and 13115 transitions. [2024-10-12 20:34:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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 [2024-10-12 20:34:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:22,517 INFO L225 Difference]: With dead ends: 8388 [2024-10-12 20:34:22,518 INFO L226 Difference]: Without dead ends: 5308 [2024-10-12 20:34:22,524 INFO L431 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 [2024-10-12 20:34:22,525 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 275 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:22,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 764 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5308 states. [2024-10-12 20:34:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5308 to 5306. [2024-10-12 20:34:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5306 states, 5305 states have (on average 1.538737040527804) internal successors, (8163), 5305 states have internal predecessors, (8163), 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) [2024-10-12 20:34:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 8163 transitions. [2024-10-12 20:34:22,722 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 8163 transitions. Word has length 106 [2024-10-12 20:34:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:22,722 INFO L471 AbstractCegarLoop]: Abstraction has 5306 states and 8163 transitions. [2024-10-12 20:34:22,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2024-10-12 20:34:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 8163 transitions. [2024-10-12 20:34:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 20:34:22,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:22,726 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:22,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:34:22,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:22,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1222225317, now seen corresponding path program 1 times [2024-10-12 20:34:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128030223] [2024-10-12 20:34:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:22,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128030223] [2024-10-12 20:34:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128030223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71679014] [2024-10-12 20:34:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:22,829 INFO L87 Difference]: Start difference. First operand 5306 states and 8163 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2024-10-12 20:34:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:22,927 INFO L93 Difference]: Finished difference Result 13930 states and 21826 transitions. [2024-10-12 20:34:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:22,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 [2024-10-12 20:34:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:22,960 INFO L225 Difference]: With dead ends: 13930 [2024-10-12 20:34:22,960 INFO L226 Difference]: Without dead ends: 8960 [2024-10-12 20:34:22,970 INFO L431 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 [2024-10-12 20:34:22,971 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 225 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:22,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 691 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2024-10-12 20:34:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 8678. [2024-10-12 20:34:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8678 states, 8677 states have (on average 1.5620606200299643) internal successors, (13554), 8677 states have internal predecessors, (13554), 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) [2024-10-12 20:34:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 13554 transitions. [2024-10-12 20:34:23,175 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 13554 transitions. Word has length 108 [2024-10-12 20:34:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:23,175 INFO L471 AbstractCegarLoop]: Abstraction has 8678 states and 13554 transitions. [2024-10-12 20:34:23,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2024-10-12 20:34:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 13554 transitions. [2024-10-12 20:34:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:34:23,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:23,179 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:23,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:34:23,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:23,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1346781786, now seen corresponding path program 1 times [2024-10-12 20:34:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892418386] [2024-10-12 20:34:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892418386] [2024-10-12 20:34:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892418386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010718021] [2024-10-12 20:34:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:23,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:23,521 INFO L87 Difference]: Start difference. First operand 8678 states and 13554 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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) [2024-10-12 20:34:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:23,692 INFO L93 Difference]: Finished difference Result 31061 states and 48379 transitions. [2024-10-12 20:34:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2024-10-12 20:34:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:23,747 INFO L225 Difference]: With dead ends: 31061 [2024-10-12 20:34:23,747 INFO L226 Difference]: Without dead ends: 22433 [2024-10-12 20:34:23,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:23,845 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 621 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:23,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1148 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22433 states. [2024-10-12 20:34:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22433 to 15558. [2024-10-12 20:34:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15558 states, 15557 states have (on average 1.544449443980202) internal successors, (24027), 15557 states have internal predecessors, (24027), 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) [2024-10-12 20:34:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 24027 transitions. [2024-10-12 20:34:24,272 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 24027 transitions. Word has length 109 [2024-10-12 20:34:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:24,272 INFO L471 AbstractCegarLoop]: Abstraction has 15558 states and 24027 transitions. [2024-10-12 20:34:24,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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) [2024-10-12 20:34:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 24027 transitions. [2024-10-12 20:34:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 20:34:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:24,278 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:34:24,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1245597490, now seen corresponding path program 1 times [2024-10-12 20:34:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055996889] [2024-10-12 20:34:24,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:24,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:24,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055996889] [2024-10-12 20:34:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055996889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:24,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:24,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198039729] [2024-10-12 20:34:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:24,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:24,347 INFO L87 Difference]: Start difference. First operand 15558 states and 24027 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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) [2024-10-12 20:34:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:24,501 INFO L93 Difference]: Finished difference Result 31017 states and 47922 transitions. [2024-10-12 20:34:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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 [2024-10-12 20:34:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:24,533 INFO L225 Difference]: With dead ends: 31017 [2024-10-12 20:34:24,534 INFO L226 Difference]: Without dead ends: 15564 [2024-10-12 20:34:24,555 INFO L431 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 [2024-10-12 20:34:24,556 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:24,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15564 states. [2024-10-12 20:34:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15564 to 15564. [2024-10-12 20:34:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15564 states, 15563 states have (on average 1.5442395425046584) internal successors, (24033), 15563 states have internal predecessors, (24033), 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) [2024-10-12 20:34:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15564 states to 15564 states and 24033 transitions. [2024-10-12 20:34:24,997 INFO L78 Accepts]: Start accepts. Automaton has 15564 states and 24033 transitions. Word has length 110 [2024-10-12 20:34:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 15564 states and 24033 transitions. [2024-10-12 20:34:24,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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) [2024-10-12 20:34:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 15564 states and 24033 transitions. [2024-10-12 20:34:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:34:25,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:25,003 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:25,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:34:25,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:25,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash -837369765, now seen corresponding path program 1 times [2024-10-12 20:34:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:25,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211058955] [2024-10-12 20:34:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211058955] [2024-10-12 20:34:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211058955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413923297] [2024-10-12 20:34:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:25,479 INFO L87 Difference]: Start difference. First operand 15564 states and 24033 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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) [2024-10-12 20:34:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:25,623 INFO L93 Difference]: Finished difference Result 31091 states and 48012 transitions. [2024-10-12 20:34:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:25,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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 [2024-10-12 20:34:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:25,655 INFO L225 Difference]: With dead ends: 31091 [2024-10-12 20:34:25,655 INFO L226 Difference]: Without dead ends: 15558 [2024-10-12 20:34:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:25,680 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 14 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1081 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 [2024-10-12 20:34:25,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1081 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15558 states. [2024-10-12 20:34:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15558 to 15558. [2024-10-12 20:34:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15558 states, 15557 states have (on average 1.5440637655074887) internal successors, (24021), 15557 states have internal predecessors, (24021), 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) [2024-10-12 20:34:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 24021 transitions. [2024-10-12 20:34:26,010 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 24021 transitions. Word has length 111 [2024-10-12 20:34:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:26,010 INFO L471 AbstractCegarLoop]: Abstraction has 15558 states and 24021 transitions. [2024-10-12 20:34:26,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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) [2024-10-12 20:34:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 24021 transitions. [2024-10-12 20:34:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:34:26,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:26,015 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:34:26,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 135525404, now seen corresponding path program 1 times [2024-10-12 20:34:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387786321] [2024-10-12 20:34:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:26,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387786321] [2024-10-12 20:34:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387786321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96119302] [2024-10-12 20:34:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:26,107 INFO L87 Difference]: Start difference. First operand 15558 states and 24021 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) [2024-10-12 20:34:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:26,275 INFO L93 Difference]: Finished difference Result 37292 states and 57688 transitions. [2024-10-12 20:34:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:26,275 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 [2024-10-12 20:34:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:26,320 INFO L225 Difference]: With dead ends: 37292 [2024-10-12 20:34:26,321 INFO L226 Difference]: Without dead ends: 22482 [2024-10-12 20:34:26,342 INFO L431 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 [2024-10-12 20:34:26,345 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 260 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:26,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 928 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2024-10-12 20:34:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22480. [2024-10-12 20:34:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22480 states, 22479 states have (on average 1.5210641042751012) internal successors, (34192), 22479 states have internal predecessors, (34192), 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) [2024-10-12 20:34:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22480 states to 22480 states and 34192 transitions. [2024-10-12 20:34:26,941 INFO L78 Accepts]: Start accepts. Automaton has 22480 states and 34192 transitions. Word has length 111 [2024-10-12 20:34:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:26,941 INFO L471 AbstractCegarLoop]: Abstraction has 22480 states and 34192 transitions. [2024-10-12 20:34:26,942 INFO L472 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) [2024-10-12 20:34:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 22480 states and 34192 transitions. [2024-10-12 20:34:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:34:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:26,948 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:34:26,949 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1468352837, now seen corresponding path program 1 times [2024-10-12 20:34:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102506390] [2024-10-12 20:34:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102506390] [2024-10-12 20:34:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102506390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:34:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704261885] [2024-10-12 20:34:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:34:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:34:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:27,313 INFO L87 Difference]: Start difference. First operand 22480 states and 34192 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2024-10-12 20:34:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:27,715 INFO L93 Difference]: Finished difference Result 61636 states and 95610 transitions. [2024-10-12 20:34:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:27,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 [2024-10-12 20:34:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:27,799 INFO L225 Difference]: With dead ends: 61636 [2024-10-12 20:34:27,799 INFO L226 Difference]: Without dead ends: 42058 [2024-10-12 20:34:27,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:34:27,822 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 399 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:27,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 895 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42058 states. [2024-10-12 20:34:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42058 to 41972. [2024-10-12 20:34:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41972 states, 41971 states have (on average 1.51971599437707) internal successors, (63784), 41971 states have internal predecessors, (63784), 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) [2024-10-12 20:34:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41972 states to 41972 states and 63784 transitions. [2024-10-12 20:34:28,661 INFO L78 Accepts]: Start accepts. Automaton has 41972 states and 63784 transitions. Word has length 114 [2024-10-12 20:34:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:28,661 INFO L471 AbstractCegarLoop]: Abstraction has 41972 states and 63784 transitions. [2024-10-12 20:34:28,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2024-10-12 20:34:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41972 states and 63784 transitions. [2024-10-12 20:34:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:34:28,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:28,668 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:28,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:34:28,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -58076561, now seen corresponding path program 1 times [2024-10-12 20:34:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23489316] [2024-10-12 20:34:28,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23489316] [2024-10-12 20:34:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23489316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:28,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:28,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4403585] [2024-10-12 20:34:28,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:28,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:34:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:34:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:28,815 INFO L87 Difference]: Start difference. First operand 41972 states and 63784 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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) [2024-10-12 20:34:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:29,317 INFO L93 Difference]: Finished difference Result 80024 states and 121864 transitions. [2024-10-12 20:34:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 [2024-10-12 20:34:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:29,379 INFO L225 Difference]: With dead ends: 80024 [2024-10-12 20:34:29,380 INFO L226 Difference]: Without dead ends: 41972 [2024-10-12 20:34:29,414 INFO L431 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 [2024-10-12 20:34:29,415 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 851 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:29,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 355 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41972 states. [2024-10-12 20:34:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41972 to 41972. [2024-10-12 20:34:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41972 states, 41971 states have (on average 1.5083271782897716) internal successors, (63306), 41971 states have internal predecessors, (63306), 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) [2024-10-12 20:34:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41972 states to 41972 states and 63306 transitions. [2024-10-12 20:34:30,176 INFO L78 Accepts]: Start accepts. Automaton has 41972 states and 63306 transitions. Word has length 114 [2024-10-12 20:34:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:30,176 INFO L471 AbstractCegarLoop]: Abstraction has 41972 states and 63306 transitions. [2024-10-12 20:34:30,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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) [2024-10-12 20:34:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41972 states and 63306 transitions. [2024-10-12 20:34:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:34:30,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:30,183 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:30,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:34:30,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:30,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -429016684, now seen corresponding path program 1 times [2024-10-12 20:34:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588443070] [2024-10-12 20:34:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588443070] [2024-10-12 20:34:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588443070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:30,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:34:30,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326645934] [2024-10-12 20:34:30,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:30,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:30,668 INFO L87 Difference]: Start difference. First operand 41972 states and 63306 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 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) [2024-10-12 20:34:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:31,042 INFO L93 Difference]: Finished difference Result 81590 states and 123842 transitions. [2024-10-12 20:34:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 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 [2024-10-12 20:34:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:31,131 INFO L225 Difference]: With dead ends: 81590 [2024-10-12 20:34:31,132 INFO L226 Difference]: Without dead ends: 41974 [2024-10-12 20:34:31,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:34:31,174 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1028 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:31,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 949 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41974 states. [2024-10-12 20:34:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41974 to 41972. [2024-10-12 20:34:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41972 states, 41971 states have (on average 1.5037525910747898) internal successors, (63114), 41971 states have internal predecessors, (63114), 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) [2024-10-12 20:34:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41972 states to 41972 states and 63114 transitions. [2024-10-12 20:34:32,017 INFO L78 Accepts]: Start accepts. Automaton has 41972 states and 63114 transitions. Word has length 114 [2024-10-12 20:34:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 41972 states and 63114 transitions. [2024-10-12 20:34:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 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) [2024-10-12 20:34:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 41972 states and 63114 transitions. [2024-10-12 20:34:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:34:32,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:32,234 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:32,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:34:32,234 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2035121907, now seen corresponding path program 1 times [2024-10-12 20:34:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838747111] [2024-10-12 20:34:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838747111] [2024-10-12 20:34:32,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838747111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:32,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959227032] [2024-10-12 20:34:32,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:32,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:32,623 INFO L87 Difference]: Start difference. First operand 41972 states and 63114 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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) [2024-10-12 20:34:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:32,841 INFO L93 Difference]: Finished difference Result 69106 states and 104118 transitions. [2024-10-12 20:34:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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 [2024-10-12 20:34:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:32,912 INFO L225 Difference]: With dead ends: 69106 [2024-10-12 20:34:32,912 INFO L226 Difference]: Without dead ends: 39098 [2024-10-12 20:34:32,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:32,948 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 269 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:32,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39098 states. [2024-10-12 20:34:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39098 to 38956. [2024-10-12 20:34:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38956 states, 38955 states have (on average 1.5012706969580285) internal successors, (58482), 38955 states have internal predecessors, (58482), 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) [2024-10-12 20:34:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38956 states to 38956 states and 58482 transitions. [2024-10-12 20:34:33,576 INFO L78 Accepts]: Start accepts. Automaton has 38956 states and 58482 transitions. Word has length 114 [2024-10-12 20:34:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:33,576 INFO L471 AbstractCegarLoop]: Abstraction has 38956 states and 58482 transitions. [2024-10-12 20:34:33,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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) [2024-10-12 20:34:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 38956 states and 58482 transitions. [2024-10-12 20:34:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 20:34:33,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:33,581 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:34:33,581 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 349146810, now seen corresponding path program 1 times [2024-10-12 20:34:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141579519] [2024-10-12 20:34:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:33,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141579519] [2024-10-12 20:34:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141579519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657114612] [2024-10-12 20:34:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:33,650 INFO L87 Difference]: Start difference. First operand 38956 states and 58482 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-12 20:34:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:33,880 INFO L93 Difference]: Finished difference Result 85741 states and 128690 transitions. [2024-10-12 20:34:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2024-10-12 20:34:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:34,383 INFO L225 Difference]: With dead ends: 85741 [2024-10-12 20:34:34,384 INFO L226 Difference]: Without dead ends: 57033 [2024-10-12 20:34:34,409 INFO L431 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 [2024-10-12 20:34:34,410 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 307 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:34,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 697 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57033 states. [2024-10-12 20:34:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57033 to 38956. [2024-10-12 20:34:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38956 states, 38955 states have (on average 1.5011936850211782) internal successors, (58479), 38955 states have internal predecessors, (58479), 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) [2024-10-12 20:34:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38956 states to 38956 states and 58479 transitions. [2024-10-12 20:34:35,121 INFO L78 Accepts]: Start accepts. Automaton has 38956 states and 58479 transitions. Word has length 115 [2024-10-12 20:34:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:35,121 INFO L471 AbstractCegarLoop]: Abstraction has 38956 states and 58479 transitions. [2024-10-12 20:34:35,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-12 20:34:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38956 states and 58479 transitions. [2024-10-12 20:34:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:34:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:35,127 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:34:35,128 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1495936886, now seen corresponding path program 1 times [2024-10-12 20:34:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585311603] [2024-10-12 20:34:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585311603] [2024-10-12 20:34:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585311603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:35,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:35,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795584335] [2024-10-12 20:34:35,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:35,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:35,635 INFO L87 Difference]: Start difference. First operand 38956 states and 58479 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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) [2024-10-12 20:34:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:36,018 INFO L93 Difference]: Finished difference Result 117147 states and 175696 transitions. [2024-10-12 20:34:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2024-10-12 20:34:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:36,145 INFO L225 Difference]: With dead ends: 117147 [2024-10-12 20:34:36,146 INFO L226 Difference]: Without dead ends: 78361 [2024-10-12 20:34:36,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:36,198 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 897 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:36,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1368 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78361 states. [2024-10-12 20:34:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78361 to 39053. [2024-10-12 20:34:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39053 states, 39052 states have (on average 1.499871965584349) internal successors, (58573), 39052 states have internal predecessors, (58573), 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) [2024-10-12 20:34:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39053 states to 39053 states and 58573 transitions. [2024-10-12 20:34:37,114 INFO L78 Accepts]: Start accepts. Automaton has 39053 states and 58573 transitions. Word has length 116 [2024-10-12 20:34:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:37,115 INFO L471 AbstractCegarLoop]: Abstraction has 39053 states and 58573 transitions. [2024-10-12 20:34:37,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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) [2024-10-12 20:34:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 39053 states and 58573 transitions. [2024-10-12 20:34:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 20:34:37,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:37,119 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:37,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:34:37,120 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1921984956, now seen corresponding path program 1 times [2024-10-12 20:34:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335024450] [2024-10-12 20:34:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335024450] [2024-10-12 20:34:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335024450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:37,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230469116] [2024-10-12 20:34:37,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:37,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:37,194 INFO L87 Difference]: Start difference. First operand 39053 states and 58573 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2024-10-12 20:34:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:37,378 INFO L93 Difference]: Finished difference Result 67826 states and 101812 transitions. [2024-10-12 20:34:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2024-10-12 20:34:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:37,442 INFO L225 Difference]: With dead ends: 67826 [2024-10-12 20:34:37,443 INFO L226 Difference]: Without dead ends: 39063 [2024-10-12 20:34:37,472 INFO L431 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 [2024-10-12 20:34:37,474 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:37,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39063 states. [2024-10-12 20:34:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39063 to 39063. [2024-10-12 20:34:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39063 states, 39062 states have (on average 1.499743996723158) internal successors, (58583), 39062 states have internal predecessors, (58583), 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) [2024-10-12 20:34:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39063 states to 39063 states and 58583 transitions. [2024-10-12 20:34:38,418 INFO L78 Accepts]: Start accepts. Automaton has 39063 states and 58583 transitions. Word has length 117 [2024-10-12 20:34:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:38,418 INFO L471 AbstractCegarLoop]: Abstraction has 39063 states and 58583 transitions. [2024-10-12 20:34:38,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2024-10-12 20:34:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 39063 states and 58583 transitions. [2024-10-12 20:34:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 20:34:38,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:38,421 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:38,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:34:38,421 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1356077294, now seen corresponding path program 1 times [2024-10-12 20:34:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470145832] [2024-10-12 20:34:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:38,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470145832] [2024-10-12 20:34:38,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470145832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:38,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173833430] [2024-10-12 20:34:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:38,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:38,693 INFO L87 Difference]: Start difference. First operand 39063 states and 58583 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 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) [2024-10-12 20:34:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:38,937 INFO L93 Difference]: Finished difference Result 78250 states and 117288 transitions. [2024-10-12 20:34:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-10-12 20:34:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:39,414 INFO L225 Difference]: With dead ends: 78250 [2024-10-12 20:34:39,419 INFO L226 Difference]: Without dead ends: 39471 [2024-10-12 20:34:39,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:39,455 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 268 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:39,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1312 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39471 states. [2024-10-12 20:34:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39471 to 39314. [2024-10-12 20:34:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39314 states, 39313 states have (on average 1.49668048737059) internal successors, (58839), 39313 states have internal predecessors, (58839), 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) [2024-10-12 20:34:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39314 states to 39314 states and 58839 transitions. [2024-10-12 20:34:40,039 INFO L78 Accepts]: Start accepts. Automaton has 39314 states and 58839 transitions. Word has length 118 [2024-10-12 20:34:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:40,040 INFO L471 AbstractCegarLoop]: Abstraction has 39314 states and 58839 transitions. [2024-10-12 20:34:40,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 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) [2024-10-12 20:34:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39314 states and 58839 transitions. [2024-10-12 20:34:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 20:34:40,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:40,045 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:40,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:34:40,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1237330603, now seen corresponding path program 1 times [2024-10-12 20:34:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854325634] [2024-10-12 20:34:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:40,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854325634] [2024-10-12 20:34:40,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854325634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:40,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:40,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:40,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045007397] [2024-10-12 20:34:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:40,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:40,477 INFO L87 Difference]: Start difference. First operand 39314 states and 58839 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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) [2024-10-12 20:34:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:40,695 INFO L93 Difference]: Finished difference Result 57085 states and 85522 transitions. [2024-10-12 20:34:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:40,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 118 [2024-10-12 20:34:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:40,765 INFO L225 Difference]: With dead ends: 57085 [2024-10-12 20:34:40,766 INFO L226 Difference]: Without dead ends: 36114 [2024-10-12 20:34:40,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:40,795 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:41,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1024 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36114 states. [2024-10-12 20:34:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36114 to 36111. [2024-10-12 20:34:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36111 states, 36110 states have (on average 1.4967045139850457) internal successors, (54046), 36110 states have internal predecessors, (54046), 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) [2024-10-12 20:34:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36111 states to 36111 states and 54046 transitions. [2024-10-12 20:34:41,483 INFO L78 Accepts]: Start accepts. Automaton has 36111 states and 54046 transitions. Word has length 118 [2024-10-12 20:34:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:41,483 INFO L471 AbstractCegarLoop]: Abstraction has 36111 states and 54046 transitions. [2024-10-12 20:34:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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) [2024-10-12 20:34:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 36111 states and 54046 transitions. [2024-10-12 20:34:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:34:41,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:41,486 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:41,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:34:41,487 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:41,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 860265593, now seen corresponding path program 1 times [2024-10-12 20:34:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:41,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881485309] [2024-10-12 20:34:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881485309] [2024-10-12 20:34:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881485309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:41,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585725447] [2024-10-12 20:34:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:34:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:34:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:41,624 INFO L87 Difference]: Start difference. First operand 36111 states and 54046 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 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) [2024-10-12 20:34:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:41,890 INFO L93 Difference]: Finished difference Result 70955 states and 106657 transitions. [2024-10-12 20:34:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 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 120 [2024-10-12 20:34:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:41,947 INFO L225 Difference]: With dead ends: 70955 [2024-10-12 20:34:41,947 INFO L226 Difference]: Without dead ends: 36111 [2024-10-12 20:34:41,981 INFO L431 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 [2024-10-12 20:34:41,982 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 822 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:41,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 348 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36111 states. [2024-10-12 20:34:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36111 to 36111. [2024-10-12 20:34:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36111 states, 36110 states have (on average 1.4844641373580725) internal successors, (53604), 36110 states have internal predecessors, (53604), 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) [2024-10-12 20:34:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36111 states to 36111 states and 53604 transitions. [2024-10-12 20:34:42,614 INFO L78 Accepts]: Start accepts. Automaton has 36111 states and 53604 transitions. Word has length 120 [2024-10-12 20:34:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 36111 states and 53604 transitions. [2024-10-12 20:34:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 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) [2024-10-12 20:34:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36111 states and 53604 transitions. [2024-10-12 20:34:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:34:42,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:42,617 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:34:42,618 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:42,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1938222622, now seen corresponding path program 1 times [2024-10-12 20:34:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753951286] [2024-10-12 20:34:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:42,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753951286] [2024-10-12 20:34:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753951286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:44,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:44,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-12 20:34:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392119194] [2024-10-12 20:34:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 20:34:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:44,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 20:34:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:34:44,481 INFO L87 Difference]: Start difference. First operand 36111 states and 53604 transitions. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 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) [2024-10-12 20:34:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:48,048 INFO L93 Difference]: Finished difference Result 69170 states and 103058 transitions. [2024-10-12 20:34:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 20:34:48,049 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 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 120 [2024-10-12 20:34:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:48,139 INFO L225 Difference]: With dead ends: 69170 [2024-10-12 20:34:48,139 INFO L226 Difference]: Without dead ends: 53990 [2024-10-12 20:34:48,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 20:34:48,165 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1738 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:48,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 5592 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:34:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53990 states. [2024-10-12 20:34:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53990 to 36665. [2024-10-12 20:34:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36665 states, 36664 states have (on average 1.4794075932795112) internal successors, (54241), 36664 states have internal predecessors, (54241), 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) [2024-10-12 20:34:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36665 states to 36665 states and 54241 transitions. [2024-10-12 20:34:48,854 INFO L78 Accepts]: Start accepts. Automaton has 36665 states and 54241 transitions. Word has length 120 [2024-10-12 20:34:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 36665 states and 54241 transitions. [2024-10-12 20:34:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 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) [2024-10-12 20:34:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 36665 states and 54241 transitions. [2024-10-12 20:34:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:34:48,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:48,859 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:34:48,860 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:48,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1045718230, now seen corresponding path program 1 times [2024-10-12 20:34:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959518013] [2024-10-12 20:34:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:34:48,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 20:34:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:34:49,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 20:34:49,117 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 20:34:49,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 20:34:49,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:34:49,123 INFO L407 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] [2024-10-12 20:34:49,313 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 20:34:49,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:34:49 BoogieIcfgContainer [2024-10-12 20:34:49,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 20:34:49,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 20:34:49,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 20:34:49,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 20:34:49,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:34:17" (3/4) ... [2024-10-12 20:34:49,320 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 20:34:49,529 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 20:34:49,529 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 20:34:49,530 INFO L158 Benchmark]: Toolchain (without parser) took 33895.70ms. Allocated memory was 155.2MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 111.9MB in the beginning and 11.9GB in the end (delta: -11.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-10-12 20:34:49,530 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 20:34:49,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.83ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 83.7MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 20:34:49,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.36ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 78.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 20:34:49,531 INFO L158 Benchmark]: Boogie Preprocessor took 121.68ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 73.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 20:34:49,531 INFO L158 Benchmark]: RCFGBuilder took 1384.86ms. Allocated memory is still 155.2MB. Free memory was 73.2MB in the beginning and 107.2MB in the end (delta: -34.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-10-12 20:34:49,531 INFO L158 Benchmark]: TraceAbstraction took 31467.20ms. Allocated memory was 155.2MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 106.2MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-12 20:34:49,531 INFO L158 Benchmark]: Witness Printer took 211.63ms. Allocated memory is still 13.7GB. Free memory was 12.0GB in the beginning and 11.9GB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-12 20:34:49,533 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.13ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.83ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 83.7MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.36ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 78.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.68ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 73.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1384.86ms. Allocated memory is still 155.2MB. Free memory was 73.2MB in the beginning and 107.2MB in the end (delta: -34.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31467.20ms. Allocated memory was 155.2MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 106.2MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 211.63ms. Allocated memory is still 13.7GB. Free memory was 12.0GB in the beginning and 11.9GB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * 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: 586]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] _Bool newmax1 = 0; [L58] char id2 = '\x0'; [L59] char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] _Bool newmax2 = 0; [L66] char id3 = '\x0'; [L67] char r3 = '\x0'; [L68] char st3 = '\x0'; [L69] char nl3 = '\x0'; [L70] char m3 = '\x0'; [L71] char max3 = '\x0'; [L72] _Bool mode3 = 0; [L73] _Bool newmax3 = 0; [L77] void (*nodes[3])() = { &node1, &node2, &node3 }; [L81] int __return_1237; [L82] int __return_1383; [L83] int __return_1517; [L84] int __tmp_1518_0; [L85] int __return_1641; [L86] int __return_1531; [L89] int main__c1; [L90] int main__i2; [L91] main__c1 = 0 [L92] ep12 = __VERIFIER_nondet_bool() [L93] ep13 = __VERIFIER_nondet_bool() [L94] ep21 = __VERIFIER_nondet_bool() [L95] ep23 = __VERIFIER_nondet_bool() [L96] ep31 = __VERIFIER_nondet_bool() [L97] ep32 = __VERIFIER_nondet_bool() [L98] id1 = __VERIFIER_nondet_char() [L99] r1 = __VERIFIER_nondet_char() [L100] st1 = __VERIFIER_nondet_char() [L101] nl1 = __VERIFIER_nondet_char() [L102] m1 = __VERIFIER_nondet_char() [L103] max1 = __VERIFIER_nondet_char() [L104] mode1 = __VERIFIER_nondet_bool() [L105] newmax1 = __VERIFIER_nondet_bool() [L106] id2 = __VERIFIER_nondet_char() [L107] r2 = __VERIFIER_nondet_char() [L108] st2 = __VERIFIER_nondet_char() [L109] nl2 = __VERIFIER_nondet_char() [L110] m2 = __VERIFIER_nondet_char() [L111] max2 = __VERIFIER_nondet_char() [L112] mode2 = __VERIFIER_nondet_bool() [L113] newmax2 = __VERIFIER_nondet_bool() [L114] id3 = __VERIFIER_nondet_char() [L115] r3 = __VERIFIER_nondet_char() [L116] st3 = __VERIFIER_nondet_char() [L117] nl3 = __VERIFIER_nondet_char() [L118] m3 = __VERIFIER_nondet_char() [L119] max3 = __VERIFIER_nondet_char() [L120] mode3 = __VERIFIER_nondet_bool() [L121] newmax3 = __VERIFIER_nondet_bool() [L123] _Bool init__r121; [L124] _Bool init__r131; [L125] _Bool init__r211; [L126] _Bool init__r231; [L127] _Bool init__r311; [L128] _Bool init__r321; [L129] _Bool init__r122; [L130] int init__tmp; [L131] _Bool init__r132; [L132] int init__tmp___0; [L133] _Bool init__r212; [L134] int init__tmp___1; [L135] _Bool init__r232; [L136] int init__tmp___2; [L137] _Bool init__r312; [L138] int init__tmp___3; [L139] _Bool init__r322; [L140] int init__tmp___4; [L141] int init__tmp___5; [L142] init__r121 = ep12 [L143] init__r131 = ep13 [L144] init__r211 = ep21 [L145] init__r231 = ep23 [L146] init__r311 = ep31 [L147] init__r321 = ep32 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r121 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1778] COND TRUE !(init__r131 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1780] COND TRUE !(ep32 == 0) [L1782] init__tmp = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r122 = (_Bool)init__tmp VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r131 == 0) [L155] init__tmp___0 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r132 = (_Bool)init__tmp___0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND TRUE !(init__r211 == 0) [L160] init__tmp___1 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r212 = (_Bool)init__tmp___1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(init__r231 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1709] COND TRUE !(init__r211 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1711] COND TRUE !(ep13 == 0) [L1713] init__tmp___2 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r232 = (_Bool)init__tmp___2 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND FALSE !(!(init__r311 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1686] COND TRUE !(init__r321 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1688] COND TRUE !(ep21 == 0) [L1690] init__tmp___3 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r312 = (_Bool)init__tmp___3 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE !(init__r321 == 0) [L175] init__tmp___4 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L234] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L236] COND TRUE !(newmax3 == 0) [L238] init__tmp___5 = 1 [L239] __return_1237 = init__tmp___5 [L240] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE main__i2 != 0 [L243] p12_old = nomsg [L244] p12_new = nomsg [L245] p13_old = nomsg [L246] p13_new = nomsg [L247] p21_old = nomsg [L248] p21_new = nomsg [L249] p23_old = nomsg [L250] p23_new = nomsg [L251] p31_old = nomsg [L252] p31_new = nomsg [L253] p32_old = nomsg [L254] p32_new = nomsg [L255] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE main__i2 < 6 [L259] _Bool node1__newmax; [L260] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND TRUE !(ep13 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE !(newmax1 == 0) [L286] int node1____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L287] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE p13_new == nomsg [L291] node1____CPAchecker_TMP_1 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=127, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] mode1 = 1 [L297] _Bool node2__newmax; [L298] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep21 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L309] COND TRUE !(newmax2 == 0) [L311] int node2____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L314] COND TRUE p21_new == nomsg [L316] node2____CPAchecker_TMP_0 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L333] mode2 = 1 [L335] _Bool node3__newmax; [L336] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE !(ep32 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE !(newmax3 == 0) [L362] int node3____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE p32_new == nomsg [L367] node3____CPAchecker_TMP_1 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] mode3 = 1 [L372] p12_old = p12_new [L373] p12_new = nomsg [L374] p13_old = p13_new [L375] p13_new = nomsg [L376] p21_old = p21_new [L377] p21_new = nomsg [L378] p23_old = p23_new [L379] p23_new = nomsg [L380] p31_old = p31_new [L381] p31_new = nomsg [L382] p32_old = p32_new [L383] p32_new = nomsg [L385] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int)r1) < 2 [L414] check__tmp = 1 [L415] __return_1383 = check__tmp [L416] main__c1 = __return_1383 [L418] _Bool __tmp_1; [L419] __tmp_1 = main__c1 [L420] _Bool assert__arg; [L421] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND FALSE !(assert__arg == 0) [L428] int main____CPAchecker_TMP_0 = main__i2; [L429] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE main__i2 < 6 [L433] _Bool node1__newmax; [L434] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE !(mode1 == 0) [L437] r1 = (char)(((int)r1) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE !(ep21 == 0) [L440] m1 = p21_old [L441] p21_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE ((int)r1) == 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE ((int)max1) == ((int)id1) [L461] st1 = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L463] mode1 = 0 [L465] _Bool node2__newmax; [L466] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L467] COND TRUE !(mode2 == 0) [L469] r2 = (char)(((int)r2) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] COND TRUE !(ep32 == 0) [L481] m2 = p32_old [L482] p32_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L483] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L488] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L489] COND FALSE !(((int)r2) == 2) [L495] mode2 = 0 [L497] _Bool node3__newmax; [L498] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L499] COND TRUE !(mode3 == 0) [L501] r3 = (char)(((int)r3) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L502] COND TRUE !(ep13 == 0) [L504] m3 = p13_old [L505] p13_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L506] COND TRUE ((int)m3) > ((int)max3) [L508] max3 = m3 [L509] node3__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L520] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L521] COND FALSE !(((int)r3) == 2) [L527] mode3 = 0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L541] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L542] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L544] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L546] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L548] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L550] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L556] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1181] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L574] __return_1517 = check__tmp [L575] main__c1 = __return_1517 [L576] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__c1=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L578] main____CPAchecker_TMP_0 = __tmp_1518_0 [L580] _Bool __tmp_2; [L581] __tmp_2 = main__c1 [L582] _Bool assert__arg; [L583] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L584] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L586] reach_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10328 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10328 mSDsluCounter, 28500 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16892 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2469 IncrementalHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 11608 mSDtfsCounter, 2469 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41972occurred in iteration=16, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 83038 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2969 NumberOfCodeBlocks, 2969 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2823 ConstructedInterpolants, 0 QuantifiedInterpolants, 11105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 20:34:49,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE