./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-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 1e059282fd5d86931dc4c64c61df508e5e1072350b4f411e7728a201bfba22a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 15:12:34,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 15:12:34,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 15:12:34,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 15:12:34,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 15:12:34,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 15:12:34,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 15:12:34,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 15:12:34,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 15:12:34,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 15:12:34,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 15:12:34,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 15:12:34,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 15:12:34,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 15:12:34,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 15:12:34,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 15:12:34,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 15:12:34,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 15:12:34,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 15:12:34,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 15:12:34,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 15:12:34,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 15:12:34,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 15:12:34,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 15:12:34,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 15:12:34,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 15:12:34,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 15:12:34,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 15:12:34,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 15:12:34,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 15:12:34,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 15:12:34,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 15:12:34,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:12:34,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 15:12:34,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 15:12:34,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 15:12:34,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 15:12:34,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 15:12:34,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 15:12:34,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 15:12:34,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 15:12:34,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 15:12:34,586 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 -> 1e059282fd5d86931dc4c64c61df508e5e1072350b4f411e7728a201bfba22a1 [2024-11-18 15:12:34,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 15:12:34,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 15:12:34,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 15:12:34,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 15:12:34,868 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 15:12:34,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-18 15:12:36,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 15:12:36,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 15:12:36,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-18 15:12:36,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a851e9a/19a544128eb74b9ca92a73eb295460c0/FLAG1c44d40d4 [2024-11-18 15:12:36,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a851e9a/19a544128eb74b9ca92a73eb295460c0 [2024-11-18 15:12:36,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 15:12:36,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 15:12:36,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 15:12:36,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 15:12:36,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 15:12:36,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:12:36" (1/1) ... [2024-11-18 15:12:36,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174efa39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:36, skipping insertion in model container [2024-11-18 15:12:36,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:12:36" (1/1) ... [2024-11-18 15:12:36,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 15:12:37,120 WARN L250 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10504,10517] [2024-11-18 15:12:37,178 WARN L250 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13076,13089] [2024-11-18 15:12:37,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:12:37,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 15:12:37,327 WARN L250 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10504,10517] [2024-11-18 15:12:37,351 WARN L250 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13076,13089] [2024-11-18 15:12:37,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:12:37,414 INFO L204 MainTranslator]: Completed translation [2024-11-18 15:12:37,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37 WrapperNode [2024-11-18 15:12:37,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 15:12:37,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 15:12:37,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 15:12:37,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 15:12:37,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,502 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1131 [2024-11-18 15:12:37,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 15:12:37,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 15:12:37,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 15:12:37,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 15:12:37,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,558 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-11-18 15:12:37,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 15:12:37,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 15:12:37,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 15:12:37,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 15:12:37,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (1/1) ... [2024-11-18 15:12:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:12:37,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:12:37,686 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-11-18 15:12:37,689 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-11-18 15:12:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 15:12:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 15:12:37,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 15:12:37,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 15:12:37,907 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 15:12:37,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 15:12:39,015 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-18 15:12:39,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 15:12:39,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 15:12:39,046 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 15:12:39,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:39 BoogieIcfgContainer [2024-11-18 15:12:39,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 15:12:39,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 15:12:39,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 15:12:39,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 15:12:39,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:12:36" (1/3) ... [2024-11-18 15:12:39,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd1e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:12:39, skipping insertion in model container [2024-11-18 15:12:39,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:37" (2/3) ... [2024-11-18 15:12:39,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd1e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:12:39, skipping insertion in model container [2024-11-18 15:12:39,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:39" (3/3) ... [2024-11-18 15:12:39,057 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-18 15:12:39,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 15:12:39,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 15:12:39,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 15:12:39,153 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;@4ed4176b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 15:12:39,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 15:12:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 267 states have (on average 1.7790262172284643) internal successors, (475), 269 states have internal predecessors, (475), 0 states have call successors, (0), 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-11-18 15:12:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 15:12:39,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:39,174 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] [2024-11-18 15:12:39,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:39,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1276327155, now seen corresponding path program 1 times [2024-11-18 15:12:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071624671] [2024-11-18 15:12:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071624671] [2024-11-18 15:12:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071624671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867664163] [2024-11-18 15:12:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:40,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:40,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:40,371 INFO L87 Difference]: Start difference. First operand has 270 states, 267 states have (on average 1.7790262172284643) internal successors, (475), 269 states have internal predecessors, (475), 0 states have call successors, (0), 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 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-11-18 15:12:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:40,695 INFO L93 Difference]: Finished difference Result 1287 states and 2274 transitions. [2024-11-18 15:12:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:12:40,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-18 15:12:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:40,725 INFO L225 Difference]: With dead ends: 1287 [2024-11-18 15:12:40,726 INFO L226 Difference]: Without dead ends: 1018 [2024-11-18 15:12:40,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:12:40,736 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1490 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:40,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1885 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-18 15:12:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 492. [2024-11-18 15:12:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 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-11-18 15:12:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 718 transitions. [2024-11-18 15:12:40,830 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 718 transitions. Word has length 98 [2024-11-18 15:12:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:40,830 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 718 transitions. [2024-11-18 15:12:40,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-11-18 15:12:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 718 transitions. [2024-11-18 15:12:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 15:12:40,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:40,838 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-11-18 15:12:40,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 15:12:40,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1180437433, now seen corresponding path program 1 times [2024-11-18 15:12:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880102993] [2024-11-18 15:12:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880102993] [2024-11-18 15:12:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880102993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:40,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871148526] [2024-11-18 15:12:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:41,000 INFO L87 Difference]: Start difference. First operand 492 states and 718 transitions. 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-11-18 15:12:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:41,035 INFO L93 Difference]: Finished difference Result 958 states and 1393 transitions. [2024-11-18 15:12:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:41,037 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-11-18 15:12:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:41,039 INFO L225 Difference]: With dead ends: 958 [2024-11-18 15:12:41,039 INFO L226 Difference]: Without dead ends: 494 [2024-11-18 15:12:41,042 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-11-18 15:12:41,045 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 780 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-11-18 15:12:41,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 780 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-18 15:12:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-18 15:12:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-18 15:12:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 720 transitions. [2024-11-18 15:12:41,072 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 720 transitions. Word has length 99 [2024-11-18 15:12:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:41,073 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 720 transitions. [2024-11-18 15:12:41,073 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-11-18 15:12:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 720 transitions. [2024-11-18 15:12:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-18 15:12:41,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:41,076 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-11-18 15:12:41,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 15:12:41,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:41,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -56994056, now seen corresponding path program 1 times [2024-11-18 15:12:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047325451] [2024-11-18 15:12:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047325451] [2024-11-18 15:12:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047325451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306327328] [2024-11-18 15:12:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:41,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:41,179 INFO L87 Difference]: Start difference. First operand 494 states and 720 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-11-18 15:12:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:41,222 INFO L93 Difference]: Finished difference Result 1025 states and 1550 transitions. [2024-11-18 15:12:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:41,223 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-11-18 15:12:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:41,226 INFO L225 Difference]: With dead ends: 1025 [2024-11-18 15:12:41,227 INFO L226 Difference]: Without dead ends: 658 [2024-11-18 15:12:41,228 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-11-18 15:12:41,229 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 233 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 803 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-11-18 15:12:41,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 803 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-18 15:12:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2024-11-18 15:12:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 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-11-18 15:12:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 964 transitions. [2024-11-18 15:12:41,244 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 964 transitions. Word has length 100 [2024-11-18 15:12:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:41,244 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 964 transitions. [2024-11-18 15:12:41,245 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-11-18 15:12:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 964 transitions. [2024-11-18 15:12:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-18 15:12:41,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:41,264 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-11-18 15:12:41,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 15:12:41,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 329606004, now seen corresponding path program 1 times [2024-11-18 15:12:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983286486] [2024-11-18 15:12:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:41,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983286486] [2024-11-18 15:12:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983286486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761630984] [2024-11-18 15:12:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:41,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:41,797 INFO L87 Difference]: Start difference. First operand 642 states and 964 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-11-18 15:12:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:41,849 INFO L93 Difference]: Finished difference Result 1274 states and 1914 transitions. [2024-11-18 15:12:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-11-18 15:12:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:41,853 INFO L225 Difference]: With dead ends: 1274 [2024-11-18 15:12:41,857 INFO L226 Difference]: Without dead ends: 640 [2024-11-18 15:12:41,858 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-11-18 15:12:41,860 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 24 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:41,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1245 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-18 15:12:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-11-18 15:12:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 1.5047021943573669) internal successors, (960), 639 states have internal predecessors, (960), 0 states have call successors, (0), 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-11-18 15:12:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2024-11-18 15:12:41,878 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 100 [2024-11-18 15:12:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:41,878 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2024-11-18 15:12:41,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-11-18 15:12:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2024-11-18 15:12:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-18 15:12:41,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:41,880 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-11-18 15:12:41,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 15:12:41,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:41,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash 902258575, now seen corresponding path program 1 times [2024-11-18 15:12:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424052354] [2024-11-18 15:12:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424052354] [2024-11-18 15:12:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424052354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:41,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18272889] [2024-11-18 15:12:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:41,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:42,001 INFO L87 Difference]: Start difference. First operand 640 states and 960 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-11-18 15:12:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:42,062 INFO L93 Difference]: Finished difference Result 1404 states and 2123 transitions. [2024-11-18 15:12:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:42,062 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-11-18 15:12:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:42,066 INFO L225 Difference]: With dead ends: 1404 [2024-11-18 15:12:42,068 INFO L226 Difference]: Without dead ends: 955 [2024-11-18 15:12:42,071 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-11-18 15:12:42,072 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 322 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:42,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 804 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-18 15:12:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 934. [2024-11-18 15:12:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 932 states have (on average 1.488197424892704) internal successors, (1387), 933 states have internal predecessors, (1387), 0 states have call successors, (0), 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-11-18 15:12:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1387 transitions. [2024-11-18 15:12:42,096 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1387 transitions. Word has length 100 [2024-11-18 15:12:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:42,096 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1387 transitions. [2024-11-18 15:12:42,097 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-11-18 15:12:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1387 transitions. [2024-11-18 15:12:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 15:12:42,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:42,098 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] [2024-11-18 15:12:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 15:12:42,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash -569395796, now seen corresponding path program 1 times [2024-11-18 15:12:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558493088] [2024-11-18 15:12:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:42,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:42,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558493088] [2024-11-18 15:12:42,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558493088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322898258] [2024-11-18 15:12:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:42,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:42,214 INFO L87 Difference]: Start difference. First operand 934 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:42,260 INFO L93 Difference]: Finished difference Result 2030 states and 3129 transitions. [2024-11-18 15:12:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-18 15:12:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:42,270 INFO L225 Difference]: With dead ends: 2030 [2024-11-18 15:12:42,271 INFO L226 Difference]: Without dead ends: 1362 [2024-11-18 15:12:42,272 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-11-18 15:12:42,273 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 268 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:42,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 750 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-18 15:12:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1318. [2024-11-18 15:12:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1316 states have (on average 1.527355623100304) internal successors, (2010), 1317 states have internal predecessors, (2010), 0 states have call successors, (0), 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-11-18 15:12:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2010 transitions. [2024-11-18 15:12:42,307 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2010 transitions. Word has length 102 [2024-11-18 15:12:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:42,308 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 2010 transitions. [2024-11-18 15:12:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2010 transitions. [2024-11-18 15:12:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 15:12:42,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:42,310 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-11-18 15:12:42,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 15:12:42,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:42,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:42,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1182950444, now seen corresponding path program 1 times [2024-11-18 15:12:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047394909] [2024-11-18 15:12:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047394909] [2024-11-18 15:12:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047394909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:42,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599421825] [2024-11-18 15:12:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:42,654 INFO L87 Difference]: Start difference. First operand 1318 states and 2010 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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-11-18 15:12:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:42,731 INFO L93 Difference]: Finished difference Result 3362 states and 5133 transitions. [2024-11-18 15:12:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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-11-18 15:12:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:42,743 INFO L225 Difference]: With dead ends: 3362 [2024-11-18 15:12:42,744 INFO L226 Difference]: Without dead ends: 2081 [2024-11-18 15:12:42,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 15:12:42,749 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 647 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:42,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 994 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-11-18 15:12:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2066. [2024-11-18 15:12:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2064 states have (on average 1.5218023255813953) internal successors, (3141), 2065 states have internal predecessors, (3141), 0 states have call successors, (0), 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-11-18 15:12:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3141 transitions. [2024-11-18 15:12:42,806 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3141 transitions. Word has length 103 [2024-11-18 15:12:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 3141 transitions. [2024-11-18 15:12:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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-11-18 15:12:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3141 transitions. [2024-11-18 15:12:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 15:12:42,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:42,810 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] [2024-11-18 15:12:42,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 15:12:42,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:42,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2046313953, now seen corresponding path program 1 times [2024-11-18 15:12:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861459108] [2024-11-18 15:12:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861459108] [2024-11-18 15:12:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861459108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556502308] [2024-11-18 15:12:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:43,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:43,171 INFO L87 Difference]: Start difference. First operand 2066 states and 3141 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-18 15:12:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:43,209 INFO L93 Difference]: Finished difference Result 4111 states and 6250 transitions. [2024-11-18 15:12:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-18 15:12:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:43,217 INFO L225 Difference]: With dead ends: 4111 [2024-11-18 15:12:43,217 INFO L226 Difference]: Without dead ends: 2066 [2024-11-18 15:12:43,222 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-11-18 15:12:43,224 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 20 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:43,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1223 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2024-11-18 15:12:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2024-11-18 15:12:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2064 states have (on average 1.5203488372093024) internal successors, (3138), 2065 states have internal predecessors, (3138), 0 states have call successors, (0), 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-11-18 15:12:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3138 transitions. [2024-11-18 15:12:43,283 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3138 transitions. Word has length 105 [2024-11-18 15:12:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:43,283 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 3138 transitions. [2024-11-18 15:12:43,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-18 15:12:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3138 transitions. [2024-11-18 15:12:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 15:12:43,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:43,287 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] [2024-11-18 15:12:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 15:12:43,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 499752606, now seen corresponding path program 1 times [2024-11-18 15:12:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805899645] [2024-11-18 15:12:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805899645] [2024-11-18 15:12:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805899645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993595407] [2024-11-18 15:12:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:43,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:43,409 INFO L87 Difference]: Start difference. First operand 2066 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-18 15:12:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:43,476 INFO L93 Difference]: Finished difference Result 4898 states and 7504 transitions. [2024-11-18 15:12:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-18 15:12:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:43,491 INFO L225 Difference]: With dead ends: 4898 [2024-11-18 15:12:43,491 INFO L226 Difference]: Without dead ends: 3195 [2024-11-18 15:12:43,495 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-11-18 15:12:43,495 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 314 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:43,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 822 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-11-18 15:12:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3182. [2024-11-18 15:12:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3180 states have (on average 1.5050314465408805) internal successors, (4786), 3181 states have internal predecessors, (4786), 0 states have call successors, (0), 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-11-18 15:12:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4786 transitions. [2024-11-18 15:12:43,593 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4786 transitions. Word has length 105 [2024-11-18 15:12:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:43,593 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4786 transitions. [2024-11-18 15:12:43,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-18 15:12:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4786 transitions. [2024-11-18 15:12:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 15:12:43,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:43,596 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] [2024-11-18 15:12:43,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 15:12:43,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:43,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1602371620, now seen corresponding path program 1 times [2024-11-18 15:12:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:43,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777324229] [2024-11-18 15:12:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:43,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-11-18 15:12:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777324229] [2024-11-18 15:12:43,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777324229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:43,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:43,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780415307] [2024-11-18 15:12:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:43,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:43,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:43,692 INFO L87 Difference]: Start difference. First operand 3182 states and 4786 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:43,765 INFO L93 Difference]: Finished difference Result 7883 states and 12196 transitions. [2024-11-18 15:12:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-18 15:12:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:43,784 INFO L225 Difference]: With dead ends: 7883 [2024-11-18 15:12:43,784 INFO L226 Difference]: Without dead ends: 5106 [2024-11-18 15:12:43,789 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-11-18 15:12:43,790 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 243 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:43,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 767 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2024-11-18 15:12:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 4900. [2024-11-18 15:12:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4898 states have (on average 1.5410371580236832) internal successors, (7548), 4899 states have internal predecessors, (7548), 0 states have call successors, (0), 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-11-18 15:12:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 7548 transitions. [2024-11-18 15:12:43,900 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 7548 transitions. Word has length 107 [2024-11-18 15:12:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 4900 states and 7548 transitions. [2024-11-18 15:12:43,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 7548 transitions. [2024-11-18 15:12:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 15:12:43,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:43,903 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-11-18 15:12:43,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 15:12:43,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:43,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1761194430, now seen corresponding path program 1 times [2024-11-18 15:12:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:43,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803088739] [2024-11-18 15:12:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803088739] [2024-11-18 15:12:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803088739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548080123] [2024-11-18 15:12:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:43,997 INFO L87 Difference]: Start difference. First operand 4900 states and 7548 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-11-18 15:12:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:44,221 INFO L93 Difference]: Finished difference Result 13716 states and 21403 transitions. [2024-11-18 15:12:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:44,222 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-11-18 15:12:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:44,262 INFO L225 Difference]: With dead ends: 13716 [2024-11-18 15:12:44,262 INFO L226 Difference]: Without dead ends: 9434 [2024-11-18 15:12:44,274 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-11-18 15:12:44,275 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 292 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:44,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 638 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:12:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9434 states. [2024-11-18 15:12:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9434 to 9362. [2024-11-18 15:12:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9362 states, 9360 states have (on average 1.5463675213675214) internal successors, (14474), 9361 states have internal predecessors, (14474), 0 states have call successors, (0), 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-11-18 15:12:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 14474 transitions. [2024-11-18 15:12:44,493 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 14474 transitions. Word has length 108 [2024-11-18 15:12:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:44,493 INFO L471 AbstractCegarLoop]: Abstraction has 9362 states and 14474 transitions. [2024-11-18 15:12:44,494 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-11-18 15:12:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 14474 transitions. [2024-11-18 15:12:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 15:12:44,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:44,497 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-11-18 15:12:44,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 15:12:44,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:44,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1561444797, now seen corresponding path program 1 times [2024-11-18 15:12:44,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:44,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34519619] [2024-11-18 15:12:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34519619] [2024-11-18 15:12:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34519619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143186650] [2024-11-18 15:12:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:44,836 INFO L87 Difference]: Start difference. First operand 9362 states and 14474 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-18 15:12:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:45,065 INFO L93 Difference]: Finished difference Result 33677 states and 51888 transitions. [2024-11-18 15:12:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-18 15:12:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:45,119 INFO L225 Difference]: With dead ends: 33677 [2024-11-18 15:12:45,120 INFO L226 Difference]: Without dead ends: 24380 [2024-11-18 15:12:45,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 15:12:45,133 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 650 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:45,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1304 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24380 states. [2024-11-18 15:12:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24380 to 16805. [2024-11-18 15:12:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16805 states, 16803 states have (on average 1.5290126763078022) internal successors, (25692), 16804 states have internal predecessors, (25692), 0 states have call successors, (0), 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-11-18 15:12:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16805 states to 16805 states and 25692 transitions. [2024-11-18 15:12:45,618 INFO L78 Accepts]: Start accepts. Automaton has 16805 states and 25692 transitions. Word has length 108 [2024-11-18 15:12:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:45,619 INFO L471 AbstractCegarLoop]: Abstraction has 16805 states and 25692 transitions. [2024-11-18 15:12:45,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-11-18 15:12:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16805 states and 25692 transitions. [2024-11-18 15:12:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 15:12:45,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:45,627 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-11-18 15:12:45,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 15:12:45,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:45,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1148788313, now seen corresponding path program 1 times [2024-11-18 15:12:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000022751] [2024-11-18 15:12:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000022751] [2024-11-18 15:12:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000022751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801337005] [2024-11-18 15:12:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:45,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:45,713 INFO L87 Difference]: Start difference. First operand 16805 states and 25692 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) 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-11-18 15:12:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:45,857 INFO L93 Difference]: Finished difference Result 33493 states and 51225 transitions. [2024-11-18 15:12:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:45,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) 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-11-18 15:12:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:45,897 INFO L225 Difference]: With dead ends: 33493 [2024-11-18 15:12:45,898 INFO L226 Difference]: Without dead ends: 16813 [2024-11-18 15:12:45,920 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-11-18 15:12:45,921 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 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-11-18 15:12:45,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16813 states. [2024-11-18 15:12:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16813 to 16813. [2024-11-18 15:12:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16813 states, 16811 states have (on average 1.5287609303432277) internal successors, (25700), 16812 states have internal predecessors, (25700), 0 states have call successors, (0), 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-11-18 15:12:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16813 states to 16813 states and 25700 transitions. [2024-11-18 15:12:46,597 INFO L78 Accepts]: Start accepts. Automaton has 16813 states and 25700 transitions. Word has length 109 [2024-11-18 15:12:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:46,598 INFO L471 AbstractCegarLoop]: Abstraction has 16813 states and 25700 transitions. [2024-11-18 15:12:46,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) 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-11-18 15:12:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16813 states and 25700 transitions. [2024-11-18 15:12:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 15:12:46,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:46,603 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-11-18 15:12:46,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 15:12:46,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:46,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash -248848316, now seen corresponding path program 1 times [2024-11-18 15:12:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140090985] [2024-11-18 15:12:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140090985] [2024-11-18 15:12:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140090985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135007419] [2024-11-18 15:12:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:46,928 INFO L87 Difference]: Start difference. First operand 16813 states and 25700 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:47,080 INFO L93 Difference]: Finished difference Result 33509 states and 51245 transitions. [2024-11-18 15:12:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:47,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:47,122 INFO L225 Difference]: With dead ends: 33509 [2024-11-18 15:12:47,123 INFO L226 Difference]: Without dead ends: 16813 [2024-11-18 15:12:47,142 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-11-18 15:12:47,143 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 10 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:47,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16813 states. [2024-11-18 15:12:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16813 to 16809. [2024-11-18 15:12:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16809 states, 16807 states have (on average 1.5283512822038436) internal successors, (25687), 16808 states have internal predecessors, (25687), 0 states have call successors, (0), 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-11-18 15:12:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16809 states to 16809 states and 25687 transitions. [2024-11-18 15:12:47,616 INFO L78 Accepts]: Start accepts. Automaton has 16809 states and 25687 transitions. Word has length 110 [2024-11-18 15:12:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 16809 states and 25687 transitions. [2024-11-18 15:12:47,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16809 states and 25687 transitions. [2024-11-18 15:12:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 15:12:47,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:47,624 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-11-18 15:12:47,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 15:12:47,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1186160317, now seen corresponding path program 1 times [2024-11-18 15:12:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029548442] [2024-11-18 15:12:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:47,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029548442] [2024-11-18 15:12:47,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029548442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:47,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630291610] [2024-11-18 15:12:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:47,718 INFO L87 Difference]: Start difference. First operand 16809 states and 25687 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-11-18 15:12:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:47,871 INFO L93 Difference]: Finished difference Result 45973 states and 70403 transitions. [2024-11-18 15:12:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:47,872 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-11-18 15:12:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:47,940 INFO L225 Difference]: With dead ends: 45973 [2024-11-18 15:12:47,941 INFO L226 Difference]: Without dead ends: 30363 [2024-11-18 15:12:47,975 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-11-18 15:12:47,976 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 297 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1049 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-11-18 15:12:47,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1049 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30363 states. [2024-11-18 15:12:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30291. [2024-11-18 15:12:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30291 states, 30289 states have (on average 1.5085014361649445) internal successors, (45691), 30290 states have internal predecessors, (45691), 0 states have call successors, (0), 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-11-18 15:12:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30291 states to 30291 states and 45691 transitions. [2024-11-18 15:12:48,874 INFO L78 Accepts]: Start accepts. Automaton has 30291 states and 45691 transitions. Word has length 110 [2024-11-18 15:12:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:48,875 INFO L471 AbstractCegarLoop]: Abstraction has 30291 states and 45691 transitions. [2024-11-18 15:12:48,875 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-11-18 15:12:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30291 states and 45691 transitions. [2024-11-18 15:12:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 15:12:48,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:12:48,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 15:12:48,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash 308743968, now seen corresponding path program 1 times [2024-11-18 15:12:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833701269] [2024-11-18 15:12:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833701269] [2024-11-18 15:12:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833701269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:49,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981652759] [2024-11-18 15:12:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:49,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:49,343 INFO L87 Difference]: Start difference. First operand 30291 states and 45691 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:49,626 INFO L93 Difference]: Finished difference Result 53518 states and 81003 transitions. [2024-11-18 15:12:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:49,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:49,675 INFO L225 Difference]: With dead ends: 53518 [2024-11-18 15:12:49,675 INFO L226 Difference]: Without dead ends: 24278 [2024-11-18 15:12:49,694 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-11-18 15:12:49,695 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 13 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:49,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2024-11-18 15:12:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 24278. [2024-11-18 15:12:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24278 states, 24276 states have (on average 1.5053550832097544) internal successors, (36544), 24277 states have internal predecessors, (36544), 0 states have call successors, (0), 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-11-18 15:12:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24278 states to 24278 states and 36544 transitions. [2024-11-18 15:12:50,111 INFO L78 Accepts]: Start accepts. Automaton has 24278 states and 36544 transitions. Word has length 110 [2024-11-18 15:12:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:50,111 INFO L471 AbstractCegarLoop]: Abstraction has 24278 states and 36544 transitions. [2024-11-18 15:12:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 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-11-18 15:12:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24278 states and 36544 transitions. [2024-11-18 15:12:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 15:12:50,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:50,120 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] [2024-11-18 15:12:50,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 15:12:50,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1247226342, now seen corresponding path program 1 times [2024-11-18 15:12:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104908904] [2024-11-18 15:12:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104908904] [2024-11-18 15:12:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104908904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 15:12:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859066541] [2024-11-18 15:12:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:50,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 15:12:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:50,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 15:12:50,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:12:50,730 INFO L87 Difference]: Start difference. First operand 24278 states and 36544 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:51,017 INFO L93 Difference]: Finished difference Result 44594 states and 68413 transitions. [2024-11-18 15:12:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-18 15:12:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:51,075 INFO L225 Difference]: With dead ends: 44594 [2024-11-18 15:12:51,075 INFO L226 Difference]: Without dead ends: 24374 [2024-11-18 15:12:51,101 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-11-18 15:12:51,102 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1638 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:51,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 707 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24374 states. [2024-11-18 15:12:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24374 to 24374. [2024-11-18 15:12:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24374 states, 24372 states have (on average 1.4971278516330215) internal successors, (36488), 24373 states have internal predecessors, (36488), 0 states have call successors, (0), 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-11-18 15:12:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24374 states to 24374 states and 36488 transitions. [2024-11-18 15:12:51,741 INFO L78 Accepts]: Start accepts. Automaton has 24374 states and 36488 transitions. Word has length 113 [2024-11-18 15:12:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 24374 states and 36488 transitions. [2024-11-18 15:12:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24374 states and 36488 transitions. [2024-11-18 15:12:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 15:12:51,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:51,751 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] [2024-11-18 15:12:51,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 15:12:51,752 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1602851438, now seen corresponding path program 1 times [2024-11-18 15:12:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871015286] [2024-11-18 15:12:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871015286] [2024-11-18 15:12:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871015286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857359257] [2024-11-18 15:12:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:52,060 INFO L87 Difference]: Start difference. First operand 24374 states and 36488 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:52,452 INFO L93 Difference]: Finished difference Result 39997 states and 60006 transitions. [2024-11-18 15:12:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:12:52,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-18 15:12:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:52,501 INFO L225 Difference]: With dead ends: 39997 [2024-11-18 15:12:52,501 INFO L226 Difference]: Without dead ends: 22649 [2024-11-18 15:12:52,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:12:52,518 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 309 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1075 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1075 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22649 states. [2024-11-18 15:12:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22649 to 22350. [2024-11-18 15:12:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22350 states, 22348 states have (on average 1.4994630391981385) internal successors, (33510), 22349 states have internal predecessors, (33510), 0 states have call successors, (0), 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-11-18 15:12:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22350 states to 22350 states and 33510 transitions. [2024-11-18 15:12:52,845 INFO L78 Accepts]: Start accepts. Automaton has 22350 states and 33510 transitions. Word has length 113 [2024-11-18 15:12:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:52,846 INFO L471 AbstractCegarLoop]: Abstraction has 22350 states and 33510 transitions. [2024-11-18 15:12:52,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 15:12:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22350 states and 33510 transitions. [2024-11-18 15:12:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 15:12:52,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:52,853 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-11-18 15:12:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 15:12:52,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -684328491, now seen corresponding path program 1 times [2024-11-18 15:12:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902029675] [2024-11-18 15:12:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902029675] [2024-11-18 15:12:53,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902029675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660834159] [2024-11-18 15:12:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:53,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:53,204 INFO L87 Difference]: Start difference. First operand 22350 states and 33510 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-11-18 15:12:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:53,458 INFO L93 Difference]: Finished difference Result 67504 states and 101059 transitions. [2024-11-18 15:12:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:12:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-11-18 15:12:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:53,573 INFO L225 Difference]: With dead ends: 67504 [2024-11-18 15:12:53,574 INFO L226 Difference]: Without dead ends: 45294 [2024-11-18 15:12:53,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:12:53,611 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1017 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:53,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1565 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45294 states. [2024-11-18 15:12:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45294 to 22542. [2024-11-18 15:12:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22542 states, 22540 states have (on average 1.4956521739130435) internal successors, (33712), 22541 states have internal predecessors, (33712), 0 states have call successors, (0), 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-11-18 15:12:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22542 states to 22542 states and 33712 transitions. [2024-11-18 15:12:54,357 INFO L78 Accepts]: Start accepts. Automaton has 22542 states and 33712 transitions. Word has length 115 [2024-11-18 15:12:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:54,357 INFO L471 AbstractCegarLoop]: Abstraction has 22542 states and 33712 transitions. [2024-11-18 15:12:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-11-18 15:12:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 22542 states and 33712 transitions. [2024-11-18 15:12:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-18 15:12:54,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:54,367 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-11-18 15:12:54,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-18 15:12:54,368 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:54,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash 64900185, now seen corresponding path program 1 times [2024-11-18 15:12:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407496029] [2024-11-18 15:12:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:54,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407496029] [2024-11-18 15:12:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407496029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:54,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 15:12:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796456133] [2024-11-18 15:12:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:12:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:12:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 15:12:54,462 INFO L87 Difference]: Start difference. First operand 22542 states and 33712 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) 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-11-18 15:12:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:54,617 INFO L93 Difference]: Finished difference Result 38849 states and 58268 transitions. [2024-11-18 15:12:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:12:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) 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-11-18 15:12:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:54,666 INFO L225 Difference]: With dead ends: 38849 [2024-11-18 15:12:54,666 INFO L226 Difference]: Without dead ends: 22554 [2024-11-18 15:12:54,688 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-11-18 15:12:54,689 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 748 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-11-18 15:12:54,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22554 states. [2024-11-18 15:12:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22554 to 22554. [2024-11-18 15:12:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22554 states, 22552 states have (on average 1.4953884356154665) internal successors, (33724), 22553 states have internal predecessors, (33724), 0 states have call successors, (0), 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-11-18 15:12:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 33724 transitions. [2024-11-18 15:12:55,293 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 33724 transitions. Word has length 116 [2024-11-18 15:12:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:55,293 INFO L471 AbstractCegarLoop]: Abstraction has 22554 states and 33724 transitions. [2024-11-18 15:12:55,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) 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-11-18 15:12:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 33724 transitions. [2024-11-18 15:12:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 15:12:55,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:55,301 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-11-18 15:12:55,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 15:12:55,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -426513610, now seen corresponding path program 1 times [2024-11-18 15:12:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:55,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388675895] [2024-11-18 15:12:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388675895] [2024-11-18 15:12:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388675895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:55,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:55,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:55,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599558651] [2024-11-18 15:12:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:55,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:12:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:12:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:12:55,422 INFO L87 Difference]: Start difference. First operand 22554 states and 33724 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-11-18 15:12:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:55,668 INFO L93 Difference]: Finished difference Result 41687 states and 62813 transitions. [2024-11-18 15:12:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:12:55,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-11-18 15:12:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:55,710 INFO L225 Difference]: With dead ends: 41687 [2024-11-18 15:12:55,710 INFO L226 Difference]: Without dead ends: 22554 [2024-11-18 15:12:55,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 15:12:55,733 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 947 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 378 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:12:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22554 states. [2024-11-18 15:12:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22554 to 22554. [2024-11-18 15:12:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22554 states, 22552 states have (on average 1.4840368925150762) internal successors, (33468), 22553 states have internal predecessors, (33468), 0 states have call successors, (0), 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-11-18 15:12:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 33468 transitions. [2024-11-18 15:12:56,061 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 33468 transitions. Word has length 117 [2024-11-18 15:12:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:56,061 INFO L471 AbstractCegarLoop]: Abstraction has 22554 states and 33468 transitions. [2024-11-18 15:12:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-11-18 15:12:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 33468 transitions. [2024-11-18 15:12:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 15:12:56,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:56,070 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-11-18 15:12:56,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 15:12:56,070 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:56,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1750980389, now seen corresponding path program 1 times [2024-11-18 15:12:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:56,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299846526] [2024-11-18 15:12:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299846526] [2024-11-18 15:12:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299846526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238986436] [2024-11-18 15:12:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:56,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:56,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:56,391 INFO L87 Difference]: Start difference. First operand 22554 states and 33468 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:56,557 INFO L93 Difference]: Finished difference Result 45448 states and 67318 transitions. [2024-11-18 15:12:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:12:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:56,598 INFO L225 Difference]: With dead ends: 45448 [2024-11-18 15:12:56,598 INFO L226 Difference]: Without dead ends: 23260 [2024-11-18 15:12:56,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:12:56,621 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 304 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:56,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1486 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23260 states. [2024-11-18 15:12:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23260 to 22829. [2024-11-18 15:12:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22829 states, 22827 states have (on average 1.479081789109388) internal successors, (33763), 22828 states have internal predecessors, (33763), 0 states have call successors, (0), 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-11-18 15:12:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22829 states to 22829 states and 33763 transitions. [2024-11-18 15:12:56,953 INFO L78 Accepts]: Start accepts. Automaton has 22829 states and 33763 transitions. Word has length 117 [2024-11-18 15:12:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:56,953 INFO L471 AbstractCegarLoop]: Abstraction has 22829 states and 33763 transitions. [2024-11-18 15:12:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22829 states and 33763 transitions. [2024-11-18 15:12:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 15:12:56,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:56,962 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-11-18 15:12:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-18 15:12:56,963 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2053868748, now seen corresponding path program 1 times [2024-11-18 15:12:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264552503] [2024-11-18 15:12:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264552503] [2024-11-18 15:12:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264552503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:12:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820691690] [2024-11-18 15:12:57,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:12:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:12:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:12:57,394 INFO L87 Difference]: Start difference. First operand 22829 states and 33763 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:12:57,521 INFO L93 Difference]: Finished difference Result 32866 states and 48736 transitions. [2024-11-18 15:12:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:12:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:12:57,557 INFO L225 Difference]: With dead ends: 32866 [2024-11-18 15:12:57,557 INFO L226 Difference]: Without dead ends: 20826 [2024-11-18 15:12:57,575 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-11-18 15:12:57,578 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 2 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:12:57,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1138 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:12:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20826 states. [2024-11-18 15:12:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20826 to 20825. [2024-11-18 15:12:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20825 states, 20823 states have (on average 1.479805983767949) internal successors, (30814), 20824 states have internal predecessors, (30814), 0 states have call successors, (0), 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-11-18 15:12:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20825 states to 20825 states and 30814 transitions. [2024-11-18 15:12:57,908 INFO L78 Accepts]: Start accepts. Automaton has 20825 states and 30814 transitions. Word has length 117 [2024-11-18 15:12:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:12:57,909 INFO L471 AbstractCegarLoop]: Abstraction has 20825 states and 30814 transitions. [2024-11-18 15:12:57,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-18 15:12:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20825 states and 30814 transitions. [2024-11-18 15:12:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 15:12:57,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:12:57,917 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] [2024-11-18 15:12:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 15:12:57,917 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:12:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:12:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1756219013, now seen corresponding path program 1 times [2024-11-18 15:12:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:12:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720876868] [2024-11-18 15:12:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:12:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:12:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:12:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:12:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:12:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720876868] [2024-11-18 15:12:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720876868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:12:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:12:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-18 15:12:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743648937] [2024-11-18 15:12:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:12:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 15:12:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:12:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 15:12:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-18 15:12:59,946 INFO L87 Difference]: Start difference. First operand 20825 states and 30814 transitions. Second operand has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-18 15:13:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:13:03,750 INFO L93 Difference]: Finished difference Result 82657 states and 125489 transitions. [2024-11-18 15:13:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 15:13:03,753 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-18 15:13:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:13:03,898 INFO L225 Difference]: With dead ends: 82657 [2024-11-18 15:13:03,898 INFO L226 Difference]: Without dead ends: 74828 [2024-11-18 15:13:03,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2024-11-18 15:13:03,936 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 2726 mSDsluCounter, 7473 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 8104 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 15:13:03,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 8104 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 15:13:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74828 states. [2024-11-18 15:13:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74828 to 21444. [2024-11-18 15:13:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21444 states, 21442 states have (on average 1.472204085439791) internal successors, (31567), 21443 states have internal predecessors, (31567), 0 states have call successors, (0), 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-11-18 15:13:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21444 states to 21444 states and 31567 transitions. [2024-11-18 15:13:04,740 INFO L78 Accepts]: Start accepts. Automaton has 21444 states and 31567 transitions. Word has length 119 [2024-11-18 15:13:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:13:04,740 INFO L471 AbstractCegarLoop]: Abstraction has 21444 states and 31567 transitions. [2024-11-18 15:13:04,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-18 15:13:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21444 states and 31567 transitions. [2024-11-18 15:13:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 15:13:04,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:13:04,750 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] [2024-11-18 15:13:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-18 15:13:04,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:13:04,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:13:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1483364393, now seen corresponding path program 1 times [2024-11-18 15:13:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:13:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006474059] [2024-11-18 15:13:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:13:04,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:13:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:13:04,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 15:13:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:13:04,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 15:13:04,959 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 15:13:04,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 15:13:04,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 15:13:04,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-18 15:13:04,965 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] [2024-11-18 15:13:05,144 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 15:13:05,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:13:05 BoogieIcfgContainer [2024-11-18 15:13:05,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 15:13:05,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 15:13:05,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 15:13:05,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 15:13:05,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:39" (3/4) ... [2024-11-18 15:13:05,150 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 15:13:05,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 15:13:05,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 15:13:05,347 INFO L158 Benchmark]: Toolchain (without parser) took 28575.79ms. Allocated memory was 138.4MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 83.4MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 906.0MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,347 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 138.4MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 15:13:05,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.97ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 95.1MB in the end (delta: -12.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.46ms. Allocated memory is still 138.4MB. Free memory was 95.1MB in the beginning and 88.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,347 INFO L158 Benchmark]: Boogie Preprocessor took 138.89ms. Allocated memory is still 138.4MB. Free memory was 88.9MB in the beginning and 83.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,348 INFO L158 Benchmark]: RCFGBuilder took 1400.85ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 83.3MB in the beginning and 106.5MB in the end (delta: -23.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,349 INFO L158 Benchmark]: TraceAbstraction took 26098.56ms. Allocated memory was 186.6MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 105.4MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 839.9MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,350 INFO L158 Benchmark]: Witness Printer took 197.57ms. Allocated memory is still 10.6GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-18 15:13:05,351 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.23ms. Allocated memory is still 138.4MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.97ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 95.1MB in the end (delta: -12.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.46ms. Allocated memory is still 138.4MB. Free memory was 95.1MB in the beginning and 88.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.89ms. Allocated memory is still 138.4MB. Free memory was 88.9MB in the beginning and 83.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1400.85ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 83.3MB in the beginning and 106.5MB in the end (delta: -23.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26098.56ms. Allocated memory was 186.6MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 105.4MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 839.9MB. Max. memory is 16.1GB. * Witness Printer took 197.57ms. Allocated memory is still 10.6GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 37.7MB). 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: 583]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] port_t p12 = 0; [L28] char p12_old = '\x0'; [L29] char p12_new = '\x0'; [L30] _Bool ep12 = 0; [L31] port_t p13 = 0; [L32] char p13_old = '\x0'; [L33] char p13_new = '\x0'; [L34] _Bool ep13 = 0; [L35] port_t p21 = 0; [L36] char p21_old = '\x0'; [L37] char p21_new = '\x0'; [L38] _Bool ep21 = 0; [L39] port_t p23 = 0; [L40] char p23_old = '\x0'; [L41] char p23_new = '\x0'; [L42] _Bool ep23 = 0; [L43] port_t p31 = 0; [L44] char p31_old = '\x0'; [L45] char p31_new = '\x0'; [L46] _Bool ep31 = 0; [L47] port_t p32 = 0; [L48] char p32_old = '\x0'; [L49] char p32_new = '\x0'; [L50] _Bool ep32 = 0; [L51] char id1 = '\x0'; [L52] unsigned char r1 = '\x0'; [L53] char st1 = '\x0'; [L54] char nl1 = '\x0'; [L55] char m1 = '\x0'; [L56] char max1 = '\x0'; [L57] _Bool mode1 = 0; [L58] _Bool newmax1 = 0; [L59] char id2 = '\x0'; [L60] unsigned char r2 = '\x0'; [L61] char st2 = '\x0'; [L62] char nl2 = '\x0'; [L63] char m2 = '\x0'; [L64] char max2 = '\x0'; [L65] _Bool mode2 = 0; [L66] _Bool newmax2 = 0; [L67] char id3 = '\x0'; [L68] unsigned char r3 = '\x0'; [L69] char st3 = '\x0'; [L70] char nl3 = '\x0'; [L71] char m3 = '\x0'; [L72] char max3 = '\x0'; [L73] _Bool mode3 = 0; [L74] _Bool newmax3 = 0; [L78] void (*nodes[3])() = { &node1, &node2, &node3 }; [L82] int __return_1248; [L83] int __return_1394; [L84] int __return_1872; [L85] int __return_1528; [L86] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, 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] [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_uchar() [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_uchar() [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_uchar() [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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r121 == 0) [L150] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L152] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L153] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1978] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1980] COND TRUE !(ep23 == 0) [L1982] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___0=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L157] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1955] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1957] COND TRUE !(ep31 == 0) [L1959] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___1=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L162] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L163] COND TRUE !(init__r231 == 0) [L165] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r311=1, init__r321=0, init__tmp___2=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L167] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L168] COND TRUE !(init__r311 == 0) [L170] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, init__tmp___3=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L172] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1886] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L1888] COND TRUE !(ep12 == 0) [L1890] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L177] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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_1248 = init__tmp___5 [L240] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=127, max3=0, 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 [L257] _Bool node1__newmax; [L258] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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] [L259] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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] [L265] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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 !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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 TRUE !(newmax1 == 0) [L271] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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] [L272] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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] [L274] COND TRUE p12_new == nomsg [L276] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, 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] [L278] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L280] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] mode1 = 1 [L295] _Bool node2__newmax; [L296] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L297] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L303] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L305] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L318] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L320] COND TRUE !(newmax2 == 0) [L322] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L323] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L325] COND TRUE p23_new == nomsg [L327] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=127, nomsg=-1, p12=0, p12_new=4, 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] [L329] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L331] mode2 = 1 [L333] _Bool node3__newmax; [L334] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L335] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L341] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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 !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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 TRUE !(newmax3 == 0) [L347] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L348] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L350] COND TRUE p31_new == nomsg [L352] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L354] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] mode3 = 1 [L370] p12_old = p12_new [L371] p12_new = nomsg [L372] p13_old = p13_new [L373] p13_new = nomsg [L374] p21_old = p21_new [L375] p21_new = nomsg [L376] p23_old = p23_new [L377] p23_new = nomsg [L378] p31_old = p31_new [L379] p31_new = nomsg [L380] p32_old = p32_new [L381] p32_new = nomsg [L383] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((int)r1) < 2 [L412] check__tmp = 1 [L413] __return_1394 = check__tmp [L414] main__c1 = __return_1394 [L416] _Bool __tmp_1; [L417] __tmp_1 = main__c1 [L418] _Bool assert__arg; [L419] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L420] COND FALSE !(assert__arg == 0) [L427] _Bool node1__newmax; [L428] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND FALSE !(r1 == 255) [L437] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE !(ep31 == 0) [L449] m1 = p31_old [L450] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE ((int)max1) == ((int)id1) [L461] st1 = 1 [L462] mode1 = 0 [L464] _Bool node2__newmax; [L465] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L466] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L468] COND FALSE !(r2 == 255) [L474] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, 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] [L475] COND TRUE !(ep12 == 0) [L477] m2 = p12_old [L478] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, 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] [L479] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, 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] [L484] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, 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] [L493] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, 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] [L494] COND FALSE !(((int)r2) == 2) [L500] mode2 = 0 [L502] _Bool node3__newmax; [L503] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=127, 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] [L504] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=127, 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] [L506] COND FALSE !(r3 == 255) [L512] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=127, 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] [L513] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, 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=127, 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] [L522] COND TRUE !(ep23 == 0) [L524] m3 = p23_old [L525] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=0, 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] [L526] COND TRUE ((int)m3) > ((int)max3) [L528] max3 = m3 [L529] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L531] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L532] COND FALSE !(((int)r3) == 2) [L538] mode3 = 0 [L539] p12_old = p12_new [L540] p12_new = nomsg [L541] p13_old = p13_new [L542] p13_new = nomsg [L543] p21_old = p21_new [L544] p21_new = nomsg [L545] p23_old = p23_new [L546] p23_new = nomsg [L547] p31_old = p31_new [L548] p31_new = nomsg [L549] p32_old = p32_new [L550] p32_new = nomsg [L552] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L553] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L555] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L557] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L559] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L561] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L567] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L573] check__tmp = 0 [L574] __return_1872 = check__tmp [L575] main__c1 = __return_1872 [L577] _Bool __tmp_2; [L578] __tmp_2 = main__c1 [L579] _Bool assert__arg; [L580] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L581] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] [L583] reach_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r211=0, m1=0, m2=4, m3=127, max1=4, max2=127, 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] - UnprovableResult [Line: 806]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11766 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11766 mSDsluCounter, 31403 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19827 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3044 IncrementalHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 11576 mSDtfsCounter, 3044 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30291occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 85431 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2720 NumberOfCodeBlocks, 2720 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2577 ConstructedInterpolants, 0 QuantifiedInterpolants, 9457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-11-18 15:13:05,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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