./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 15:11:16,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 15:11:16,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 15:11:16,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 15:11:16,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 15:11:16,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 15:11:16,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 15:11:16,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 15:11:16,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 15:11:16,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 15:11:16,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 15:11:16,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 15:11:16,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 15:11:16,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 15:11:16,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 15:11:16,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 15:11:16,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 15:11:16,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 15:11:16,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 15:11:16,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 15:11:16,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 15:11:16,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 15:11:16,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 15:11:16,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 15:11:16,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 15:11:16,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 15:11:16,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 15:11:16,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 15:11:16,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 15:11:16,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 15:11:16,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 15:11:16,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 15:11:16,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 15:11:16,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 15:11:16,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 15:11:16,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 15:11:16,420 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 15:11:16,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 15:11:16,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 15:11:16,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 15:11:16,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 15:11:16,438 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 15:11:16,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 15:11:16,438 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 15:11:16,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 15:11:16,439 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 15:11:16,440 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 15:11:16,440 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 15:11:16,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 15:11:16,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 15:11:16,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 15:11:16,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 15:11:16,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 15:11:16,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 15:11:16,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 15:11:16,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 15:11:16,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 15:11:16,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 15:11:16,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 15:11:16,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 15:11:16,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2018-12-31 15:11:16,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 15:11:16,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 15:11:16,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 15:11:16,512 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 15:11:16,513 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 15:11:16,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-31 15:11:16,585 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e60f021d/eaee099d8a4843bb99c0d03dbe4e627c/FLAG4b3c6eab1 [2018-12-31 15:11:17,086 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 15:11:17,090 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-31 15:11:17,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e60f021d/eaee099d8a4843bb99c0d03dbe4e627c/FLAG4b3c6eab1 [2018-12-31 15:11:17,372 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e60f021d/eaee099d8a4843bb99c0d03dbe4e627c [2018-12-31 15:11:17,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 15:11:17,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 15:11:17,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 15:11:17,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 15:11:17,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 15:11:17,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:11:17" (1/1) ... [2018-12-31 15:11:17,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77541500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:17, skipping insertion in model container [2018-12-31 15:11:17,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:11:17" (1/1) ... [2018-12-31 15:11:17,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 15:11:17,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 15:11:17,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 15:11:17,935 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 15:11:18,238 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 15:11:18,271 INFO L195 MainTranslator]: Completed translation [2018-12-31 15:11:18,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18 WrapperNode [2018-12-31 15:11:18,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 15:11:18,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 15:11:18,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 15:11:18,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 15:11:18,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 15:11:18,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 15:11:18,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 15:11:18,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 15:11:18,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (1/1) ... [2018-12-31 15:11:18,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 15:11:18,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 15:11:18,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 15:11:18,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 15:11:18,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (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 [2018-12-31 15:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 15:11:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 15:11:20,798 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 15:11:20,799 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 15:11:20,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:11:20 BoogieIcfgContainer [2018-12-31 15:11:20,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 15:11:20,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 15:11:20,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 15:11:20,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 15:11:20,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:11:17" (1/3) ... [2018-12-31 15:11:20,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad5c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:11:20, skipping insertion in model container [2018-12-31 15:11:20,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:11:18" (2/3) ... [2018-12-31 15:11:20,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad5c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:11:20, skipping insertion in model container [2018-12-31 15:11:20,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:11:20" (3/3) ... [2018-12-31 15:11:20,812 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-31 15:11:20,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 15:11:20,832 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 15:11:20,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 15:11:20,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 15:11:20,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 15:11:20,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 15:11:20,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 15:11:20,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 15:11:20,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 15:11:20,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 15:11:20,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 15:11:20,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 15:11:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-12-31 15:11:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-31 15:11:20,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:20,933 INFO L402 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] [2018-12-31 15:11:20,936 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2018-12-31 15:11:20,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:21,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:21,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:21,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:21,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:21,745 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 4 states. [2018-12-31 15:11:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:22,316 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2018-12-31 15:11:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:22,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-31 15:11:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:22,360 INFO L225 Difference]: With dead ends: 714 [2018-12-31 15:11:22,362 INFO L226 Difference]: Without dead ends: 470 [2018-12-31 15:11:22,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-31 15:11:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2018-12-31 15:11:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-12-31 15:11:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2018-12-31 15:11:22,536 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2018-12-31 15:11:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:22,537 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2018-12-31 15:11:22,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2018-12-31 15:11:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 15:11:22,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:22,547 INFO L402 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] [2018-12-31 15:11:22,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2018-12-31 15:11:22,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:22,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:22,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:22,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:22,690 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand 3 states. [2018-12-31 15:11:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:22,820 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2018-12-31 15:11:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:22,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-31 15:11:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:22,828 INFO L225 Difference]: With dead ends: 1366 [2018-12-31 15:11:22,828 INFO L226 Difference]: Without dead ends: 926 [2018-12-31 15:11:22,836 INFO L631 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 [2018-12-31 15:11:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-12-31 15:11:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2018-12-31 15:11:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-12-31 15:11:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2018-12-31 15:11:22,899 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2018-12-31 15:11:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:22,900 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2018-12-31 15:11:22,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2018-12-31 15:11:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 15:11:22,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:22,904 INFO L402 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] [2018-12-31 15:11:22,905 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2018-12-31 15:11:22,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:22,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:22,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:23,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:23,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:23,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:23,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:23,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:23,083 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand 3 states. [2018-12-31 15:11:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:23,332 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2018-12-31 15:11:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:23,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-31 15:11:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:23,336 INFO L225 Difference]: With dead ends: 977 [2018-12-31 15:11:23,337 INFO L226 Difference]: Without dead ends: 634 [2018-12-31 15:11:23,338 INFO L631 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 [2018-12-31 15:11:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-31 15:11:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2018-12-31 15:11:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-12-31 15:11:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2018-12-31 15:11:23,382 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2018-12-31 15:11:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2018-12-31 15:11:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2018-12-31 15:11:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 15:11:23,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:23,385 INFO L402 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] [2018-12-31 15:11:23,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2018-12-31 15:11:23,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:23,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:23,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:23,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:23,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:23,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:23,567 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand 4 states. [2018-12-31 15:11:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:23,694 INFO L93 Difference]: Finished difference Result 1226 states and 1856 transitions. [2018-12-31 15:11:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:23,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-31 15:11:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:23,700 INFO L225 Difference]: With dead ends: 1226 [2018-12-31 15:11:23,700 INFO L226 Difference]: Without dead ends: 616 [2018-12-31 15:11:23,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-31 15:11:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2018-12-31 15:11:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-31 15:11:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 931 transitions. [2018-12-31 15:11:23,750 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 931 transitions. Word has length 103 [2018-12-31 15:11:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:23,750 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 931 transitions. [2018-12-31 15:11:23,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 931 transitions. [2018-12-31 15:11:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 15:11:23,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:23,753 INFO L402 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] [2018-12-31 15:11:23,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash 101799940, now seen corresponding path program 1 times [2018-12-31 15:11:23,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:23,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:23,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:23,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:23,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:23,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:23,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:23,940 INFO L87 Difference]: Start difference. First operand 616 states and 931 transitions. Second operand 3 states. [2018-12-31 15:11:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:24,222 INFO L93 Difference]: Finished difference Result 1334 states and 2039 transitions. [2018-12-31 15:11:24,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:24,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-31 15:11:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:24,228 INFO L225 Difference]: With dead ends: 1334 [2018-12-31 15:11:24,228 INFO L226 Difference]: Without dead ends: 909 [2018-12-31 15:11:24,230 INFO L631 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 [2018-12-31 15:11:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-31 15:11:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2018-12-31 15:11:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-12-31 15:11:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1355 transitions. [2018-12-31 15:11:24,299 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1355 transitions. Word has length 103 [2018-12-31 15:11:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:24,299 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1355 transitions. [2018-12-31 15:11:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1355 transitions. [2018-12-31 15:11:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 15:11:24,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:24,301 INFO L402 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] [2018-12-31 15:11:24,302 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2115732183, now seen corresponding path program 1 times [2018-12-31 15:11:24,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:24,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:24,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:24,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:24,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:24,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:24,418 INFO L87 Difference]: Start difference. First operand 907 states and 1355 transitions. Second operand 3 states. [2018-12-31 15:11:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:24,758 INFO L93 Difference]: Finished difference Result 1976 states and 3065 transitions. [2018-12-31 15:11:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:24,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-31 15:11:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:24,770 INFO L225 Difference]: With dead ends: 1976 [2018-12-31 15:11:24,770 INFO L226 Difference]: Without dead ends: 1335 [2018-12-31 15:11:24,772 INFO L631 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 [2018-12-31 15:11:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-12-31 15:11:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1291. [2018-12-31 15:11:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-31 15:11:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1978 transitions. [2018-12-31 15:11:24,888 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1978 transitions. Word has length 105 [2018-12-31 15:11:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:24,888 INFO L480 AbstractCegarLoop]: Abstraction has 1291 states and 1978 transitions. [2018-12-31 15:11:24,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1978 transitions. [2018-12-31 15:11:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-31 15:11:24,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:24,893 INFO L402 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] [2018-12-31 15:11:24,893 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash -602590006, now seen corresponding path program 1 times [2018-12-31 15:11:24,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:24,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:25,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:25,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:25,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 15:11:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 15:11:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:25,136 INFO L87 Difference]: Start difference. First operand 1291 states and 1978 transitions. Second operand 5 states. [2018-12-31 15:11:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:27,230 INFO L93 Difference]: Finished difference Result 3370 states and 5285 transitions. [2018-12-31 15:11:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 15:11:27,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2018-12-31 15:11:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:27,242 INFO L225 Difference]: With dead ends: 3370 [2018-12-31 15:11:27,243 INFO L226 Difference]: Without dead ends: 2255 [2018-12-31 15:11:27,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 15:11:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2018-12-31 15:11:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2253. [2018-12-31 15:11:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-12-31 15:11:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3506 transitions. [2018-12-31 15:11:27,432 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3506 transitions. Word has length 106 [2018-12-31 15:11:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 3506 transitions. [2018-12-31 15:11:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 15:11:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3506 transitions. [2018-12-31 15:11:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-31 15:11:27,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:27,437 INFO L402 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] [2018-12-31 15:11:27,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash -404241499, now seen corresponding path program 1 times [2018-12-31 15:11:27,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:27,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:27,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:27,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:27,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:27,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:27,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:27,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:27,745 INFO L87 Difference]: Start difference. First operand 2253 states and 3506 transitions. Second operand 4 states. [2018-12-31 15:11:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:28,618 INFO L93 Difference]: Finished difference Result 5824 states and 9079 transitions. [2018-12-31 15:11:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:28,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-31 15:11:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:28,637 INFO L225 Difference]: With dead ends: 5824 [2018-12-31 15:11:28,637 INFO L226 Difference]: Without dead ends: 3590 [2018-12-31 15:11:28,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2018-12-31 15:11:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2018-12-31 15:11:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2018-12-31 15:11:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5553 transitions. [2018-12-31 15:11:28,952 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5553 transitions. Word has length 106 [2018-12-31 15:11:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:28,952 INFO L480 AbstractCegarLoop]: Abstraction has 3588 states and 5553 transitions. [2018-12-31 15:11:28,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5553 transitions. [2018-12-31 15:11:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-31 15:11:28,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:28,956 INFO L402 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] [2018-12-31 15:11:28,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1846587040, now seen corresponding path program 1 times [2018-12-31 15:11:28,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:28,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:28,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:28,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:29,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:29,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:29,065 INFO L87 Difference]: Start difference. First operand 3588 states and 5553 transitions. Second operand 3 states. [2018-12-31 15:11:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:29,742 INFO L93 Difference]: Finished difference Result 10000 states and 15600 transitions. [2018-12-31 15:11:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:29,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-31 15:11:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:29,778 INFO L225 Difference]: With dead ends: 10000 [2018-12-31 15:11:29,778 INFO L226 Difference]: Without dead ends: 6784 [2018-12-31 15:11:29,786 INFO L631 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 [2018-12-31 15:11:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2018-12-31 15:11:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 6782. [2018-12-31 15:11:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6782 states. [2018-12-31 15:11:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 10446 transitions. [2018-12-31 15:11:30,442 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 10446 transitions. Word has length 108 [2018-12-31 15:11:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:30,442 INFO L480 AbstractCegarLoop]: Abstraction has 6782 states and 10446 transitions. [2018-12-31 15:11:30,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 10446 transitions. [2018-12-31 15:11:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-31 15:11:30,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:30,447 INFO L402 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] [2018-12-31 15:11:30,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash -953475971, now seen corresponding path program 1 times [2018-12-31 15:11:30,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:30,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:30,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:30,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:30,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:30,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:30,629 INFO L87 Difference]: Start difference. First operand 6782 states and 10446 transitions. Second operand 4 states. [2018-12-31 15:11:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:30,967 INFO L93 Difference]: Finished difference Result 10729 states and 16558 transitions. [2018-12-31 15:11:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:30,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-31 15:11:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:30,991 INFO L225 Difference]: With dead ends: 10729 [2018-12-31 15:11:30,991 INFO L226 Difference]: Without dead ends: 5526 [2018-12-31 15:11:30,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2018-12-31 15:11:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5526. [2018-12-31 15:11:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2018-12-31 15:11:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8479 transitions. [2018-12-31 15:11:31,464 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8479 transitions. Word has length 108 [2018-12-31 15:11:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:31,464 INFO L480 AbstractCegarLoop]: Abstraction has 5526 states and 8479 transitions. [2018-12-31 15:11:31,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8479 transitions. [2018-12-31 15:11:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-31 15:11:31,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:31,469 INFO L402 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] [2018-12-31 15:11:31,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash 224725848, now seen corresponding path program 1 times [2018-12-31 15:11:31,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:31,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:31,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:31,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:31,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:31,563 INFO L87 Difference]: Start difference. First operand 5526 states and 8479 transitions. Second operand 3 states. [2018-12-31 15:11:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:32,231 INFO L93 Difference]: Finished difference Result 14566 states and 22766 transitions. [2018-12-31 15:11:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:32,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-31 15:11:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:32,266 INFO L225 Difference]: With dead ends: 14566 [2018-12-31 15:11:32,267 INFO L226 Difference]: Without dead ends: 9372 [2018-12-31 15:11:32,276 INFO L631 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 [2018-12-31 15:11:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2018-12-31 15:11:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8962. [2018-12-31 15:11:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2018-12-31 15:11:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13974 transitions. [2018-12-31 15:11:32,975 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 13974 transitions. Word has length 110 [2018-12-31 15:11:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:32,976 INFO L480 AbstractCegarLoop]: Abstraction has 8962 states and 13974 transitions. [2018-12-31 15:11:32,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 13974 transitions. [2018-12-31 15:11:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 15:11:32,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:32,979 INFO L402 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] [2018-12-31 15:11:32,979 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1189364322, now seen corresponding path program 1 times [2018-12-31 15:11:32,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:32,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:32,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:33,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:33,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:33,276 INFO L87 Difference]: Start difference. First operand 8962 states and 13974 transitions. Second operand 4 states. [2018-12-31 15:11:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:34,736 INFO L93 Difference]: Finished difference Result 25027 states and 38954 transitions. [2018-12-31 15:11:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:34,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-31 15:11:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:34,772 INFO L225 Difference]: With dead ends: 25027 [2018-12-31 15:11:34,772 INFO L226 Difference]: Without dead ends: 16104 [2018-12-31 15:11:34,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2018-12-31 15:11:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2018-12-31 15:11:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2018-12-31 15:11:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24827 transitions. [2018-12-31 15:11:36,142 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24827 transitions. Word has length 111 [2018-12-31 15:11:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:36,143 INFO L480 AbstractCegarLoop]: Abstraction has 16102 states and 24827 transitions. [2018-12-31 15:11:36,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24827 transitions. [2018-12-31 15:11:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-31 15:11:36,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:36,154 INFO L402 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] [2018-12-31 15:11:36,155 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2128482264, now seen corresponding path program 1 times [2018-12-31 15:11:36,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:36,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:36,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:36,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:36,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:36,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:36,259 INFO L87 Difference]: Start difference. First operand 16102 states and 24827 transitions. Second operand 3 states. [2018-12-31 15:11:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:38,726 INFO L93 Difference]: Finished difference Result 48114 states and 74234 transitions. [2018-12-31 15:11:38,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:38,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-31 15:11:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:38,802 INFO L225 Difference]: With dead ends: 48114 [2018-12-31 15:11:38,803 INFO L226 Difference]: Without dead ends: 32117 [2018-12-31 15:11:38,831 INFO L631 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 [2018-12-31 15:11:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32117 states. [2018-12-31 15:11:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32117 to 16108. [2018-12-31 15:11:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16108 states. [2018-12-31 15:11:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16108 states to 16108 states and 24833 transitions. [2018-12-31 15:11:40,428 INFO L78 Accepts]: Start accepts. Automaton has 16108 states and 24833 transitions. Word has length 112 [2018-12-31 15:11:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:40,428 INFO L480 AbstractCegarLoop]: Abstraction has 16108 states and 24833 transitions. [2018-12-31 15:11:40,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16108 states and 24833 transitions. [2018-12-31 15:11:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-31 15:11:40,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:40,434 INFO L402 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] [2018-12-31 15:11:40,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1621970129, now seen corresponding path program 1 times [2018-12-31 15:11:40,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:40,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:40,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:40,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:11:40,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:11:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:11:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:11:40,550 INFO L87 Difference]: Start difference. First operand 16108 states and 24833 transitions. Second operand 3 states. [2018-12-31 15:11:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:42,600 INFO L93 Difference]: Finished difference Result 41746 states and 64349 transitions. [2018-12-31 15:11:42,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:11:42,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-31 15:11:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:42,648 INFO L225 Difference]: With dead ends: 41746 [2018-12-31 15:11:42,648 INFO L226 Difference]: Without dead ends: 26384 [2018-12-31 15:11:42,674 INFO L631 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 [2018-12-31 15:11:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2018-12-31 15:11:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26382. [2018-12-31 15:11:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2018-12-31 15:11:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 40027 transitions. [2018-12-31 15:11:44,749 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 40027 transitions. Word has length 113 [2018-12-31 15:11:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:44,749 INFO L480 AbstractCegarLoop]: Abstraction has 26382 states and 40027 transitions. [2018-12-31 15:11:44,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:11:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 40027 transitions. [2018-12-31 15:11:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-31 15:11:44,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:44,759 INFO L402 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] [2018-12-31 15:11:44,759 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:44,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1799632340, now seen corresponding path program 1 times [2018-12-31 15:11:44,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:44,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:44,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:44,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:44,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:44,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:44,938 INFO L87 Difference]: Start difference. First operand 26382 states and 40027 transitions. Second operand 4 states. [2018-12-31 15:11:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:46,804 INFO L93 Difference]: Finished difference Result 48995 states and 74626 transitions. [2018-12-31 15:11:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:46,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-31 15:11:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:46,837 INFO L225 Difference]: With dead ends: 48995 [2018-12-31 15:11:46,837 INFO L226 Difference]: Without dead ends: 23283 [2018-12-31 15:11:46,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2018-12-31 15:11:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23283. [2018-12-31 15:11:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23283 states. [2018-12-31 15:11:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23283 states to 23283 states and 35373 transitions. [2018-12-31 15:11:48,763 INFO L78 Accepts]: Start accepts. Automaton has 23283 states and 35373 transitions. Word has length 113 [2018-12-31 15:11:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:48,763 INFO L480 AbstractCegarLoop]: Abstraction has 23283 states and 35373 transitions. [2018-12-31 15:11:48,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23283 states and 35373 transitions. [2018-12-31 15:11:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-31 15:11:48,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:48,773 INFO L402 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] [2018-12-31 15:11:48,773 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash -812664826, now seen corresponding path program 1 times [2018-12-31 15:11:48,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:48,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:48,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:49,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:49,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:11:49,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:11:49,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:11:49,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:11:49,030 INFO L87 Difference]: Start difference. First operand 23283 states and 35373 transitions. Second operand 4 states. [2018-12-31 15:11:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:11:50,928 INFO L93 Difference]: Finished difference Result 44591 states and 67806 transitions. [2018-12-31 15:11:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:11:50,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-31 15:11:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:11:50,954 INFO L225 Difference]: With dead ends: 44591 [2018-12-31 15:11:50,954 INFO L226 Difference]: Without dead ends: 21601 [2018-12-31 15:11:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:11:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21601 states. [2018-12-31 15:11:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21601 to 21559. [2018-12-31 15:11:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2018-12-31 15:11:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 32717 transitions. [2018-12-31 15:11:52,583 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 32717 transitions. Word has length 116 [2018-12-31 15:11:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:11:52,583 INFO L480 AbstractCegarLoop]: Abstraction has 21559 states and 32717 transitions. [2018-12-31 15:11:52,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:11:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 32717 transitions. [2018-12-31 15:11:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 15:11:52,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:11:52,588 INFO L402 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] [2018-12-31 15:11:52,588 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:11:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:11:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -929354459, now seen corresponding path program 1 times [2018-12-31 15:11:52,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:11:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:11:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:11:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:11:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:11:52,933 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 6 [2018-12-31 15:11:53,101 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2018-12-31 15:11:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:11:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:11:53,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-31 15:11:53,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 15:11:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 15:11:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-31 15:11:53,796 INFO L87 Difference]: Start difference. First operand 21559 states and 32717 transitions. Second operand 16 states. [2018-12-31 15:12:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:01,295 INFO L93 Difference]: Finished difference Result 70500 states and 107892 transitions. [2018-12-31 15:12:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 15:12:01,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-12-31 15:12:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:01,367 INFO L225 Difference]: With dead ends: 70500 [2018-12-31 15:12:01,367 INFO L226 Difference]: Without dead ends: 59819 [2018-12-31 15:12:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-12-31 15:12:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59819 states. [2018-12-31 15:12:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59819 to 22186. [2018-12-31 15:12:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22186 states. [2018-12-31 15:12:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22186 states to 22186 states and 33451 transitions. [2018-12-31 15:12:03,675 INFO L78 Accepts]: Start accepts. Automaton has 22186 states and 33451 transitions. Word has length 118 [2018-12-31 15:12:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 22186 states and 33451 transitions. [2018-12-31 15:12:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 15:12:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22186 states and 33451 transitions. [2018-12-31 15:12:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 15:12:03,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:03,682 INFO L402 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] [2018-12-31 15:12:03,682 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2037476919, now seen corresponding path program 1 times [2018-12-31 15:12:03,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:03,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:03,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:04,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:04,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:12:04,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:12:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:12:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:12:04,003 INFO L87 Difference]: Start difference. First operand 22186 states and 33451 transitions. Second operand 4 states. [2018-12-31 15:12:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:06,864 INFO L93 Difference]: Finished difference Result 44463 states and 67020 transitions. [2018-12-31 15:12:06,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:12:06,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-31 15:12:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:06,895 INFO L225 Difference]: With dead ends: 44463 [2018-12-31 15:12:06,895 INFO L226 Difference]: Without dead ends: 22432 [2018-12-31 15:12:07,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22432 states. [2018-12-31 15:12:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22432 to 22328. [2018-12-31 15:12:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22328 states. [2018-12-31 15:12:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22328 states to 22328 states and 33602 transitions. [2018-12-31 15:12:09,654 INFO L78 Accepts]: Start accepts. Automaton has 22328 states and 33602 transitions. Word has length 118 [2018-12-31 15:12:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:09,655 INFO L480 AbstractCegarLoop]: Abstraction has 22328 states and 33602 transitions. [2018-12-31 15:12:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:12:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22328 states and 33602 transitions. [2018-12-31 15:12:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-31 15:12:09,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:09,660 INFO L402 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] [2018-12-31 15:12:09,660 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash 382637137, now seen corresponding path program 1 times [2018-12-31 15:12:09,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:09,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:09,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:09,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:09,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:09,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:12:09,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:12:09,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:12:09,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:12:09,729 INFO L87 Difference]: Start difference. First operand 22328 states and 33602 transitions. Second operand 3 states. [2018-12-31 15:12:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:14,956 INFO L93 Difference]: Finished difference Result 60738 states and 91608 transitions. [2018-12-31 15:12:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:12:14,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-12-31 15:12:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:15,014 INFO L225 Difference]: With dead ends: 60738 [2018-12-31 15:12:15,014 INFO L226 Difference]: Without dead ends: 44449 [2018-12-31 15:12:15,034 INFO L631 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 [2018-12-31 15:12:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44449 states. [2018-12-31 15:12:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44449 to 22338. [2018-12-31 15:12:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22338 states. [2018-12-31 15:12:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22338 states to 22338 states and 33612 transitions. [2018-12-31 15:12:17,918 INFO L78 Accepts]: Start accepts. Automaton has 22338 states and 33612 transitions. Word has length 119 [2018-12-31 15:12:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:17,918 INFO L480 AbstractCegarLoop]: Abstraction has 22338 states and 33612 transitions. [2018-12-31 15:12:17,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:12:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 22338 states and 33612 transitions. [2018-12-31 15:12:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 15:12:17,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:17,924 INFO L402 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] [2018-12-31 15:12:17,924 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:17,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1972916280, now seen corresponding path program 1 times [2018-12-31 15:12:17,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:17,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:18,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:18,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:12:18,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 15:12:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 15:12:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 15:12:18,091 INFO L87 Difference]: Start difference. First operand 22338 states and 33612 transitions. Second operand 4 states. [2018-12-31 15:12:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:21,078 INFO L93 Difference]: Finished difference Result 39172 states and 58870 transitions. [2018-12-31 15:12:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:12:21,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-31 15:12:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:21,105 INFO L225 Difference]: With dead ends: 39172 [2018-12-31 15:12:21,105 INFO L226 Difference]: Without dead ends: 22328 [2018-12-31 15:12:21,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22328 states. [2018-12-31 15:12:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22328 to 22328. [2018-12-31 15:12:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22328 states. [2018-12-31 15:12:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22328 states to 22328 states and 33597 transitions. [2018-12-31 15:12:23,854 INFO L78 Accepts]: Start accepts. Automaton has 22328 states and 33597 transitions. Word has length 120 [2018-12-31 15:12:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:23,854 INFO L480 AbstractCegarLoop]: Abstraction has 22328 states and 33597 transitions. [2018-12-31 15:12:23,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 15:12:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22328 states and 33597 transitions. [2018-12-31 15:12:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 15:12:23,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:23,860 INFO L402 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] [2018-12-31 15:12:23,860 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1572545800, now seen corresponding path program 1 times [2018-12-31 15:12:23,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:23,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:23,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:24,155 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-12-31 15:12:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 15:12:24,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 15:12:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 15:12:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:24,315 INFO L87 Difference]: Start difference. First operand 22328 states and 33597 transitions. Second operand 5 states. [2018-12-31 15:12:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:27,120 INFO L93 Difference]: Finished difference Result 42919 states and 64553 transitions. [2018-12-31 15:12:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:12:27,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-31 15:12:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:27,144 INFO L225 Difference]: With dead ends: 42919 [2018-12-31 15:12:27,144 INFO L226 Difference]: Without dead ends: 20873 [2018-12-31 15:12:27,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20873 states. [2018-12-31 15:12:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20873 to 20601. [2018-12-31 15:12:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2018-12-31 15:12:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30936 transitions. [2018-12-31 15:12:29,827 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30936 transitions. Word has length 120 [2018-12-31 15:12:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:29,827 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30936 transitions. [2018-12-31 15:12:29,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 15:12:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30936 transitions. [2018-12-31 15:12:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:12:29,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:29,832 INFO L402 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] [2018-12-31 15:12:29,832 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2018-12-31 15:12:29,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:29,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:30,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:30,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 15:12:30,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 15:12:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 15:12:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:30,019 INFO L87 Difference]: Start difference. First operand 20601 states and 30936 transitions. Second operand 5 states. [2018-12-31 15:12:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:32,919 INFO L93 Difference]: Finished difference Result 39713 states and 60156 transitions. [2018-12-31 15:12:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 15:12:32,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-12-31 15:12:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:32,950 INFO L225 Difference]: With dead ends: 39713 [2018-12-31 15:12:32,950 INFO L226 Difference]: Without dead ends: 20601 [2018-12-31 15:12:32,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 15:12:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20601 states. [2018-12-31 15:12:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20601 to 20601. [2018-12-31 15:12:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2018-12-31 15:12:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30690 transitions. [2018-12-31 15:12:35,865 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30690 transitions. Word has length 122 [2018-12-31 15:12:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:35,865 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30690 transitions. [2018-12-31 15:12:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 15:12:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30690 transitions. [2018-12-31 15:12:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:12:35,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:35,870 INFO L402 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] [2018-12-31 15:12:35,870 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2018-12-31 15:12:35,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:35,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:36,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:36,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 15:12:36,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 15:12:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 15:12:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 15:12:36,160 INFO L87 Difference]: Start difference. First operand 20601 states and 30690 transitions. Second operand 5 states. [2018-12-31 15:12:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:39,406 INFO L93 Difference]: Finished difference Result 38429 states and 58206 transitions. [2018-12-31 15:12:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 15:12:39,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-12-31 15:12:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:39,431 INFO L225 Difference]: With dead ends: 38429 [2018-12-31 15:12:39,431 INFO L226 Difference]: Without dead ends: 20603 [2018-12-31 15:12:39,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 15:12:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20603 states. [2018-12-31 15:12:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20603 to 20601. [2018-12-31 15:12:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2018-12-31 15:12:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30594 transitions. [2018-12-31 15:12:42,366 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30594 transitions. Word has length 122 [2018-12-31 15:12:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:42,367 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30594 transitions. [2018-12-31 15:12:42,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 15:12:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30594 transitions. [2018-12-31 15:12:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:12:42,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:42,371 INFO L402 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] [2018-12-31 15:12:42,372 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -82654240, now seen corresponding path program 1 times [2018-12-31 15:12:42,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:42,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:42,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:42,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 15:12:42,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 15:12:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 15:12:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 15:12:42,474 INFO L87 Difference]: Start difference. First operand 20601 states and 30594 transitions. Second operand 3 states. [2018-12-31 15:12:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:12:48,009 INFO L93 Difference]: Finished difference Result 55297 states and 84344 transitions. [2018-12-31 15:12:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 15:12:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-12-31 15:12:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:12:48,061 INFO L225 Difference]: With dead ends: 55297 [2018-12-31 15:12:48,061 INFO L226 Difference]: Without dead ends: 37949 [2018-12-31 15:12:48,078 INFO L631 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 [2018-12-31 15:12:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37949 states. [2018-12-31 15:12:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37949 to 37875. [2018-12-31 15:12:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37875 states. [2018-12-31 15:12:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37875 states to 37875 states and 56514 transitions. [2018-12-31 15:12:52,845 INFO L78 Accepts]: Start accepts. Automaton has 37875 states and 56514 transitions. Word has length 122 [2018-12-31 15:12:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:12:52,846 INFO L480 AbstractCegarLoop]: Abstraction has 37875 states and 56514 transitions. [2018-12-31 15:12:52,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 15:12:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 37875 states and 56514 transitions. [2018-12-31 15:12:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:12:52,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:12:52,851 INFO L402 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] [2018-12-31 15:12:52,851 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:12:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:12:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1976470388, now seen corresponding path program 1 times [2018-12-31 15:12:52,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:12:52,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:12:52,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:52,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:12:52,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:12:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:12:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:12:53,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:12:53,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 15:12:53,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 15:12:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 15:12:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 15:12:53,069 INFO L87 Difference]: Start difference. First operand 37875 states and 56514 transitions. Second operand 6 states. [2018-12-31 15:13:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:13:09,144 INFO L93 Difference]: Finished difference Result 143531 states and 216319 transitions. [2018-12-31 15:13:09,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 15:13:09,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-12-31 15:13:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:13:09,308 INFO L225 Difference]: With dead ends: 143531 [2018-12-31 15:13:09,309 INFO L226 Difference]: Without dead ends: 106975 [2018-12-31 15:13:09,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-31 15:13:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106975 states. [2018-12-31 15:13:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106975 to 106971. [2018-12-31 15:13:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106971 states. [2018-12-31 15:13:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106971 states to 106971 states and 160821 transitions. [2018-12-31 15:13:24,750 INFO L78 Accepts]: Start accepts. Automaton has 106971 states and 160821 transitions. Word has length 122 [2018-12-31 15:13:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:13:24,750 INFO L480 AbstractCegarLoop]: Abstraction has 106971 states and 160821 transitions. [2018-12-31 15:13:24,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 15:13:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 106971 states and 160821 transitions. [2018-12-31 15:13:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:13:24,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:13:24,756 INFO L402 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] [2018-12-31 15:13:24,756 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:13:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:13:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1986267249, now seen corresponding path program 1 times [2018-12-31 15:13:24,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:13:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:13:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:13:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:13:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:13:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 15:13:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 15:13:26,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 15:13:26,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-31 15:13:26,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 15:13:26,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 15:13:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-12-31 15:13:26,386 INFO L87 Difference]: Start difference. First operand 106971 states and 160821 transitions. Second operand 21 states. [2018-12-31 15:13:26,818 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-31 15:13:27,067 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-31 15:13:27,267 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-31 15:13:27,807 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-31 15:13:28,084 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-12-31 15:13:28,523 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-12-31 15:13:28,871 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-12-31 15:13:29,245 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-31 15:13:29,624 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-31 15:13:29,846 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-31 15:13:30,265 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-31 15:13:30,495 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 15:13:31,016 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-31 15:14:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 15:14:17,357 INFO L93 Difference]: Finished difference Result 305233 states and 460102 transitions. [2018-12-31 15:14:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 15:14:17,357 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2018-12-31 15:14:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 15:14:17,802 INFO L225 Difference]: With dead ends: 305233 [2018-12-31 15:14:17,802 INFO L226 Difference]: Without dead ends: 258899 [2018-12-31 15:14:17,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 15:14:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258899 states. [2018-12-31 15:14:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258899 to 107448. [2018-12-31 15:14:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107448 states. [2018-12-31 15:14:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107448 states to 107448 states and 161373 transitions. [2018-12-31 15:14:40,722 INFO L78 Accepts]: Start accepts. Automaton has 107448 states and 161373 transitions. Word has length 122 [2018-12-31 15:14:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 15:14:40,723 INFO L480 AbstractCegarLoop]: Abstraction has 107448 states and 161373 transitions. [2018-12-31 15:14:40,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 15:14:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 107448 states and 161373 transitions. [2018-12-31 15:14:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-31 15:14:40,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 15:14:40,728 INFO L402 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] [2018-12-31 15:14:40,729 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 15:14:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 15:14:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash -270948014, now seen corresponding path program 1 times [2018-12-31 15:14:40,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 15:14:40,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 15:14:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:14:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 15:14:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 15:14:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 15:14:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 15:14:40,958 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 15:14:41,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:14:41 BoogieIcfgContainer [2018-12-31 15:14:41,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 15:14:41,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 15:14:41,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 15:14:41,225 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 15:14:41,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:11:20" (3/4) ... [2018-12-31 15:14:41,230 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 15:14:41,494 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 15:14:41,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 15:14:41,496 INFO L168 Benchmark]: Toolchain (without parser) took 204119.12 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 952.7 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,496 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 15:14:41,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.48 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 211.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,497 INFO L168 Benchmark]: Boogie Preprocessor took 84.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,499 INFO L168 Benchmark]: RCFGBuilder took 2230.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,499 INFO L168 Benchmark]: TraceAbstraction took 200421.68 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,500 INFO L168 Benchmark]: Witness Printer took 269.47 ms. Allocated memory is still 5.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. [2018-12-31 15:14:41,504 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 894.48 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 211.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2230.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 200421.68 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 269.47 ms. Allocated memory is still 5.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L133] COND TRUE !(init__r121 == 0) [L135] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L137] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L138] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1759] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1761] COND TRUE !(ep23 == 0) [L1763] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L142] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L143] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1736] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1738] COND TRUE !(ep31 == 0) [L1740] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L147] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r231 == 0) [L150] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r311 == 0) [L155] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1667] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L1669] COND TRUE !(ep12 == 0) [L1671] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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 FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L252] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L254] COND TRUE !(newmax1 == 0) [L256] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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 TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] COND TRUE p12_new == nomsg [L261] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, 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] [L263] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE !(newmax2 == 0) [L307] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L308] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND TRUE p23_new == nomsg [L312] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L314] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L328] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L330] COND TRUE !(newmax3 == 0) [L332] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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 TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L335] COND TRUE p31_new == nomsg [L337] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L339] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE !(ep31 == 0) [L434] m1 = p31_old [L435] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, 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=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. UNSAFE Result, 200.3s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 118.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12837 SDtfs, 16656 SDslu, 22244 SDs, 0 SdLazy, 4371 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107448occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 228642 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3047 NumberOfCodeBlocks, 3047 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2899 ConstructedInterpolants, 0 QuantifiedInterpolants, 1501965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...