./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 b4bbd3192d51717fc5b40bef5afa5d60438fb577 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-12 17:55:03,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 17:55:03,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 17:55:03,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 17:55:03,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 17:55:03,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 17:55:03,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 17:55:03,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 17:55:03,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 17:55:03,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 17:55:03,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 17:55:03,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 17:55:03,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 17:55:03,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 17:55:03,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 17:55:03,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 17:55:03,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 17:55:03,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 17:55:03,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 17:55:03,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 17:55:03,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 17:55:03,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 17:55:03,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 17:55:03,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 17:55:03,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 17:55:03,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 17:55:03,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 17:55:03,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 17:55:03,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 17:55:03,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 17:55:03,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 17:55:03,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 17:55:03,229 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 17:55:03,229 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 17:55:03,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 17:55:03,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 17:55:03,232 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 17:55:03,258 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 17:55:03,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 17:55:03,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 17:55:03,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 17:55:03,261 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 17:55:03,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 17:55:03,262 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 17:55:03,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 17:55:03,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 17:55:03,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 17:55:03,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 17:55:03,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 17:55:03,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 17:55:03,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 17:55:03,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 17:55:03,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 17:55:03,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:03,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 17:55:03,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 17:55:03,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 17:55:03,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 17:55:03,268 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 17:55:03,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 17:55:03,268 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 -> b4bbd3192d51717fc5b40bef5afa5d60438fb577 [2019-01-12 17:55:03,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 17:55:03,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 17:55:03,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 17:55:03,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 17:55:03,345 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 17:55:03,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:55:03,396 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f92b78/8011de9516654f418442dedd6528f94e/FLAGc6ed4927b [2019-01-12 17:55:03,864 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 17:55:03,864 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:55:03,879 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f92b78/8011de9516654f418442dedd6528f94e/FLAGc6ed4927b [2019-01-12 17:55:04,140 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f92b78/8011de9516654f418442dedd6528f94e [2019-01-12 17:55:04,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 17:55:04,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 17:55:04,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:04,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 17:55:04,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 17:55:04,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431aedcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04, skipping insertion in model container [2019-01-12 17:55:04,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 17:55:04,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 17:55:04,604 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:04,616 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 17:55:04,752 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:04,850 INFO L195 MainTranslator]: Completed translation [2019-01-12 17:55:04,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04 WrapperNode [2019-01-12 17:55:04,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:04,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:04,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 17:55:04,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 17:55:04,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:04,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 17:55:04,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 17:55:04,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 17:55:04,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 17:55:04,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 17:55:04,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 17:55:04,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 17:55:04,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 17:55:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 17:55:07,037 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 17:55:07,037 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 17:55:07,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07 BoogieIcfgContainer [2019-01-12 17:55:07,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 17:55:07,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 17:55:07,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 17:55:07,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 17:55:07,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:55:04" (1/3) ... [2019-01-12 17:55:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0fa513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:07, skipping insertion in model container [2019-01-12 17:55:07,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (2/3) ... [2019-01-12 17:55:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0fa513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:07, skipping insertion in model container [2019-01-12 17:55:07,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07" (3/3) ... [2019-01-12 17:55:07,046 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:55:07,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 17:55:07,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 17:55:07,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 17:55:07,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 17:55:07,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 17:55:07,111 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 17:55:07,111 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 17:55:07,111 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 17:55:07,111 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 17:55:07,112 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 17:55:07,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 17:55:07,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 17:55:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-01-12 17:55:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 17:55:07,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:07,155 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] [2019-01-12 17:55:07,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1900773932, now seen corresponding path program 1 times [2019-01-12 17:55:07,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:07,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:07,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:07,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:07,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:07,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:07,847 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2019-01-12 17:55:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:08,186 INFO L93 Difference]: Finished difference Result 685 states and 1223 transitions. [2019-01-12 17:55:08,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:08,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-12 17:55:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:08,210 INFO L225 Difference]: With dead ends: 685 [2019-01-12 17:55:08,211 INFO L226 Difference]: Without dead ends: 451 [2019-01-12 17:55:08,215 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 [2019-01-12 17:55:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-01-12 17:55:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2019-01-12 17:55:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-12 17:55:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 629 transitions. [2019-01-12 17:55:08,322 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 629 transitions. Word has length 91 [2019-01-12 17:55:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:08,322 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 629 transitions. [2019-01-12 17:55:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 629 transitions. [2019-01-12 17:55:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 17:55:08,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:08,328 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] [2019-01-12 17:55:08,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 510528216, now seen corresponding path program 1 times [2019-01-12 17:55:08,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:08,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:08,476 INFO L87 Difference]: Start difference. First operand 431 states and 629 transitions. Second operand 3 states. [2019-01-12 17:55:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:08,593 INFO L93 Difference]: Finished difference Result 1255 states and 1825 transitions. [2019-01-12 17:55:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:08,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-12 17:55:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:08,600 INFO L225 Difference]: With dead ends: 1255 [2019-01-12 17:55:08,601 INFO L226 Difference]: Without dead ends: 852 [2019-01-12 17:55:08,604 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 [2019-01-12 17:55:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-01-12 17:55:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 433. [2019-01-12 17:55:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-12 17:55:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 631 transitions. [2019-01-12 17:55:08,671 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 631 transitions. Word has length 92 [2019-01-12 17:55:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:08,672 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 631 transitions. [2019-01-12 17:55:08,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 631 transitions. [2019-01-12 17:55:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 17:55:08,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:08,687 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] [2019-01-12 17:55:08,687 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash 776423708, now seen corresponding path program 1 times [2019-01-12 17:55:08,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:08,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:08,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:08,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:08,847 INFO L87 Difference]: Start difference. First operand 433 states and 631 transitions. Second operand 3 states. [2019-01-12 17:55:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:09,143 INFO L93 Difference]: Finished difference Result 1090 states and 1604 transitions. [2019-01-12 17:55:09,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:09,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-12 17:55:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:09,151 INFO L225 Difference]: With dead ends: 1090 [2019-01-12 17:55:09,151 INFO L226 Difference]: Without dead ends: 835 [2019-01-12 17:55:09,152 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 [2019-01-12 17:55:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-01-12 17:55:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 817. [2019-01-12 17:55:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-01-12 17:55:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1185 transitions. [2019-01-12 17:55:09,212 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1185 transitions. Word has length 93 [2019-01-12 17:55:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:09,214 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1185 transitions. [2019-01-12 17:55:09,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1185 transitions. [2019-01-12 17:55:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 17:55:09,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:09,219 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] [2019-01-12 17:55:09,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -379676641, now seen corresponding path program 1 times [2019-01-12 17:55:09,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:09,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:09,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:09,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:09,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:09,391 INFO L87 Difference]: Start difference. First operand 817 states and 1185 transitions. Second operand 4 states. [2019-01-12 17:55:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:09,544 INFO L93 Difference]: Finished difference Result 1277 states and 1867 transitions. [2019-01-12 17:55:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:09,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-12 17:55:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:09,549 INFO L225 Difference]: With dead ends: 1277 [2019-01-12 17:55:09,549 INFO L226 Difference]: Without dead ends: 628 [2019-01-12 17:55:09,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-01-12 17:55:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-01-12 17:55:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-01-12 17:55:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 905 transitions. [2019-01-12 17:55:09,624 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 905 transitions. Word has length 93 [2019-01-12 17:55:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:09,624 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 905 transitions. [2019-01-12 17:55:09,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 905 transitions. [2019-01-12 17:55:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 17:55:09,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:09,626 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] [2019-01-12 17:55:09,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash -531071774, now seen corresponding path program 1 times [2019-01-12 17:55:09,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:09,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:09,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:09,826 INFO L87 Difference]: Start difference. First operand 628 states and 905 transitions. Second operand 5 states. [2019-01-12 17:55:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:11,952 INFO L93 Difference]: Finished difference Result 1324 states and 1989 transitions. [2019-01-12 17:55:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:55:11,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-12 17:55:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:11,958 INFO L225 Difference]: With dead ends: 1324 [2019-01-12 17:55:11,958 INFO L226 Difference]: Without dead ends: 863 [2019-01-12 17:55:11,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:55:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-01-12 17:55:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2019-01-12 17:55:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-01-12 17:55:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1282 transitions. [2019-01-12 17:55:12,018 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1282 transitions. Word has length 95 [2019-01-12 17:55:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:12,018 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1282 transitions. [2019-01-12 17:55:12,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1282 transitions. [2019-01-12 17:55:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 17:55:12,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:12,020 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] [2019-01-12 17:55:12,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1420244925, now seen corresponding path program 1 times [2019-01-12 17:55:12,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:12,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:12,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:12,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:12,350 INFO L87 Difference]: Start difference. First operand 861 states and 1282 transitions. Second operand 4 states. [2019-01-12 17:55:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:12,787 INFO L93 Difference]: Finished difference Result 2156 states and 3215 transitions. [2019-01-12 17:55:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:12,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 17:55:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:12,795 INFO L225 Difference]: With dead ends: 2156 [2019-01-12 17:55:12,795 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 17:55:12,797 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 [2019-01-12 17:55:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 17:55:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1300. [2019-01-12 17:55:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-01-12 17:55:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1926 transitions. [2019-01-12 17:55:12,884 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1926 transitions. Word has length 95 [2019-01-12 17:55:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:12,884 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1926 transitions. [2019-01-12 17:55:12,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1926 transitions. [2019-01-12 17:55:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 17:55:12,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:12,888 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] [2019-01-12 17:55:12,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1952699589, now seen corresponding path program 1 times [2019-01-12 17:55:12,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:13,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:13,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:13,007 INFO L87 Difference]: Start difference. First operand 1300 states and 1926 transitions. Second operand 3 states. [2019-01-12 17:55:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:13,342 INFO L93 Difference]: Finished difference Result 3366 states and 5081 transitions. [2019-01-12 17:55:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:13,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-12 17:55:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:13,353 INFO L225 Difference]: With dead ends: 3366 [2019-01-12 17:55:13,353 INFO L226 Difference]: Without dead ends: 2395 [2019-01-12 17:55:13,355 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 [2019-01-12 17:55:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-01-12 17:55:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2383. [2019-01-12 17:55:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2019-01-12 17:55:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3534 transitions. [2019-01-12 17:55:13,538 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3534 transitions. Word has length 97 [2019-01-12 17:55:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:13,538 INFO L480 AbstractCegarLoop]: Abstraction has 2383 states and 3534 transitions. [2019-01-12 17:55:13,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3534 transitions. [2019-01-12 17:55:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 17:55:13,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:13,542 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] [2019-01-12 17:55:13,542 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash -568605314, now seen corresponding path program 1 times [2019-01-12 17:55:13,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:13,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:13,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:13,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:13,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:13,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:13,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:13,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:13,695 INFO L87 Difference]: Start difference. First operand 2383 states and 3534 transitions. Second operand 4 states. [2019-01-12 17:55:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:13,854 INFO L93 Difference]: Finished difference Result 3659 states and 5458 transitions. [2019-01-12 17:55:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:13,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-12 17:55:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:13,862 INFO L225 Difference]: With dead ends: 3659 [2019-01-12 17:55:13,862 INFO L226 Difference]: Without dead ends: 1952 [2019-01-12 17:55:13,865 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 [2019-01-12 17:55:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2019-01-12 17:55:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2019-01-12 17:55:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-01-12 17:55:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2878 transitions. [2019-01-12 17:55:13,990 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2878 transitions. Word has length 97 [2019-01-12 17:55:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:13,990 INFO L480 AbstractCegarLoop]: Abstraction has 1952 states and 2878 transitions. [2019-01-12 17:55:13,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2878 transitions. [2019-01-12 17:55:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 17:55:13,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:13,995 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] [2019-01-12 17:55:13,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1908787294, now seen corresponding path program 1 times [2019-01-12 17:55:13,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:13,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:14,270 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 17:55:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:14,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:14,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:14,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:14,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:14,301 INFO L87 Difference]: Start difference. First operand 1952 states and 2878 transitions. Second operand 4 states. [2019-01-12 17:55:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:14,725 INFO L93 Difference]: Finished difference Result 5621 states and 8278 transitions. [2019-01-12 17:55:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:14,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-12 17:55:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:14,739 INFO L225 Difference]: With dead ends: 5621 [2019-01-12 17:55:14,739 INFO L226 Difference]: Without dead ends: 3708 [2019-01-12 17:55:14,743 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 [2019-01-12 17:55:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2019-01-12 17:55:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3635. [2019-01-12 17:55:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-01-12 17:55:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5318 transitions. [2019-01-12 17:55:14,970 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5318 transitions. Word has length 99 [2019-01-12 17:55:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:14,970 INFO L480 AbstractCegarLoop]: Abstraction has 3635 states and 5318 transitions. [2019-01-12 17:55:14,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5318 transitions. [2019-01-12 17:55:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 17:55:14,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:14,976 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] [2019-01-12 17:55:14,976 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1510274808, now seen corresponding path program 1 times [2019-01-12 17:55:14,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:14,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:14,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:14,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:15,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:15,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:15,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:15,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:15,063 INFO L87 Difference]: Start difference. First operand 3635 states and 5318 transitions. Second operand 3 states. [2019-01-12 17:55:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:15,477 INFO L93 Difference]: Finished difference Result 10719 states and 15713 transitions. [2019-01-12 17:55:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:15,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 17:55:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:15,499 INFO L225 Difference]: With dead ends: 10719 [2019-01-12 17:55:15,499 INFO L226 Difference]: Without dead ends: 7186 [2019-01-12 17:55:15,504 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 [2019-01-12 17:55:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2019-01-12 17:55:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 3641. [2019-01-12 17:55:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-01-12 17:55:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5324 transitions. [2019-01-12 17:55:15,747 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5324 transitions. Word has length 100 [2019-01-12 17:55:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:15,747 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 5324 transitions. [2019-01-12 17:55:15,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5324 transitions. [2019-01-12 17:55:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 17:55:15,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:15,751 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] [2019-01-12 17:55:15,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1350811331, now seen corresponding path program 1 times [2019-01-12 17:55:15,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:15,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:15,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:15,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:15,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:15,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:15,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:15,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:15,921 INFO L87 Difference]: Start difference. First operand 3641 states and 5324 transitions. Second operand 4 states. [2019-01-12 17:55:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:16,380 INFO L93 Difference]: Finished difference Result 7244 states and 10596 transitions. [2019-01-12 17:55:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:16,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 17:55:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:16,391 INFO L225 Difference]: With dead ends: 7244 [2019-01-12 17:55:16,391 INFO L226 Difference]: Without dead ends: 3635 [2019-01-12 17:55:16,395 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 [2019-01-12 17:55:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2019-01-12 17:55:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3635. [2019-01-12 17:55:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-01-12 17:55:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5312 transitions. [2019-01-12 17:55:16,669 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5312 transitions. Word has length 101 [2019-01-12 17:55:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:16,670 INFO L480 AbstractCegarLoop]: Abstraction has 3635 states and 5312 transitions. [2019-01-12 17:55:16,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5312 transitions. [2019-01-12 17:55:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 17:55:16,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:16,673 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] [2019-01-12 17:55:16,674 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1484154518, now seen corresponding path program 1 times [2019-01-12 17:55:16,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:16,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:16,783 INFO L87 Difference]: Start difference. First operand 3635 states and 5312 transitions. Second operand 3 states. [2019-01-12 17:55:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:17,196 INFO L93 Difference]: Finished difference Result 8386 states and 12376 transitions. [2019-01-12 17:55:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:17,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 17:55:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:17,216 INFO L225 Difference]: With dead ends: 8386 [2019-01-12 17:55:17,217 INFO L226 Difference]: Without dead ends: 5431 [2019-01-12 17:55:17,221 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 [2019-01-12 17:55:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2019-01-12 17:55:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 5358. [2019-01-12 17:55:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5358 states. [2019-01-12 17:55:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5358 states to 5358 states and 7698 transitions. [2019-01-12 17:55:17,538 INFO L78 Accepts]: Start accepts. Automaton has 5358 states and 7698 transitions. Word has length 101 [2019-01-12 17:55:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:17,539 INFO L480 AbstractCegarLoop]: Abstraction has 5358 states and 7698 transitions. [2019-01-12 17:55:17,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5358 states and 7698 transitions. [2019-01-12 17:55:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 17:55:17,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:17,585 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] [2019-01-12 17:55:17,586 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1128915036, now seen corresponding path program 1 times [2019-01-12 17:55:17,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:17,855 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 17:55:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:17,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:17,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:17,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:17,877 INFO L87 Difference]: Start difference. First operand 5358 states and 7698 transitions. Second operand 4 states. [2019-01-12 17:55:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:18,557 INFO L93 Difference]: Finished difference Result 9982 states and 14347 transitions. [2019-01-12 17:55:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:18,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 17:55:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:18,567 INFO L225 Difference]: With dead ends: 9982 [2019-01-12 17:55:18,567 INFO L226 Difference]: Without dead ends: 4879 [2019-01-12 17:55:18,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-01-12 17:55:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4832. [2019-01-12 17:55:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2019-01-12 17:55:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 6888 transitions. [2019-01-12 17:55:18,956 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 6888 transitions. Word has length 103 [2019-01-12 17:55:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:18,956 INFO L480 AbstractCegarLoop]: Abstraction has 4832 states and 6888 transitions. [2019-01-12 17:55:18,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 6888 transitions. [2019-01-12 17:55:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 17:55:18,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:18,960 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] [2019-01-12 17:55:18,960 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2033486580, now seen corresponding path program 1 times [2019-01-12 17:55:18,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:18,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:19,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:19,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:19,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:19,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:19,110 INFO L87 Difference]: Start difference. First operand 4832 states and 6888 transitions. Second operand 4 states. [2019-01-12 17:55:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:19,565 INFO L93 Difference]: Finished difference Result 9730 states and 13862 transitions. [2019-01-12 17:55:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:19,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-01-12 17:55:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:19,574 INFO L225 Difference]: With dead ends: 9730 [2019-01-12 17:55:19,574 INFO L226 Difference]: Without dead ends: 5049 [2019-01-12 17:55:19,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2019-01-12 17:55:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 4924. [2019-01-12 17:55:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4924 states. [2019-01-12 17:55:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4924 states to 4924 states and 6981 transitions. [2019-01-12 17:55:19,953 INFO L78 Accepts]: Start accepts. Automaton has 4924 states and 6981 transitions. Word has length 105 [2019-01-12 17:55:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:19,953 INFO L480 AbstractCegarLoop]: Abstraction has 4924 states and 6981 transitions. [2019-01-12 17:55:19,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4924 states and 6981 transitions. [2019-01-12 17:55:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 17:55:19,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:19,957 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] [2019-01-12 17:55:19,957 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2074136416, now seen corresponding path program 1 times [2019-01-12 17:55:19,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:20,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:20,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:20,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:20,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:20,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:20,031 INFO L87 Difference]: Start difference. First operand 4924 states and 6981 transitions. Second operand 3 states. [2019-01-12 17:55:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:21,151 INFO L93 Difference]: Finished difference Result 12961 states and 18553 transitions. [2019-01-12 17:55:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:21,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-12 17:55:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:21,168 INFO L225 Difference]: With dead ends: 12961 [2019-01-12 17:55:21,169 INFO L226 Difference]: Without dead ends: 9647 [2019-01-12 17:55:21,173 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 [2019-01-12 17:55:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2019-01-12 17:55:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 4934. [2019-01-12 17:55:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2019-01-12 17:55:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 6991 transitions. [2019-01-12 17:55:21,697 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 6991 transitions. Word has length 106 [2019-01-12 17:55:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:21,697 INFO L480 AbstractCegarLoop]: Abstraction has 4934 states and 6991 transitions. [2019-01-12 17:55:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 6991 transitions. [2019-01-12 17:55:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 17:55:21,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:21,701 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] [2019-01-12 17:55:21,702 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash -808190460, now seen corresponding path program 1 times [2019-01-12 17:55:21,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:55:22,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:22,004 INFO L87 Difference]: Start difference. First operand 4934 states and 6991 transitions. Second operand 5 states. [2019-01-12 17:55:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:22,587 INFO L93 Difference]: Finished difference Result 6418 states and 9357 transitions. [2019-01-12 17:55:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:22,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-01-12 17:55:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:22,597 INFO L225 Difference]: With dead ends: 6418 [2019-01-12 17:55:22,597 INFO L226 Difference]: Without dead ends: 3507 [2019-01-12 17:55:22,601 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 [2019-01-12 17:55:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2019-01-12 17:55:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3507. [2019-01-12 17:55:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3507 states. [2019-01-12 17:55:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 4709 transitions. [2019-01-12 17:55:22,857 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 4709 transitions. Word has length 107 [2019-01-12 17:55:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:22,857 INFO L480 AbstractCegarLoop]: Abstraction has 3507 states and 4709 transitions. [2019-01-12 17:55:22,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 4709 transitions. [2019-01-12 17:55:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 17:55:22,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:22,861 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] [2019-01-12 17:55:22,861 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1795554741, now seen corresponding path program 1 times [2019-01-12 17:55:22,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:22,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:22,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:22,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:22,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:23,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:23,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:23,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:23,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:23,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:23,102 INFO L87 Difference]: Start difference. First operand 3507 states and 4709 transitions. Second operand 4 states. [2019-01-12 17:55:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:23,750 INFO L93 Difference]: Finished difference Result 7154 states and 9570 transitions. [2019-01-12 17:55:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:23,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-01-12 17:55:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:23,757 INFO L225 Difference]: With dead ends: 7154 [2019-01-12 17:55:23,757 INFO L226 Difference]: Without dead ends: 3894 [2019-01-12 17:55:23,760 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 [2019-01-12 17:55:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3894 states. [2019-01-12 17:55:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3894 to 3733. [2019-01-12 17:55:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2019-01-12 17:55:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 4942 transitions. [2019-01-12 17:55:23,999 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 4942 transitions. Word has length 107 [2019-01-12 17:55:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:24,000 INFO L480 AbstractCegarLoop]: Abstraction has 3733 states and 4942 transitions. [2019-01-12 17:55:24,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4942 transitions. [2019-01-12 17:55:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 17:55:24,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:24,003 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] [2019-01-12 17:55:24,003 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1099193363, now seen corresponding path program 1 times [2019-01-12 17:55:24,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:24,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:24,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:24,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:24,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:24,160 INFO L87 Difference]: Start difference. First operand 3733 states and 4942 transitions. Second operand 4 states. [2019-01-12 17:55:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:24,582 INFO L93 Difference]: Finished difference Result 5014 states and 6705 transitions. [2019-01-12 17:55:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:24,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-01-12 17:55:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:24,588 INFO L225 Difference]: With dead ends: 5014 [2019-01-12 17:55:24,588 INFO L226 Difference]: Without dead ends: 3243 [2019-01-12 17:55:24,591 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 [2019-01-12 17:55:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-01-12 17:55:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3243. [2019-01-12 17:55:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-01-12 17:55:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4284 transitions. [2019-01-12 17:55:24,915 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4284 transitions. Word has length 107 [2019-01-12 17:55:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:24,915 INFO L480 AbstractCegarLoop]: Abstraction has 3243 states and 4284 transitions. [2019-01-12 17:55:24,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4284 transitions. [2019-01-12 17:55:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 17:55:24,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:24,919 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] [2019-01-12 17:55:24,919 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1031052173, now seen corresponding path program 1 times [2019-01-12 17:55:24,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:24,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:24,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:24,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:24,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:25,215 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 17:55:25,534 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-12 17:55:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:55:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:26,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 17:55:26,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 17:55:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 17:55:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-01-12 17:55:26,517 INFO L87 Difference]: Start difference. First operand 3243 states and 4284 transitions. Second operand 22 states. [2019-01-12 17:55:27,808 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-12 17:55:28,590 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-12 17:55:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:30,537 INFO L93 Difference]: Finished difference Result 4587 states and 6020 transitions. [2019-01-12 17:55:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 17:55:30,538 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2019-01-12 17:55:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:30,541 INFO L225 Difference]: With dead ends: 4587 [2019-01-12 17:55:30,542 INFO L226 Difference]: Without dead ends: 4238 [2019-01-12 17:55:30,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 17:55:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2019-01-12 17:55:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 3678. [2019-01-12 17:55:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-01-12 17:55:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4821 transitions. [2019-01-12 17:55:30,827 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4821 transitions. Word has length 109 [2019-01-12 17:55:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:30,827 INFO L480 AbstractCegarLoop]: Abstraction has 3678 states and 4821 transitions. [2019-01-12 17:55:30,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 17:55:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4821 transitions. [2019-01-12 17:55:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 17:55:30,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:30,830 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] [2019-01-12 17:55:30,831 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1418886827, now seen corresponding path program 1 times [2019-01-12 17:55:30,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:30,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:30,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:30,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:30,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:55:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:55:30,973 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 17:55:31,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:55:31 BoogieIcfgContainer [2019-01-12 17:55:31,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 17:55:31,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 17:55:31,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 17:55:31,185 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 17:55:31,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07" (3/4) ... [2019-01-12 17:55:31,189 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 17:55:31,404 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 17:55:31,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 17:55:31,405 INFO L168 Benchmark]: Toolchain (without parser) took 27261.93 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 839.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 672.4 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,407 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 17:55:31,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.67 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,408 INFO L168 Benchmark]: Boogie Preprocessor took 66.05 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,408 INFO L168 Benchmark]: RCFGBuilder took 2047.00 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: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,408 INFO L168 Benchmark]: TraceAbstraction took 24144.69 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 690.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.9 MB). Peak memory consumption was 564.0 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,409 INFO L168 Benchmark]: Witness Printer took 220.16 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:31,413 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.67 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.05 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2047.00 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: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24144.69 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 690.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.9 MB). Peak memory consumption was 564.0 MB. Max. memory is 11.5 GB. * Witness Printer took 220.16 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 513]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1131; [L65] int __return_1259; [L66] int __return_1679; [L67] int __return_1378; [L68] int __tmp_1379_0; [L69] int __return_1487; [L70] int __return_1392; VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=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, 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] [L73] int main__c1; [L74] int main__i2; [L75] main__c1 = 0 [L76] ep12 = __VERIFIER_nondet_bool() [L77] ep13 = __VERIFIER_nondet_bool() [L78] ep21 = __VERIFIER_nondet_bool() [L79] ep23 = __VERIFIER_nondet_bool() [L80] ep31 = __VERIFIER_nondet_bool() [L81] ep32 = __VERIFIER_nondet_bool() [L82] id1 = __VERIFIER_nondet_char() [L83] r1 = __VERIFIER_nondet_char() [L84] st1 = __VERIFIER_nondet_char() [L85] nl1 = __VERIFIER_nondet_char() [L86] m1 = __VERIFIER_nondet_char() [L87] max1 = __VERIFIER_nondet_char() [L88] mode1 = __VERIFIER_nondet_bool() [L89] id2 = __VERIFIER_nondet_char() [L90] r2 = __VERIFIER_nondet_char() [L91] st2 = __VERIFIER_nondet_char() [L92] nl2 = __VERIFIER_nondet_char() [L93] m2 = __VERIFIER_nondet_char() [L94] max2 = __VERIFIER_nondet_char() [L95] mode2 = __VERIFIER_nondet_bool() [L96] id3 = __VERIFIER_nondet_char() [L97] r3 = __VERIFIER_nondet_char() [L98] st3 = __VERIFIER_nondet_char() [L99] nl3 = __VERIFIER_nondet_char() [L100] m3 = __VERIFIER_nondet_char() [L101] max3 = __VERIFIER_nondet_char() [L102] mode3 = __VERIFIER_nondet_bool() [L104] _Bool init__r121; [L105] _Bool init__r131; [L106] _Bool init__r211; [L107] _Bool init__r231; [L108] _Bool init__r311; [L109] _Bool init__r321; [L110] _Bool init__r122; [L111] int init__tmp; [L112] _Bool init__r132; [L113] int init__tmp___0; [L114] _Bool init__r212; [L115] int init__tmp___1; [L116] _Bool init__r232; [L117] int init__tmp___2; [L118] _Bool init__r312; [L119] int init__tmp___3; [L120] _Bool init__r322; [L121] int init__tmp___4; [L122] int init__tmp___5; [L123] init__r121 = ep12 [L124] init__r131 = ep13 [L125] init__r211 = ep21 [L126] init__r231 = ep23 [L127] init__r311 = ep31 [L128] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L129] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1798] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1800] COND TRUE !(ep32 == 0) [L1802] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L133] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L134] COND TRUE !(init__r131 == 0) [L136] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L139] COND TRUE !(init__r211 == 0) [L141] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1729] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1731] COND TRUE !(ep13 == 0) [L1733] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L149] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1706] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1708] COND TRUE !(ep21 == 0) [L1710] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L154] COND TRUE !(init__r321 == 0) [L156] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L161] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)mode3) == 0 [L213] init__tmp___5 = 1 [L214] __return_1131 = init__tmp___5 [L215] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE main__i2 != 0 [L218] p12_old = nomsg [L219] p12_new = nomsg [L220] p13_old = nomsg [L221] p13_new = nomsg [L222] p21_old = nomsg [L223] p21_new = nomsg [L224] p23_old = nomsg [L225] p23_new = nomsg [L226] p31_old = nomsg [L227] p31_new = nomsg [L228] p32_old = nomsg [L229] p32_new = nomsg [L230] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L234] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L240] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L242] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE !(ep13 == 0) [L255] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND TRUE p13_new == nomsg [L260] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L262] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND TRUE !(ep21 == 0) [L276] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] COND TRUE p21_new == nomsg [L281] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L283] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L285] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L296] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L298] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L304] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L306] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L317] COND TRUE !(ep32 == 0) [L319] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L322] COND TRUE p32_new == nomsg [L324] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, 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] [L326] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=0, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L328] mode3 = 1 [L329] p12_old = p12_new [L330] p12_new = nomsg [L331] p13_old = p13_new [L332] p13_new = nomsg [L333] p21_old = p21_new [L334] p21_new = nomsg [L335] p23_old = p23_new [L336] p23_new = nomsg [L337] p31_old = p31_new [L338] p31_new = nomsg [L339] p32_old = p32_new [L340] p32_new = nomsg [L342] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L349] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L351] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L367] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((int)r1) < 2 [L371] check__tmp = 1 [L372] __return_1259 = check__tmp [L373] main__c1 = __return_1259 [L375] _Bool __tmp_1; [L376] __tmp_1 = main__c1 [L377] _Bool assert__arg; [L378] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L379] COND FALSE !(assert__arg == 0) [L385] int main____CPAchecker_TMP_0 = main__i2; [L386] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE !(mode1 == 0) [L392] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE !(ep21 == 0) [L395] m1 = p21_old [L396] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L411] COND TRUE ((int)max1) == ((int)id1) [L413] st1 = 1 [L414] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L416] COND TRUE !(mode2 == 0) [L418] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L419] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L427] COND TRUE !(ep32 == 0) [L429] m2 = p32_old [L430] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L431] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L435] COND FALSE !(((int)r2) == 2) [L441] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L443] COND TRUE !(mode3 == 0) [L445] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L446] COND TRUE !(ep13 == 0) [L448] m3 = p13_old [L449] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=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] [L450] COND TRUE ((int)m3) > ((int)max3) [L452] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=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] [L454] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=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] [L462] COND FALSE !(((int)r3) == 2) [L468] mode3 = 0 [L469] p12_old = p12_new [L470] p12_new = nomsg [L471] p13_old = p13_new [L472] p13_new = nomsg [L473] p21_old = p21_new [L474] p21_new = nomsg [L475] p23_old = p23_new [L476] p23_new = nomsg [L477] p31_old = p31_new [L478] p31_new = nomsg [L479] p32_old = p32_new [L480] p32_new = nomsg [L482] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L483] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L485] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L487] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L489] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L491] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L503] check__tmp = 0 [L504] __return_1679 = check__tmp [L505] main__c1 = __return_1679 [L507] _Bool __tmp_2; [L508] __tmp_2 = main__c1 [L509] _Bool assert__arg; [L510] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L513] __VERIFIER_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=126, id3=0, m1=126, m2=0, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 237 locations, 2 error locations. UNSAFE Result, 24.0s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9049 SDtfs, 8888 SDslu, 11549 SDs, 0 SdLazy, 2369 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5358occurred in iteration=12, 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: 4.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 9782 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 814461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...