/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:48:35,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:48:35,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:48:35,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:48:35,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:48:35,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:48:35,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:48:35,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:48:35,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:48:35,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:48:35,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:48:35,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:48:35,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:48:35,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:48:35,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:48:35,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:48:35,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:48:35,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:48:35,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:48:35,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:48:35,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:48:35,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:48:35,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:48:35,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:48:35,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:48:35,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:48:35,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:48:35,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:48:35,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:48:35,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:48:35,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:48:35,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:48:35,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:48:35,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:48:35,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:48:35,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:48:35,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:48:35,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:48:35,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:48:35,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:48:35,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:48:35,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:48:35,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:48:35,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:48:35,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:48:35,958 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:48:35,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:48:35,958 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:48:35,958 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:48:35,958 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:48:35,959 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:48:35,959 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:48:35,959 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:48:35,959 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:48:35,959 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:48:35,960 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:48:35,960 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:48:35,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:48:35,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:48:35,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:48:35,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:48:35,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:48:35,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:48:35,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:48:35,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:48:35,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:48:35,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:48:35,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:48:35,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:48:35,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:48:35,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:48:35,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:35,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:48:35,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:48:35,965 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:48:36,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:48:36,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:48:36,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:48:36,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:48:36,378 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:48:36,380 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:48:36,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a247ecc/7fd9cbaab19b41fe932c89949ed471d1/FLAG689b127ac [2019-11-24 05:48:37,029 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:48:37,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:48:37,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a247ecc/7fd9cbaab19b41fe932c89949ed471d1/FLAG689b127ac [2019-11-24 05:48:37,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a247ecc/7fd9cbaab19b41fe932c89949ed471d1 [2019-11-24 05:48:37,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:48:37,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:48:37,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:37,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:48:37,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:48:37,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4236ce52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37, skipping insertion in model container [2019-11-24 05:48:37,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:48:37,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:48:37,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:38,002 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:48:38,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:38,383 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:48:38,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38 WrapperNode [2019-11-24 05:48:38,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:38,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:38,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:48:38,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:48:38,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:38,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:48:38,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:48:38,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:48:38,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... [2019-11-24 05:48:38,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:48:38,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:48:38,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:48:38,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:48:38,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:38,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:48:38,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:48:40,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:48:40,997 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:48:40,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:40 BoogieIcfgContainer [2019-11-24 05:48:40,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:48:41,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:48:41,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:48:41,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:48:41,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:48:37" (1/3) ... [2019-11-24 05:48:41,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230555e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:41, skipping insertion in model container [2019-11-24 05:48:41,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:38" (2/3) ... [2019-11-24 05:48:41,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230555e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:41, skipping insertion in model container [2019-11-24 05:48:41,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:40" (3/3) ... [2019-11-24 05:48:41,008 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:48:41,019 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:48:41,027 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 05:48:41,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 05:48:41,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:48:41,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:48:41,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:48:41,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:48:41,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:48:41,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:48:41,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:48:41,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:48:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states. [2019-11-24 05:48:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-24 05:48:41,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:41,122 INFO L410 BasicCegarLoop]: 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] [2019-11-24 05:48:41,123 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1126719293, now seen corresponding path program 1 times [2019-11-24 05:48:41,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:41,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377411709] [2019-11-24 05:48:41,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377411709] [2019-11-24 05:48:42,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:42,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:42,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144733369] [2019-11-24 05:48:42,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:42,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:42,233 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 5 states. [2019-11-24 05:48:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,412 INFO L93 Difference]: Finished difference Result 616 states and 1076 transitions. [2019-11-24 05:48:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:42,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-11-24 05:48:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,447 INFO L225 Difference]: With dead ends: 616 [2019-11-24 05:48:42,448 INFO L226 Difference]: Without dead ends: 438 [2019-11-24 05:48:42,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-24 05:48:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2019-11-24 05:48:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-11-24 05:48:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 605 transitions. [2019-11-24 05:48:42,588 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 605 transitions. Word has length 116 [2019-11-24 05:48:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,589 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 605 transitions. [2019-11-24 05:48:42,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 605 transitions. [2019-11-24 05:48:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-24 05:48:42,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,601 INFO L410 BasicCegarLoop]: 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] [2019-11-24 05:48:42,602 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1597902391, now seen corresponding path program 1 times [2019-11-24 05:48:42,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229380447] [2019-11-24 05:48:42,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:42,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229380447] [2019-11-24 05:48:42,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:42,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:42,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085610387] [2019-11-24 05:48:42,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:42,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:42,755 INFO L87 Difference]: Start difference. First operand 436 states and 605 transitions. Second operand 3 states. [2019-11-24 05:48:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,876 INFO L93 Difference]: Finished difference Result 921 states and 1296 transitions. [2019-11-24 05:48:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:42,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-24 05:48:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,880 INFO L225 Difference]: With dead ends: 921 [2019-11-24 05:48:42,880 INFO L226 Difference]: Without dead ends: 586 [2019-11-24 05:48:42,883 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:48:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-24 05:48:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 548. [2019-11-24 05:48:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-24 05:48:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 784 transitions. [2019-11-24 05:48:42,912 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 784 transitions. Word has length 118 [2019-11-24 05:48:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,913 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 784 transitions. [2019-11-24 05:48:42,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 784 transitions. [2019-11-24 05:48:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-24 05:48:42,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,915 INFO L410 BasicCegarLoop]: 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] [2019-11-24 05:48:42,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1010693682, now seen corresponding path program 1 times [2019-11-24 05:48:42,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132510798] [2019-11-24 05:48:42,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:43,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132510798] [2019-11-24 05:48:43,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:43,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:43,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28323675] [2019-11-24 05:48:43,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:43,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:43,007 INFO L87 Difference]: Start difference. First operand 548 states and 784 transitions. Second operand 3 states. [2019-11-24 05:48:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:43,105 INFO L93 Difference]: Finished difference Result 1339 states and 1966 transitions. [2019-11-24 05:48:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:43,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-24 05:48:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:43,114 INFO L225 Difference]: With dead ends: 1339 [2019-11-24 05:48:43,115 INFO L226 Difference]: Without dead ends: 838 [2019-11-24 05:48:43,116 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:48:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-24 05:48:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 750. [2019-11-24 05:48:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-11-24 05:48:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1108 transitions. [2019-11-24 05:48:43,159 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1108 transitions. Word has length 118 [2019-11-24 05:48:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:43,160 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1108 transitions. [2019-11-24 05:48:43,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1108 transitions. [2019-11-24 05:48:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 05:48:43,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:43,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:43,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2045453655, now seen corresponding path program 1 times [2019-11-24 05:48:43,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:43,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504717732] [2019-11-24 05:48:43,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:43,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504717732] [2019-11-24 05:48:43,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:43,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224811440] [2019-11-24 05:48:43,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:43,358 INFO L87 Difference]: Start difference. First operand 750 states and 1108 transitions. Second operand 5 states. [2019-11-24 05:48:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:43,571 INFO L93 Difference]: Finished difference Result 1403 states and 2088 transitions. [2019-11-24 05:48:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:43,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-24 05:48:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:43,577 INFO L225 Difference]: With dead ends: 1403 [2019-11-24 05:48:43,577 INFO L226 Difference]: Without dead ends: 750 [2019-11-24 05:48:43,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-11-24 05:48:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2019-11-24 05:48:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-11-24 05:48:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1096 transitions. [2019-11-24 05:48:43,658 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1096 transitions. Word has length 121 [2019-11-24 05:48:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:43,659 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1096 transitions. [2019-11-24 05:48:43,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1096 transitions. [2019-11-24 05:48:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 05:48:43,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:43,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:43,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 407107058, now seen corresponding path program 1 times [2019-11-24 05:48:43,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:43,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460075895] [2019-11-24 05:48:43,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:44,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460075895] [2019-11-24 05:48:44,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:44,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:44,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757606780] [2019-11-24 05:48:44,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:44,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:44,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:44,187 INFO L87 Difference]: Start difference. First operand 750 states and 1096 transitions. Second operand 7 states. [2019-11-24 05:48:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:44,462 INFO L93 Difference]: Finished difference Result 2333 states and 3440 transitions. [2019-11-24 05:48:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:48:44,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2019-11-24 05:48:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:44,477 INFO L225 Difference]: With dead ends: 2333 [2019-11-24 05:48:44,478 INFO L226 Difference]: Without dead ends: 1757 [2019-11-24 05:48:44,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-11-24 05:48:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1753. [2019-11-24 05:48:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-11-24 05:48:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2556 transitions. [2019-11-24 05:48:44,631 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2556 transitions. Word has length 121 [2019-11-24 05:48:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:44,632 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 2556 transitions. [2019-11-24 05:48:44,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2556 transitions. [2019-11-24 05:48:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 05:48:44,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:44,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:44,637 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2072991136, now seen corresponding path program 1 times [2019-11-24 05:48:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506784001] [2019-11-24 05:48:44,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:44,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506784001] [2019-11-24 05:48:44,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:44,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:44,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585854732] [2019-11-24 05:48:44,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:44,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:44,999 INFO L87 Difference]: Start difference. First operand 1753 states and 2556 transitions. Second operand 5 states. [2019-11-24 05:48:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:45,138 INFO L93 Difference]: Finished difference Result 2688 states and 3989 transitions. [2019-11-24 05:48:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:45,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-24 05:48:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:45,147 INFO L225 Difference]: With dead ends: 2688 [2019-11-24 05:48:45,147 INFO L226 Difference]: Without dead ends: 1284 [2019-11-24 05:48:45,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-11-24 05:48:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-11-24 05:48:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-11-24 05:48:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1867 transitions. [2019-11-24 05:48:45,238 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1867 transitions. Word has length 121 [2019-11-24 05:48:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:45,239 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 1867 transitions. [2019-11-24 05:48:45,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1867 transitions. [2019-11-24 05:48:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-24 05:48:45,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:45,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:45,247 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1337272560, now seen corresponding path program 1 times [2019-11-24 05:48:45,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:45,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251870475] [2019-11-24 05:48:45,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:45,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251870475] [2019-11-24 05:48:45,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:45,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:45,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096596344] [2019-11-24 05:48:45,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:45,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:45,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:45,368 INFO L87 Difference]: Start difference. First operand 1282 states and 1867 transitions. Second operand 3 states. [2019-11-24 05:48:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:45,527 INFO L93 Difference]: Finished difference Result 3220 states and 4777 transitions. [2019-11-24 05:48:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:45,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-24 05:48:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:45,537 INFO L225 Difference]: With dead ends: 3220 [2019-11-24 05:48:45,537 INFO L226 Difference]: Without dead ends: 2021 [2019-11-24 05:48:45,541 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:48:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-11-24 05:48:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1912. [2019-11-24 05:48:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-11-24 05:48:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2859 transitions. [2019-11-24 05:48:45,672 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2859 transitions. Word has length 123 [2019-11-24 05:48:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:45,672 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 2859 transitions. [2019-11-24 05:48:45,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2859 transitions. [2019-11-24 05:48:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-24 05:48:45,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:45,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:45,675 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1025064728, now seen corresponding path program 1 times [2019-11-24 05:48:45,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:45,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985783237] [2019-11-24 05:48:45,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:45,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985783237] [2019-11-24 05:48:45,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:45,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:45,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938313467] [2019-11-24 05:48:45,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:45,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:45,793 INFO L87 Difference]: Start difference. First operand 1912 states and 2859 transitions. Second operand 5 states. [2019-11-24 05:48:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:46,145 INFO L93 Difference]: Finished difference Result 3749 states and 5622 transitions. [2019-11-24 05:48:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:46,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-11-24 05:48:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:46,160 INFO L225 Difference]: With dead ends: 3749 [2019-11-24 05:48:46,160 INFO L226 Difference]: Without dead ends: 1912 [2019-11-24 05:48:46,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-24 05:48:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2019-11-24 05:48:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-11-24 05:48:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2817 transitions. [2019-11-24 05:48:46,340 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2817 transitions. Word has length 126 [2019-11-24 05:48:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:46,341 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 2817 transitions. [2019-11-24 05:48:46,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2817 transitions. [2019-11-24 05:48:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-24 05:48:46,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:46,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:46,345 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -921291091, now seen corresponding path program 1 times [2019-11-24 05:48:46,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:46,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76398978] [2019-11-24 05:48:46,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:46,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76398978] [2019-11-24 05:48:46,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:46,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:46,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705307682] [2019-11-24 05:48:46,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:46,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:46,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:46,672 INFO L87 Difference]: Start difference. First operand 1912 states and 2817 transitions. Second operand 5 states. [2019-11-24 05:48:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:47,114 INFO L93 Difference]: Finished difference Result 5460 states and 8105 transitions. [2019-11-24 05:48:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:47,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-11-24 05:48:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:47,135 INFO L225 Difference]: With dead ends: 5460 [2019-11-24 05:48:47,135 INFO L226 Difference]: Without dead ends: 3643 [2019-11-24 05:48:47,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-11-24 05:48:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3641. [2019-11-24 05:48:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-11-24 05:48:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5363 transitions. [2019-11-24 05:48:47,402 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5363 transitions. Word has length 126 [2019-11-24 05:48:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:47,402 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 5363 transitions. [2019-11-24 05:48:47,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5363 transitions. [2019-11-24 05:48:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:48:47,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:47,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:47,406 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:47,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1092618630, now seen corresponding path program 1 times [2019-11-24 05:48:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:47,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099705514] [2019-11-24 05:48:47,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:47,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099705514] [2019-11-24 05:48:47,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:47,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:47,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494700329] [2019-11-24 05:48:47,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:47,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:47,817 INFO L87 Difference]: Start difference. First operand 3641 states and 5363 transitions. Second operand 5 states. [2019-11-24 05:48:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:48,358 INFO L93 Difference]: Finished difference Result 7063 states and 10407 transitions. [2019-11-24 05:48:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:48,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-24 05:48:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:48,385 INFO L225 Difference]: With dead ends: 7063 [2019-11-24 05:48:48,385 INFO L226 Difference]: Without dead ends: 5334 [2019-11-24 05:48:48,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2019-11-24 05:48:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 5332. [2019-11-24 05:48:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5332 states. [2019-11-24 05:48:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 7774 transitions. [2019-11-24 05:48:48,962 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 7774 transitions. Word has length 131 [2019-11-24 05:48:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:48,963 INFO L462 AbstractCegarLoop]: Abstraction has 5332 states and 7774 transitions. [2019-11-24 05:48:48,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 7774 transitions. [2019-11-24 05:48:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:48:48,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:48,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:48,970 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1545634252, now seen corresponding path program 1 times [2019-11-24 05:48:48,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:48,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639166317] [2019-11-24 05:48:48,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:50,919 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-24 05:48:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:51,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639166317] [2019-11-24 05:48:51,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:51,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-24 05:48:51,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126553909] [2019-11-24 05:48:51,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-24 05:48:51,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-24 05:48:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:48:51,376 INFO L87 Difference]: Start difference. First operand 5332 states and 7774 transitions. Second operand 27 states. [2019-11-24 05:48:51,783 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-24 05:48:51,948 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-24 05:48:52,288 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-24 05:48:52,479 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-24 05:48:52,793 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-24 05:48:53,065 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-11-24 05:48:53,372 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-24 05:48:53,806 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-11-24 05:48:54,181 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-11-24 05:48:54,586 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-24 05:48:55,038 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-11-24 05:48:55,420 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-11-24 05:48:55,901 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 104 [2019-11-24 05:48:56,362 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 109 [2019-11-24 05:48:56,731 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-11-24 05:48:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:58,730 INFO L93 Difference]: Finished difference Result 7733 states and 11129 transitions. [2019-11-24 05:48:58,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:58,731 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 131 [2019-11-24 05:48:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:58,756 INFO L225 Difference]: With dead ends: 7733 [2019-11-24 05:48:58,756 INFO L226 Difference]: Without dead ends: 6063 [2019-11-24 05:48:58,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2019-11-24 05:48:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-11-24 05:48:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 5425. [2019-11-24 05:48:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-11-24 05:48:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7887 transitions. [2019-11-24 05:48:59,242 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7887 transitions. Word has length 131 [2019-11-24 05:48:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:59,242 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7887 transitions. [2019-11-24 05:48:59,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-24 05:48:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7887 transitions. [2019-11-24 05:48:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:48:59,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:59,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:59,249 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:59,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2081997083, now seen corresponding path program 1 times [2019-11-24 05:48:59,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:59,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713693763] [2019-11-24 05:48:59,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:59,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713693763] [2019-11-24 05:48:59,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:59,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:59,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805914213] [2019-11-24 05:48:59,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:59,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:59,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:59,347 INFO L87 Difference]: Start difference. First operand 5425 states and 7887 transitions. Second operand 3 states. [2019-11-24 05:48:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:59,947 INFO L93 Difference]: Finished difference Result 10417 states and 15282 transitions. [2019-11-24 05:48:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:59,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-24 05:48:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:00,000 INFO L225 Difference]: With dead ends: 10417 [2019-11-24 05:49:00,000 INFO L226 Difference]: Without dead ends: 7838 [2019-11-24 05:49:00,010 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2019-11-24 05:49:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 7836. [2019-11-24 05:49:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7836 states. [2019-11-24 05:49:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 11306 transitions. [2019-11-24 05:49:00,733 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 11306 transitions. Word has length 131 [2019-11-24 05:49:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:00,734 INFO L462 AbstractCegarLoop]: Abstraction has 7836 states and 11306 transitions. [2019-11-24 05:49:00,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 11306 transitions. [2019-11-24 05:49:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:49:00,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:00,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:00,741 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash 871498776, now seen corresponding path program 1 times [2019-11-24 05:49:00,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:00,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161265438] [2019-11-24 05:49:00,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:01,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161265438] [2019-11-24 05:49:01,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:01,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:01,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602296309] [2019-11-24 05:49:01,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:01,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:01,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:01,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:01,075 INFO L87 Difference]: Start difference. First operand 7836 states and 11306 transitions. Second operand 5 states. [2019-11-24 05:49:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:01,705 INFO L93 Difference]: Finished difference Result 10420 states and 15152 transitions. [2019-11-24 05:49:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:01,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-24 05:49:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:01,721 INFO L225 Difference]: With dead ends: 10420 [2019-11-24 05:49:01,721 INFO L226 Difference]: Without dead ends: 7273 [2019-11-24 05:49:01,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2019-11-24 05:49:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7271. [2019-11-24 05:49:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7271 states. [2019-11-24 05:49:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7271 states to 7271 states and 10501 transitions. [2019-11-24 05:49:02,163 INFO L78 Accepts]: Start accepts. Automaton has 7271 states and 10501 transitions. Word has length 131 [2019-11-24 05:49:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:02,163 INFO L462 AbstractCegarLoop]: Abstraction has 7271 states and 10501 transitions. [2019-11-24 05:49:02,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7271 states and 10501 transitions. [2019-11-24 05:49:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:49:02,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:02,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:02,169 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -981700135, now seen corresponding path program 1 times [2019-11-24 05:49:02,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:02,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057444971] [2019-11-24 05:49:02,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:02,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057444971] [2019-11-24 05:49:02,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:02,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:02,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585659831] [2019-11-24 05:49:02,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:02,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:02,260 INFO L87 Difference]: Start difference. First operand 7271 states and 10501 transitions. Second operand 5 states. [2019-11-24 05:49:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:02,823 INFO L93 Difference]: Finished difference Result 14439 states and 20883 transitions. [2019-11-24 05:49:02,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:02,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-24 05:49:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:02,840 INFO L225 Difference]: With dead ends: 14439 [2019-11-24 05:49:02,840 INFO L226 Difference]: Without dead ends: 7271 [2019-11-24 05:49:02,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2019-11-24 05:49:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7271. [2019-11-24 05:49:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7271 states. [2019-11-24 05:49:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7271 states to 7271 states and 10377 transitions. [2019-11-24 05:49:03,417 INFO L78 Accepts]: Start accepts. Automaton has 7271 states and 10377 transitions. Word has length 131 [2019-11-24 05:49:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:03,418 INFO L462 AbstractCegarLoop]: Abstraction has 7271 states and 10377 transitions. [2019-11-24 05:49:03,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7271 states and 10377 transitions. [2019-11-24 05:49:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:49:03,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:03,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:03,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1701731706, now seen corresponding path program 1 times [2019-11-24 05:49:03,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:03,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488420037] [2019-11-24 05:49:03,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:03,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488420037] [2019-11-24 05:49:03,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:03,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:03,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625109734] [2019-11-24 05:49:03,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:03,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:03,716 INFO L87 Difference]: Start difference. First operand 7271 states and 10377 transitions. Second operand 5 states. [2019-11-24 05:49:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:04,602 INFO L93 Difference]: Finished difference Result 12240 states and 17725 transitions. [2019-11-24 05:49:04,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:04,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-24 05:49:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:04,618 INFO L225 Difference]: With dead ends: 12240 [2019-11-24 05:49:04,618 INFO L226 Difference]: Without dead ends: 7665 [2019-11-24 05:49:04,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2019-11-24 05:49:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 6468. [2019-11-24 05:49:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6468 states. [2019-11-24 05:49:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6468 states to 6468 states and 9238 transitions. [2019-11-24 05:49:05,044 INFO L78 Accepts]: Start accepts. Automaton has 6468 states and 9238 transitions. Word has length 131 [2019-11-24 05:49:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:05,045 INFO L462 AbstractCegarLoop]: Abstraction has 6468 states and 9238 transitions. [2019-11-24 05:49:05,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 6468 states and 9238 transitions. [2019-11-24 05:49:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-24 05:49:05,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:05,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:05,050 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2042618326, now seen corresponding path program 1 times [2019-11-24 05:49:05,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:05,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114701497] [2019-11-24 05:49:05,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:05,550 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-24 05:49:06,218 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-11-24 05:49:06,582 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-11-24 05:49:06,751 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-24 05:49:06,899 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-24 05:49:07,057 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-11-24 05:49:07,217 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-24 05:49:07,417 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-11-24 05:49:07,744 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-24 05:49:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:08,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114701497] [2019-11-24 05:49:08,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:08,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-11-24 05:49:08,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457631489] [2019-11-24 05:49:08,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-24 05:49:08,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-24 05:49:08,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:49:08,592 INFO L87 Difference]: Start difference. First operand 6468 states and 9238 transitions. Second operand 28 states. [2019-11-24 05:49:08,937 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-11-24 05:49:09,173 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-11-24 05:49:09,510 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-24 05:49:09,930 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-11-24 05:49:10,426 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-11-24 05:49:10,972 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-11-24 05:49:11,427 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-24 05:49:12,063 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-11-24 05:49:12,612 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-11-24 05:49:13,393 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-11-24 05:49:14,078 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2019-11-24 05:49:14,778 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-24 05:49:15,901 WARN L192 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 120 [2019-11-24 05:49:16,985 WARN L192 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 125 [2019-11-24 05:49:18,148 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 161 DAG size of output: 130 [2019-11-24 05:49:18,755 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-11-24 05:49:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:22,049 INFO L93 Difference]: Finished difference Result 11034 states and 15560 transitions. [2019-11-24 05:49:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-24 05:49:22,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 131 [2019-11-24 05:49:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:22,060 INFO L225 Difference]: With dead ends: 11034 [2019-11-24 05:49:22,060 INFO L226 Difference]: Without dead ends: 7790 [2019-11-24 05:49:22,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=431, Invalid=1549, Unknown=0, NotChecked=0, Total=1980 [2019-11-24 05:49:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-11-24 05:49:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 6599. [2019-11-24 05:49:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6599 states. [2019-11-24 05:49:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 9395 transitions. [2019-11-24 05:49:22,685 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 9395 transitions. Word has length 131 [2019-11-24 05:49:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:22,685 INFO L462 AbstractCegarLoop]: Abstraction has 6599 states and 9395 transitions. [2019-11-24 05:49:22,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-24 05:49:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 9395 transitions. [2019-11-24 05:49:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:22,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:22,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:22,689 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1649606077, now seen corresponding path program 1 times [2019-11-24 05:49:22,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:22,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50472201] [2019-11-24 05:49:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:22,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50472201] [2019-11-24 05:49:22,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:22,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:22,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482504092] [2019-11-24 05:49:22,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:22,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:22,739 INFO L87 Difference]: Start difference. First operand 6599 states and 9395 transitions. Second operand 3 states. [2019-11-24 05:49:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:23,478 INFO L93 Difference]: Finished difference Result 10488 states and 14950 transitions. [2019-11-24 05:49:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:23,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:23,490 INFO L225 Difference]: With dead ends: 10488 [2019-11-24 05:49:23,490 INFO L226 Difference]: Without dead ends: 6623 [2019-11-24 05:49:23,497 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6623 states. [2019-11-24 05:49:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6623 to 6551. [2019-11-24 05:49:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6551 states. [2019-11-24 05:49:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 9298 transitions. [2019-11-24 05:49:24,304 INFO L78 Accepts]: Start accepts. Automaton has 6551 states and 9298 transitions. Word has length 132 [2019-11-24 05:49:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:24,304 INFO L462 AbstractCegarLoop]: Abstraction has 6551 states and 9298 transitions. [2019-11-24 05:49:24,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6551 states and 9298 transitions. [2019-11-24 05:49:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:24,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:24,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:24,308 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1933911175, now seen corresponding path program 1 times [2019-11-24 05:49:24,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:24,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905974108] [2019-11-24 05:49:24,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:24,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905974108] [2019-11-24 05:49:24,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:24,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:24,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864947652] [2019-11-24 05:49:24,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:24,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:24,355 INFO L87 Difference]: Start difference. First operand 6551 states and 9298 transitions. Second operand 3 states. [2019-11-24 05:49:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:25,202 INFO L93 Difference]: Finished difference Result 11541 states and 16342 transitions. [2019-11-24 05:49:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:25,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:25,214 INFO L225 Difference]: With dead ends: 11541 [2019-11-24 05:49:25,214 INFO L226 Difference]: Without dead ends: 7160 [2019-11-24 05:49:25,221 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2019-11-24 05:49:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 6503. [2019-11-24 05:49:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-11-24 05:49:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9201 transitions. [2019-11-24 05:49:25,705 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9201 transitions. Word has length 132 [2019-11-24 05:49:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:25,705 INFO L462 AbstractCegarLoop]: Abstraction has 6503 states and 9201 transitions. [2019-11-24 05:49:25,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9201 transitions. [2019-11-24 05:49:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:25,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:25,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:25,709 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1696676187, now seen corresponding path program 1 times [2019-11-24 05:49:25,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:25,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455330243] [2019-11-24 05:49:25,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:25,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455330243] [2019-11-24 05:49:25,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:25,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:25,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570175368] [2019-11-24 05:49:25,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:25,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:25,753 INFO L87 Difference]: Start difference. First operand 6503 states and 9201 transitions. Second operand 3 states. [2019-11-24 05:49:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:26,729 INFO L93 Difference]: Finished difference Result 11361 states and 15994 transitions. [2019-11-24 05:49:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:26,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:26,740 INFO L225 Difference]: With dead ends: 11361 [2019-11-24 05:49:26,741 INFO L226 Difference]: Without dead ends: 7388 [2019-11-24 05:49:26,747 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7388 states. [2019-11-24 05:49:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7388 to 6445. [2019-11-24 05:49:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6445 states. [2019-11-24 05:49:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 9096 transitions. [2019-11-24 05:49:27,190 INFO L78 Accepts]: Start accepts. Automaton has 6445 states and 9096 transitions. Word has length 132 [2019-11-24 05:49:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:27,190 INFO L462 AbstractCegarLoop]: Abstraction has 6445 states and 9096 transitions. [2019-11-24 05:49:27,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6445 states and 9096 transitions. [2019-11-24 05:49:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:27,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:27,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:27,194 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1239380704, now seen corresponding path program 1 times [2019-11-24 05:49:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:27,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582196197] [2019-11-24 05:49:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:27,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582196197] [2019-11-24 05:49:27,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:27,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:27,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308884742] [2019-11-24 05:49:27,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:27,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:27,240 INFO L87 Difference]: Start difference. First operand 6445 states and 9096 transitions. Second operand 3 states. [2019-11-24 05:49:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:27,883 INFO L93 Difference]: Finished difference Result 14178 states and 19893 transitions. [2019-11-24 05:49:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:27,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:27,894 INFO L225 Difference]: With dead ends: 14178 [2019-11-24 05:49:27,895 INFO L226 Difference]: Without dead ends: 8029 [2019-11-24 05:49:27,903 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2019-11-24 05:49:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 6369. [2019-11-24 05:49:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6369 states. [2019-11-24 05:49:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 8951 transitions. [2019-11-24 05:49:28,333 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 8951 transitions. Word has length 132 [2019-11-24 05:49:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:28,333 INFO L462 AbstractCegarLoop]: Abstraction has 6369 states and 8951 transitions. [2019-11-24 05:49:28,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 8951 transitions. [2019-11-24 05:49:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:28,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:28,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:28,336 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1429815714, now seen corresponding path program 1 times [2019-11-24 05:49:28,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:28,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028594129] [2019-11-24 05:49:28,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:28,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028594129] [2019-11-24 05:49:28,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:28,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:28,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526302534] [2019-11-24 05:49:28,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:28,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:28,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:28,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:28,376 INFO L87 Difference]: Start difference. First operand 6369 states and 8951 transitions. Second operand 3 states. [2019-11-24 05:49:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:29,079 INFO L93 Difference]: Finished difference Result 11662 states and 16386 transitions. [2019-11-24 05:49:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:29,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:29,088 INFO L225 Difference]: With dead ends: 11662 [2019-11-24 05:49:29,088 INFO L226 Difference]: Without dead ends: 6934 [2019-11-24 05:49:29,095 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2019-11-24 05:49:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 6301. [2019-11-24 05:49:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6301 states. [2019-11-24 05:49:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6301 states to 6301 states and 8822 transitions. [2019-11-24 05:49:29,488 INFO L78 Accepts]: Start accepts. Automaton has 6301 states and 8822 transitions. Word has length 132 [2019-11-24 05:49:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:29,489 INFO L462 AbstractCegarLoop]: Abstraction has 6301 states and 8822 transitions. [2019-11-24 05:49:29,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6301 states and 8822 transitions. [2019-11-24 05:49:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:29,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:29,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:29,491 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash 945259972, now seen corresponding path program 1 times [2019-11-24 05:49:29,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:29,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175340425] [2019-11-24 05:49:29,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:29,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175340425] [2019-11-24 05:49:29,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:29,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:29,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561263311] [2019-11-24 05:49:29,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:29,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:29,604 INFO L87 Difference]: Start difference. First operand 6301 states and 8822 transitions. Second operand 3 states. [2019-11-24 05:49:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:30,051 INFO L93 Difference]: Finished difference Result 10977 states and 15409 transitions. [2019-11-24 05:49:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:30,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:30,059 INFO L225 Difference]: With dead ends: 10977 [2019-11-24 05:49:30,059 INFO L226 Difference]: Without dead ends: 6370 [2019-11-24 05:49:30,064 INFO L630 BasicCegarLoop]: 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 [2019-11-24 05:49:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6370 states. [2019-11-24 05:49:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6370 to 6205. [2019-11-24 05:49:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2019-11-24 05:49:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 8664 transitions. [2019-11-24 05:49:30,432 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 8664 transitions. Word has length 132 [2019-11-24 05:49:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:30,432 INFO L462 AbstractCegarLoop]: Abstraction has 6205 states and 8664 transitions. [2019-11-24 05:49:30,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 8664 transitions. [2019-11-24 05:49:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:30,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:30,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:30,434 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 81075417, now seen corresponding path program 1 times [2019-11-24 05:49:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:30,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188860007] [2019-11-24 05:49:30,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 05:49:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 05:49:30,766 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 05:49:30,767 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 05:49:31,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 05:49:31 BoogieIcfgContainer [2019-11-24 05:49:31,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 05:49:31,002 INFO L168 Benchmark]: Toolchain (without parser) took 53745.58 ms. Allocated memory was 146.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 103.7 MB in the beginning and 339.7 MB in the end (delta: -235.9 MB). Peak memory consumption was 889.7 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,003 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 05:49:31,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1125.61 ms. Allocated memory was 146.8 MB in the beginning and 201.3 MB in the end (delta: 54.5 MB). Free memory was 103.3 MB in the beginning and 168.5 MB in the end (delta: -65.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.89 ms. Allocated memory is still 201.3 MB. Free memory was 168.5 MB in the beginning and 163.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,008 INFO L168 Benchmark]: Boogie Preprocessor took 64.92 ms. Allocated memory is still 201.3 MB. Free memory was 163.4 MB in the beginning and 159.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,008 INFO L168 Benchmark]: RCFGBuilder took 2462.03 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 159.4 MB in the beginning and 120.8 MB in the end (delta: 38.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,009 INFO L168 Benchmark]: TraceAbstraction took 50000.54 ms. Allocated memory was 248.5 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 120.8 MB in the beginning and 339.7 MB in the end (delta: -218.8 MB). Peak memory consumption was 805.1 MB. Max. memory is 7.1 GB. [2019-11-24 05:49:31,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1125.61 ms. Allocated memory was 146.8 MB in the beginning and 201.3 MB in the end (delta: 54.5 MB). Free memory was 103.3 MB in the beginning and 168.5 MB in the end (delta: -65.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.89 ms. Allocated memory is still 201.3 MB. Free memory was 168.5 MB in the beginning and 163.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.92 ms. Allocated memory is still 201.3 MB. Free memory was 163.4 MB in the beginning and 159.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2462.03 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 159.4 MB in the beginning and 120.8 MB in the end (delta: 38.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50000.54 ms. Allocated memory was 248.5 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 120.8 MB in the beginning and 339.7 MB in the end (delta: -218.8 MB). Peak memory consumption was 805.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 900]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] _Bool newmax1 = 0; [L44] char id2 = '\x0'; [L45] char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] _Bool newmax2 = 0; [L52] char id3 = '\x0'; [L53] char r3 = '\x0'; [L54] char st3 = '\x0'; [L55] char nl3 = '\x0'; [L56] char m3 = '\x0'; [L57] char max3 = '\x0'; [L58] _Bool mode3 = 0; [L59] _Bool newmax3 = 0; [L67] int __return_1887; [L68] int __return_2033; [L69] int __return_2166; [L70] int __return_2305; [L71] int __return_2449; [L72] int __tmp_2450_0; [L73] int __return_2573; [L74] int __return_2463; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L16] port_t p13 = 0; [L20] port_t p21 = 0; [L24] port_t p23 = 0; [L28] port_t p31 = 0; [L32] port_t p32 = 0; [L63] void (*nodes[3])() = { &node1, &node2, &node3 }; [L77] int main__c1; [L78] int main__i2; [L79] main__c1 = 0 [L80] ep12 = __VERIFIER_nondet_bool() [L81] ep13 = __VERIFIER_nondet_bool() [L82] ep21 = __VERIFIER_nondet_bool() [L83] ep23 = __VERIFIER_nondet_bool() [L84] ep31 = __VERIFIER_nondet_bool() [L85] ep32 = __VERIFIER_nondet_bool() [L86] id1 = __VERIFIER_nondet_char() [L87] r1 = __VERIFIER_nondet_char() [L88] st1 = __VERIFIER_nondet_char() [L89] nl1 = __VERIFIER_nondet_char() [L90] m1 = __VERIFIER_nondet_char() [L91] max1 = __VERIFIER_nondet_char() [L92] mode1 = __VERIFIER_nondet_bool() [L93] newmax1 = __VERIFIER_nondet_bool() [L94] id2 = __VERIFIER_nondet_char() [L95] r2 = __VERIFIER_nondet_char() [L96] st2 = __VERIFIER_nondet_char() [L97] nl2 = __VERIFIER_nondet_char() [L98] m2 = __VERIFIER_nondet_char() [L99] max2 = __VERIFIER_nondet_char() [L100] mode2 = __VERIFIER_nondet_bool() [L101] newmax2 = __VERIFIER_nondet_bool() [L102] id3 = __VERIFIER_nondet_char() [L103] r3 = __VERIFIER_nondet_char() [L104] st3 = __VERIFIER_nondet_char() [L105] nl3 = __VERIFIER_nondet_char() [L106] m3 = __VERIFIER_nondet_char() [L107] max3 = __VERIFIER_nondet_char() [L108] mode3 = __VERIFIER_nondet_bool() [L109] newmax3 = __VERIFIER_nondet_bool() [L111] _Bool init__r121; [L112] _Bool init__r131; [L113] _Bool init__r211; [L114] _Bool init__r231; [L115] _Bool init__r311; [L116] _Bool init__r321; [L117] _Bool init__r122; [L118] int init__tmp; [L119] _Bool init__r132; [L120] int init__tmp___0; [L121] _Bool init__r212; [L122] int init__tmp___1; [L123] _Bool init__r232; [L124] int init__tmp___2; [L125] _Bool init__r312; [L126] int init__tmp___3; [L127] _Bool init__r322; [L128] int init__tmp___4; [L129] int init__tmp___5; [L130] init__r121 = ep12 [L131] init__r131 = ep13 [L132] init__r211 = ep21 [L133] init__r231 = ep23 [L134] init__r311 = ep31 [L135] init__r321 = ep32 [L136] COND FALSE !(!(init__r121 == 0)) [L2472] COND TRUE !(init__r131 == 0) [L2474] COND TRUE !(ep32 == 0) [L2476] init__tmp = 1 [L140] init__r122 = (_Bool)init__tmp [L141] COND TRUE !(init__r131 == 0) [L143] init__tmp___0 = 1 [L145] init__r132 = (_Bool)init__tmp___0 [L146] COND TRUE !(init__r211 == 0) [L148] init__tmp___1 = 1 [L150] init__r212 = (_Bool)init__tmp___1 [L151] COND FALSE !(!(init__r231 == 0)) [L2403] COND TRUE !(init__r211 == 0) [L2405] COND TRUE !(ep13 == 0) [L2407] init__tmp___2 = 1 [L155] init__r232 = (_Bool)init__tmp___2 [L156] COND FALSE !(!(init__r311 == 0)) [L2380] COND TRUE !(init__r321 == 0) [L2382] COND TRUE !(ep21 == 0) [L2384] init__tmp___3 = 1 [L160] init__r312 = (_Bool)init__tmp___3 [L161] COND TRUE !(init__r321 == 0) [L163] init__tmp___4 = 1 [L165] init__r322 = (_Bool)init__tmp___4 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L166] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L170] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id1) >= 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L174] COND TRUE ((int)id2) >= 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L176] COND TRUE ((int)id3) >= 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r1) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r2) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)r3) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r122 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r132 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r212 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r232 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r312 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE !(init__r322 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)max1) == ((int)id1) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)max2) == ((int)id2) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)max3) == ((int)id3) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)st1) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)st2) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 ((int)st3) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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)nl1) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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)nl2) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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)nl3) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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)mode1) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=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] [L216] COND TRUE ((int)mode2) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=0, mode2=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] [L218] COND TRUE ((int)mode3) == 0 VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=0, mode2=0, mode3=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] [L220] COND TRUE !(newmax1 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=0, mode2=0, mode3=0, newmax1=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 !(newmax2 == 0) VAL [__return_1887=0, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=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 !(newmax3 == 0) [L226] init__tmp___5 = 1 [L227] __return_1887 = init__tmp___5 [L228] main__i2 = __return_1887 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L229] COND TRUE main__i2 != 0 [L231] p12_old = nomsg [L232] p12_new = nomsg [L233] p13_old = nomsg [L234] p13_new = nomsg [L235] p21_old = nomsg [L236] p21_new = nomsg [L237] p23_old = nomsg [L238] p23_new = nomsg [L239] p31_old = nomsg [L240] p31_new = nomsg [L241] p32_old = nomsg [L242] p32_new = nomsg [L243] main__i2 = 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L244] COND TRUE main__i2 < 6 [L247] _Bool node1__newmax; [L248] node1__newmax = 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L249] COND FALSE !(!(mode1 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L255] COND TRUE ((int)r1) < 2 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L257] COND FALSE !(!(ep12 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L270] COND TRUE !(ep13 == 0) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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 !(newmax1 == 0) [L274] int node1____CPAchecker_TMP_1; VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L275] COND TRUE max1 != nomsg VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L277] COND TRUE p13_new == nomsg [L279] node1____CPAchecker_TMP_1 = max1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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] [L281] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, 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=5, 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] [L283] mode1 = 1 [L285] _Bool node2__newmax; [L286] node2__newmax = 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L287] COND FALSE !(!(mode2 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] COND TRUE ((int)r2) < 2 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] COND TRUE !(ep21 == 0) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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 TRUE !(newmax2 == 0) [L299] int node2____CPAchecker_TMP_0; VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L300] COND TRUE max2 != nomsg VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L302] COND TRUE p21_new == nomsg [L304] node2____CPAchecker_TMP_0 = max2 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L306] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L308] COND FALSE !(!(ep23 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L321] mode2 = 1 [L323] _Bool node3__newmax; [L324] node3__newmax = 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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 FALSE !(!(mode3 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L331] COND TRUE ((int)r3) < 2 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(ep31 == 0)) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L346] COND TRUE !(ep32 == 0) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L348] COND TRUE !(newmax3 == 0) [L350] int node3____CPAchecker_TMP_1; VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L351] COND TRUE max3 != nomsg VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L353] COND TRUE p32_new == nomsg [L355] node3____CPAchecker_TMP_1 = max3 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, 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] [L357] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=6, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] mode3 = 1 [L360] p12_old = p12_new [L361] p12_new = nomsg [L362] p13_old = p13_new [L363] p13_new = nomsg [L364] p21_old = p21_new [L365] p21_new = nomsg [L366] p23_old = p23_new [L367] p23_new = nomsg [L368] p31_old = p31_new [L369] p31_new = nomsg [L370] p32_old = p32_new [L371] p32_new = nomsg [L373] int check__tmp; VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE ((int)r1) < 2 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1887=1, __return_2033=0, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((int)r1) < 2 [L402] check__tmp = 1 [L403] __return_2033 = check__tmp [L404] main__c1 = __return_2033 [L406] _Bool __tmp_1; [L407] __tmp_1 = main__c1 [L408] _Bool assert__arg; [L409] assert__arg = __tmp_1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(assert__arg == 0) [L416] int main____CPAchecker_TMP_0 = main__i2; [L417] main__i2 = main__i2 + 1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE main__i2 < 6 [L421] _Bool node1__newmax; [L422] node1__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=0, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE !(mode1 == 0) [L425] r1 = (char)(((int)r1) + 1) [L426] COND TRUE !(ep21 == 0) [L428] m1 = p21_old [L429] p21_old = nomsg [L430] COND FALSE !(((int)m1) > ((int)max1)) [L435] COND FALSE !(!(ep31 == 0)) [L444] newmax1 = node1__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=6, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND FALSE !(((int)r1) == 2) [L451] mode1 = 0 [L453] _Bool node2__newmax; [L454] node2__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=0, m3=0, max1=5, max2=4, max3=6, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=6, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE !(mode2 == 0) [L457] r2 = (char)(((int)r2) + 1) [L458] COND FALSE !(!(ep12 == 0)) [L467] COND TRUE !(ep32 == 0) [L469] m2 = p32_old [L470] p32_old = nomsg [L471] COND TRUE ((int)m2) > ((int)max2) [L473] max2 = m2 [L474] node2__newmax = 1 [L476] newmax2 = node2__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=0, max1=5, max2=6, max3=6, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L477] COND FALSE !(((int)r2) == 2) [L483] mode2 = 0 [L485] _Bool node3__newmax; [L486] node3__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=0, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L487] COND TRUE !(mode3 == 0) [L489] r3 = (char)(((int)r3) + 1) [L490] COND TRUE !(ep13 == 0) [L492] m3 = p13_old [L493] p13_old = nomsg [L494] COND FALSE !(((int)m3) > ((int)max3)) [L499] COND FALSE !(!(ep23 == 0)) [L508] newmax3 = node3__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L509] COND FALSE !(((int)r3) == 2) [L515] mode3 = 0 [L516] p12_old = p12_new [L517] p12_new = nomsg [L518] p13_old = p13_new [L519] p13_new = nomsg [L520] p21_old = p21_new [L521] p21_new = nomsg [L522] p23_old = p23_new [L523] p23_new = nomsg [L524] p31_old = p31_new [L525] p31_new = nomsg [L526] p32_old = p32_new [L527] p32_new = nomsg [L529] int check__tmp; VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L530] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L532] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L534] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L536] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L538] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L544] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L546] COND TRUE ((int)r1) < 2 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L548] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L554] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1887=1, __return_2033=1, __return_2166=0, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L556] COND TRUE ((int)r1) < 2 [L558] check__tmp = 1 [L559] __return_2166 = check__tmp [L560] main__c1 = __return_2166 [L562] _Bool __tmp_2; [L563] __tmp_2 = main__c1 [L564] _Bool assert__arg; [L565] assert__arg = __tmp_2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L566] COND FALSE !(assert__arg == 0) [L572] int main____CPAchecker_TMP_0 = main__i2; [L573] main__i2 = main__i2 + 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L574] COND TRUE main__i2 < 6 [L577] _Bool node1__newmax; [L578] node1__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L579] COND FALSE !(!(mode1 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L585] COND TRUE ((int)r1) < 2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L587] COND FALSE !(!(ep12 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L600] COND TRUE !(ep13 == 0) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L602] COND FALSE !(!(newmax1 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L613] mode1 = 1 [L615] _Bool node2__newmax; [L616] node2__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L617] COND FALSE !(!(mode2 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L623] COND TRUE ((int)r2) < 2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L625] COND TRUE !(ep21 == 0) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L627] COND TRUE !(newmax2 == 0) [L629] int node2____CPAchecker_TMP_0; VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L630] COND TRUE max2 != nomsg VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L632] COND TRUE p21_new == nomsg [L634] node2____CPAchecker_TMP_0 = max2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=0, st2=0, st3=0] [L636] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L638] COND FALSE !(!(ep23 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L651] mode2 = 1 [L653] _Bool node3__newmax; [L654] node3__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L655] COND FALSE !(!(mode3 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L661] COND TRUE ((int)r3) < 2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L663] COND FALSE !(!(ep31 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L676] COND TRUE !(ep32 == 0) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L678] COND FALSE !(!(newmax3 == 0)) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L689] mode3 = 1 [L690] p12_old = p12_new [L691] p12_new = nomsg [L692] p13_old = p13_new [L693] p13_new = nomsg [L694] p21_old = p21_new [L695] p21_new = nomsg [L696] p23_old = p23_new [L697] p23_new = nomsg [L698] p31_old = p31_new [L699] p31_new = nomsg [L700] p32_old = p32_new [L701] p32_new = nomsg [L703] int check__tmp; VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L704] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L706] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L708] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L710] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L712] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L718] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L720] COND TRUE ((int)r1) < 2 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L722] COND FALSE !(((int)r1) >= 2) VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L728] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=0, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L730] COND TRUE ((int)r1) < 2 [L732] check__tmp = 1 [L733] __return_2305 = check__tmp [L734] main__c1 = __return_2305 [L736] _Bool __tmp_3; [L737] __tmp_3 = main__c1 [L738] _Bool assert__arg; [L739] assert__arg = __tmp_3 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L740] COND FALSE !(assert__arg == 0) [L746] int main____CPAchecker_TMP_0 = main__i2; [L747] main__i2 = main__i2 + 1 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L748] COND TRUE main__i2 < 6 [L751] _Bool node1__newmax; [L752] node1__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=4, m2=6, m3=5, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, 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=6, 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=0, st2=0, st3=0] [L753] COND TRUE !(mode1 == 0) [L755] r1 = (char)(((int)r1) + 1) [L756] COND TRUE !(ep21 == 0) [L758] m1 = p21_old [L759] p21_old = nomsg [L760] COND TRUE ((int)m1) > ((int)max1) [L762] max1 = m1 [L763] node1__newmax = 1 [L765] COND FALSE !(!(ep31 == 0)) [L774] newmax1 = node1__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=6, m3=5, max1=6, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L775] COND TRUE ((int)r1) == 2 [L777] COND FALSE !(((int)max1) == ((int)id1)) [L1623] st1 = 1 [L781] mode1 = 0 [L783] _Bool node2__newmax; [L784] node2__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=6, m3=5, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=2, r2=1, r3=1, st1=1, st2=0, st3=0] [L785] COND TRUE !(mode2 == 0) [L787] r2 = (char)(((int)r2) + 1) [L788] COND FALSE !(!(ep12 == 0)) [L797] COND TRUE !(ep32 == 0) [L799] m2 = p32_old [L800] p32_old = nomsg [L801] COND FALSE !(((int)m2) > ((int)max2)) [L806] newmax2 = node2__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, 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=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L807] COND TRUE ((int)r2) == 2 [L809] COND FALSE !(((int)max2) == ((int)id2)) [L1586] nl2 = 1 [L813] mode2 = 0 [L815] _Bool node3__newmax; [L816] node3__newmax = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L817] COND TRUE !(mode3 == 0) [L819] r3 = (char)(((int)r3) + 1) [L820] COND TRUE !(ep13 == 0) [L822] m3 = p13_old [L823] p13_old = nomsg [L824] COND FALSE !(((int)m3) > ((int)max3)) [L829] COND FALSE !(!(ep23 == 0)) [L838] newmax3 = node3__newmax VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L839] COND TRUE ((int)r3) == 2 [L841] COND TRUE ((int)max3) == ((int)id3) [L843] st3 = 1 [L845] mode3 = 0 [L846] p12_old = p12_new [L847] p12_new = nomsg [L848] p13_old = p13_new [L849] p13_new = nomsg [L850] p21_old = p21_new [L851] p21_new = nomsg [L852] p23_old = p23_new [L853] p23_new = nomsg [L854] p31_old = p31_new [L855] p31_new = nomsg [L856] p32_old = p32_new [L857] p32_new = nomsg [L859] int check__tmp; VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L860] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1542] check__tmp = 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L888] __return_2449 = check__tmp [L889] main__c1 = __return_2449 [L890] __tmp_2450_0 = main____CPAchecker_TMP_0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L892] main____CPAchecker_TMP_0 = __tmp_2450_0 [L894] _Bool __tmp_4; [L895] __tmp_4 = main__c1 [L896] _Bool assert__arg; [L897] assert__arg = __tmp_4 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L898] COND TRUE assert__arg == 0 VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L900] __VERIFIER_error() VAL [__return_1887=1, __return_2033=1, __return_2166=1, __return_2305=1, __return_2449=0, __return_2463=0, __return_2573=0, __return_main=0, __tmp_2450_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=4, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 249 locations, 1 error locations. Result: UNSAFE, OverallTime: 49.9s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8005 SDtfs, 16182 SDslu, 14138 SDs, 0 SdLazy, 5392 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 32 SyntacticMatches, 14 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7836occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 7407 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2933 NumberOfCodeBlocks, 2933 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2777 ConstructedInterpolants, 0 QuantifiedInterpolants, 2780584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...