./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-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_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:06:50,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 20:06:50,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 20:06:50,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 20:06:50,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 20:06:50,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 20:06:50,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 20:06:50,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 20:06:50,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 20:06:50,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 20:06:50,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 20:06:50,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 20:06:50,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 20:06:50,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 20:06:50,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 20:06:50,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 20:06:50,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 20:06:50,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 20:06:50,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 20:06:50,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 20:06:50,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 20:06:50,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 20:06:50,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 20:06:50,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 20:06:50,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 20:06:50,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 20:06:50,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 20:06:50,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 20:06:50,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 20:06:50,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 20:06:50,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 20:06:50,193 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 20:06:50,193 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 20:06:50,193 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 20:06:50,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 20:06:50,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 20:06:50,196 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 20:06:50,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 20:06:50,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 20:06:50,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 20:06:50,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 20:06:50,214 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 20:06:50,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 20:06:50,214 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 20:06:50,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 20:06:50,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 20:06:50,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 20:06:50,217 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 20:06:50,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 20:06:50,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 20:06:50,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 20:06:50,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 20:06:50,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 20:06:50,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 20:06:50,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 20:06:50,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 20:06:50,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 20:06:50,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 20:06:50,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 20:06:50,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 20:06:50,221 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 -> e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e [2019-01-12 20:06:50,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 20:06:50,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 20:06:50,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 20:06:50,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 20:06:50,274 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 20:06:50,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 20:06:50,329 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658dd8793/e400accf969740a5b850483e8587255c/FLAG0f717f0c2 [2019-01-12 20:06:50,824 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 20:06:50,827 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 20:06:50,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658dd8793/e400accf969740a5b850483e8587255c/FLAG0f717f0c2 [2019-01-12 20:06:51,113 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658dd8793/e400accf969740a5b850483e8587255c [2019-01-12 20:06:51,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 20:06:51,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 20:06:51,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 20:06:51,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 20:06:51,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 20:06:51,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:51,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5492b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51, skipping insertion in model container [2019-01-12 20:06:51,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:51,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 20:06:51,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 20:06:51,615 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:06:51,639 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 20:06:51,774 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:06:51,879 INFO L195 MainTranslator]: Completed translation [2019-01-12 20:06:51,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51 WrapperNode [2019-01-12 20:06:51,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 20:06:51,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 20:06:51,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 20:06:51,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 20:06:51,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:51,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 20:06:52,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 20:06:52,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 20:06:52,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 20:06:52,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (1/1) ... [2019-01-12 20:06:52,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 20:06:52,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 20:06:52,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 20:06:52,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 20:06:52,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (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 20:06:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 20:06:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 20:06:54,201 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 20:06:54,202 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 20:06:54,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:06:54 BoogieIcfgContainer [2019-01-12 20:06:54,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 20:06:54,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 20:06:54,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 20:06:54,209 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 20:06:54,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:06:51" (1/3) ... [2019-01-12 20:06:54,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66753e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:06:54, skipping insertion in model container [2019-01-12 20:06:54,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:06:51" (2/3) ... [2019-01-12 20:06:54,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66753e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:06:54, skipping insertion in model container [2019-01-12 20:06:54,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:06:54" (3/3) ... [2019-01-12 20:06:54,213 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 20:06:54,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 20:06:54,231 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 20:06:54,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 20:06:54,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 20:06:54,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 20:06:54,288 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 20:06:54,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 20:06:54,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 20:06:54,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 20:06:54,289 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 20:06:54,289 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 20:06:54,289 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 20:06:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-01-12 20:06:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 20:06:54,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:54,329 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 20:06:54,332 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2019-01-12 20:06:54,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:54,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:54,801 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 20:06:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:54,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:06:54,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:06:54,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:06:54,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:06:54,828 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 3 states. [2019-01-12 20:06:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:55,150 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2019-01-12 20:06:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:06:55,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 20:06:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:55,174 INFO L225 Difference]: With dead ends: 482 [2019-01-12 20:06:55,174 INFO L226 Difference]: Without dead ends: 358 [2019-01-12 20:06:55,177 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 20:06:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-12 20:06:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-01-12 20:06:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-12 20:06:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2019-01-12 20:06:55,254 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2019-01-12 20:06:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:55,255 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2019-01-12 20:06:55,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:06:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2019-01-12 20:06:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 20:06:55,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:55,260 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 20:06:55,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2019-01-12 20:06:55,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:55,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:55,705 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 20:06:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:06:55,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:06:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:06:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:06:55,709 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand 4 states. [2019-01-12 20:06:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:55,993 INFO L93 Difference]: Finished difference Result 1034 states and 1572 transitions. [2019-01-12 20:06:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:06:55,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 20:06:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:56,003 INFO L225 Difference]: With dead ends: 1034 [2019-01-12 20:06:56,004 INFO L226 Difference]: Without dead ends: 687 [2019-01-12 20:06:56,007 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 20:06:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-01-12 20:06:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-01-12 20:06:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-01-12 20:06:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1034 transitions. [2019-01-12 20:06:56,107 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1034 transitions. Word has length 100 [2019-01-12 20:06:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:56,107 INFO L480 AbstractCegarLoop]: Abstraction has 685 states and 1034 transitions. [2019-01-12 20:06:56,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:06:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1034 transitions. [2019-01-12 20:06:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 20:06:56,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:56,123 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 20:06:56,123 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2019-01-12 20:06:56,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:56,259 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 20:06:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:56,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:06:56,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:06:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:06:56,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:06:56,261 INFO L87 Difference]: Start difference. First operand 685 states and 1034 transitions. Second operand 3 states. [2019-01-12 20:06:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:56,394 INFO L93 Difference]: Finished difference Result 2017 states and 3040 transitions. [2019-01-12 20:06:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:06:56,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 20:06:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:56,408 INFO L225 Difference]: With dead ends: 2017 [2019-01-12 20:06:56,409 INFO L226 Difference]: Without dead ends: 1360 [2019-01-12 20:06:56,412 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 20:06:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-01-12 20:06:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 687. [2019-01-12 20:06:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-01-12 20:06:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1036 transitions. [2019-01-12 20:06:56,480 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1036 transitions. Word has length 101 [2019-01-12 20:06:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:56,481 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 1036 transitions. [2019-01-12 20:06:56,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:06:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1036 transitions. [2019-01-12 20:06:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 20:06:56,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:56,491 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] [2019-01-12 20:06:56,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2019-01-12 20:06:56,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:56,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:56,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:56,683 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 20:06:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:06:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:06:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:06:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:06:56,686 INFO L87 Difference]: Start difference. First operand 687 states and 1036 transitions. Second operand 3 states. [2019-01-12 20:06:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:57,023 INFO L93 Difference]: Finished difference Result 1818 states and 2761 transitions. [2019-01-12 20:06:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:06:57,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 20:06:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:57,033 INFO L225 Difference]: With dead ends: 1818 [2019-01-12 20:06:57,034 INFO L226 Difference]: Without dead ends: 1326 [2019-01-12 20:06:57,035 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 20:06:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-01-12 20:06:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2019-01-12 20:06:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-01-12 20:06:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1979 transitions. [2019-01-12 20:06:57,142 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1979 transitions. Word has length 102 [2019-01-12 20:06:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:57,142 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1979 transitions. [2019-01-12 20:06:57,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:06:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1979 transitions. [2019-01-12 20:06:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 20:06:57,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:57,146 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] [2019-01-12 20:06:57,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:57,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2019-01-12 20:06:57,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:57,337 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 20:06:57,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:57,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:06:57,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:06:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:06:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:06:57,341 INFO L87 Difference]: Start difference. First operand 1324 states and 1979 transitions. Second operand 4 states. [2019-01-12 20:06:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:57,653 INFO L93 Difference]: Finished difference Result 2153 states and 3239 transitions. [2019-01-12 20:06:57,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:06:57,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-12 20:06:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:57,662 INFO L225 Difference]: With dead ends: 2153 [2019-01-12 20:06:57,662 INFO L226 Difference]: Without dead ends: 1012 [2019-01-12 20:06:57,664 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 20:06:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-01-12 20:06:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2019-01-12 20:06:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-01-12 20:06:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1507 transitions. [2019-01-12 20:06:57,749 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1507 transitions. Word has length 102 [2019-01-12 20:06:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:57,750 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1507 transitions. [2019-01-12 20:06:57,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:06:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1507 transitions. [2019-01-12 20:06:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 20:06:57,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:57,755 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] [2019-01-12 20:06:57,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1659633849, now seen corresponding path program 1 times [2019-01-12 20:06:57,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:57,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:57,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:57,881 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 20:06:57,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:57,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:06:57,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:06:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:06:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:06:57,883 INFO L87 Difference]: Start difference. First operand 1012 states and 1507 transitions. Second operand 3 states. [2019-01-12 20:06:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:58,232 INFO L93 Difference]: Finished difference Result 2287 states and 3527 transitions. [2019-01-12 20:06:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:06:58,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 20:06:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:58,244 INFO L225 Difference]: With dead ends: 2287 [2019-01-12 20:06:58,244 INFO L226 Difference]: Without dead ends: 1460 [2019-01-12 20:06:58,246 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 20:06:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-01-12 20:06:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1428. [2019-01-12 20:06:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-01-12 20:06:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2186 transitions. [2019-01-12 20:06:58,361 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2186 transitions. Word has length 102 [2019-01-12 20:06:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:58,361 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 2186 transitions. [2019-01-12 20:06:58,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:06:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2186 transitions. [2019-01-12 20:06:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 20:06:58,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:58,364 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] [2019-01-12 20:06:58,365 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1296481524, now seen corresponding path program 1 times [2019-01-12 20:06:58,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:58,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:58,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:58,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 20:06:58,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:06:58,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:06:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:06:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:06:58,475 INFO L87 Difference]: Start difference. First operand 1428 states and 2186 transitions. Second operand 3 states. [2019-01-12 20:06:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:06:58,876 INFO L93 Difference]: Finished difference Result 3393 states and 5353 transitions. [2019-01-12 20:06:58,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:06:58,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-12 20:06:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:06:58,889 INFO L225 Difference]: With dead ends: 3393 [2019-01-12 20:06:58,889 INFO L226 Difference]: Without dead ends: 2234 [2019-01-12 20:06:58,892 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 20:06:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-01-12 20:06:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2172. [2019-01-12 20:06:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-01-12 20:06:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3392 transitions. [2019-01-12 20:06:59,078 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3392 transitions. Word has length 104 [2019-01-12 20:06:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:06:59,078 INFO L480 AbstractCegarLoop]: Abstraction has 2172 states and 3392 transitions. [2019-01-12 20:06:59,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:06:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3392 transitions. [2019-01-12 20:06:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 20:06:59,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:06:59,082 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 20:06:59,082 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:06:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:06:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -600271295, now seen corresponding path program 1 times [2019-01-12 20:06:59,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:06:59,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:06:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:59,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:06:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:06:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:06:59,414 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 20:06:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:06:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:06:59,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:06:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:06:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:06:59,419 INFO L87 Difference]: Start difference. First operand 2172 states and 3392 transitions. Second operand 4 states. [2019-01-12 20:07:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:00,301 INFO L93 Difference]: Finished difference Result 5607 states and 8769 transitions. [2019-01-12 20:07:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:00,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-01-12 20:07:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:00,320 INFO L225 Difference]: With dead ends: 5607 [2019-01-12 20:07:00,321 INFO L226 Difference]: Without dead ends: 3454 [2019-01-12 20:07:00,325 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 20:07:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2019-01-12 20:07:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2019-01-12 20:07:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-01-12 20:07:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5357 transitions. [2019-01-12 20:07:00,607 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5357 transitions. Word has length 105 [2019-01-12 20:07:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:00,608 INFO L480 AbstractCegarLoop]: Abstraction has 3452 states and 5357 transitions. [2019-01-12 20:07:00,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5357 transitions. [2019-01-12 20:07:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 20:07:00,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:00,612 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 20:07:00,612 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash -668110988, now seen corresponding path program 1 times [2019-01-12 20:07:00,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:00,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:00,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:00,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:00,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:00,785 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 20:07:00,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:00,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:00,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:00,787 INFO L87 Difference]: Start difference. First operand 3452 states and 5357 transitions. Second operand 4 states. [2019-01-12 20:07:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:01,234 INFO L93 Difference]: Finished difference Result 6107 states and 9506 transitions. [2019-01-12 20:07:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:01,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-01-12 20:07:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:01,253 INFO L225 Difference]: With dead ends: 6107 [2019-01-12 20:07:01,253 INFO L226 Difference]: Without dead ends: 3452 [2019-01-12 20:07:01,258 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 20:07:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2019-01-12 20:07:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2019-01-12 20:07:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-01-12 20:07:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5356 transitions. [2019-01-12 20:07:01,498 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5356 transitions. Word has length 107 [2019-01-12 20:07:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:01,498 INFO L480 AbstractCegarLoop]: Abstraction has 3452 states and 5356 transitions. [2019-01-12 20:07:01,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5356 transitions. [2019-01-12 20:07:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 20:07:01,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:01,501 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 20:07:01,502 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -854881039, now seen corresponding path program 1 times [2019-01-12 20:07:01,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:01,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:01,622 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 20:07:01,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:01,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:01,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:01,623 INFO L87 Difference]: Start difference. First operand 3452 states and 5356 transitions. Second operand 3 states. [2019-01-12 20:07:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:02,433 INFO L93 Difference]: Finished difference Result 8389 states and 13116 transitions. [2019-01-12 20:07:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:02,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-01-12 20:07:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:02,469 INFO L225 Difference]: With dead ends: 8389 [2019-01-12 20:07:02,469 INFO L226 Difference]: Without dead ends: 5309 [2019-01-12 20:07:02,477 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 20:07:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-01-12 20:07:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5307. [2019-01-12 20:07:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2019-01-12 20:07:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 8164 transitions. [2019-01-12 20:07:02,964 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 8164 transitions. Word has length 107 [2019-01-12 20:07:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:02,965 INFO L480 AbstractCegarLoop]: Abstraction has 5307 states and 8164 transitions. [2019-01-12 20:07:02,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 8164 transitions. [2019-01-12 20:07:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 20:07:02,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:02,969 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 20:07:02,970 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 914270762, now seen corresponding path program 1 times [2019-01-12 20:07:02,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:02,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:03,074 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 20:07:03,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:03,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:03,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:03,075 INFO L87 Difference]: Start difference. First operand 5307 states and 8164 transitions. Second operand 3 states. [2019-01-12 20:07:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:03,666 INFO L93 Difference]: Finished difference Result 13931 states and 21827 transitions. [2019-01-12 20:07:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:03,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 20:07:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:03,703 INFO L225 Difference]: With dead ends: 13931 [2019-01-12 20:07:03,703 INFO L226 Difference]: Without dead ends: 8961 [2019-01-12 20:07:03,711 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 20:07:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-01-12 20:07:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8679. [2019-01-12 20:07:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-01-12 20:07:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 13555 transitions. [2019-01-12 20:07:04,188 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 13555 transitions. Word has length 109 [2019-01-12 20:07:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:04,189 INFO L480 AbstractCegarLoop]: Abstraction has 8679 states and 13555 transitions. [2019-01-12 20:07:04,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 13555 transitions. [2019-01-12 20:07:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 20:07:04,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:04,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:04,192 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1141316501, now seen corresponding path program 1 times [2019-01-12 20:07:04,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:04,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:04,494 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 20:07:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:04,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:04,496 INFO L87 Difference]: Start difference. First operand 8679 states and 13555 transitions. Second operand 4 states. [2019-01-12 20:07:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:05,763 INFO L93 Difference]: Finished difference Result 24201 states and 37733 transitions. [2019-01-12 20:07:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:05,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-01-12 20:07:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:05,803 INFO L225 Difference]: With dead ends: 24201 [2019-01-12 20:07:05,803 INFO L226 Difference]: Without dead ends: 15561 [2019-01-12 20:07:05,815 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 20:07:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2019-01-12 20:07:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 15559. [2019-01-12 20:07:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-01-12 20:07:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24025 transitions. [2019-01-12 20:07:07,427 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24025 transitions. Word has length 110 [2019-01-12 20:07:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:07,427 INFO L480 AbstractCegarLoop]: Abstraction has 15559 states and 24025 transitions. [2019-01-12 20:07:07,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24025 transitions. [2019-01-12 20:07:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 20:07:07,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:07,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:07,434 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1423961921, now seen corresponding path program 1 times [2019-01-12 20:07:07,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:07,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:07,513 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 20:07:07,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:07,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:07,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:07,515 INFO L87 Difference]: Start difference. First operand 15559 states and 24025 transitions. Second operand 3 states. [2019-01-12 20:07:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:09,282 INFO L93 Difference]: Finished difference Result 46483 states and 71824 transitions. [2019-01-12 20:07:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:09,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-12 20:07:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:09,351 INFO L225 Difference]: With dead ends: 46483 [2019-01-12 20:07:09,351 INFO L226 Difference]: Without dead ends: 31030 [2019-01-12 20:07:09,374 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 20:07:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31030 states. [2019-01-12 20:07:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31030 to 15565. [2019-01-12 20:07:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15565 states. [2019-01-12 20:07:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15565 states to 15565 states and 24031 transitions. [2019-01-12 20:07:10,965 INFO L78 Accepts]: Start accepts. Automaton has 15565 states and 24031 transitions. Word has length 111 [2019-01-12 20:07:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:10,965 INFO L480 AbstractCegarLoop]: Abstraction has 15565 states and 24031 transitions. [2019-01-12 20:07:10,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15565 states and 24031 transitions. [2019-01-12 20:07:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 20:07:10,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:10,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:10,970 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:10,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash 396960300, now seen corresponding path program 1 times [2019-01-12 20:07:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:11,125 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 20:07:11,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:11,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:11,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:11,128 INFO L87 Difference]: Start difference. First operand 15565 states and 24031 transitions. Second operand 4 states. [2019-01-12 20:07:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:11,955 INFO L93 Difference]: Finished difference Result 31092 states and 48010 transitions. [2019-01-12 20:07:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:11,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 20:07:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:11,988 INFO L225 Difference]: With dead ends: 31092 [2019-01-12 20:07:11,988 INFO L226 Difference]: Without dead ends: 15559 [2019-01-12 20:07:12,010 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 20:07:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2019-01-12 20:07:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15559. [2019-01-12 20:07:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-01-12 20:07:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24019 transitions. [2019-01-12 20:07:13,281 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24019 transitions. Word has length 112 [2019-01-12 20:07:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:13,281 INFO L480 AbstractCegarLoop]: Abstraction has 15559 states and 24019 transitions. [2019-01-12 20:07:13,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24019 transitions. [2019-01-12 20:07:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 20:07:13,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:13,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:13,288 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1369855469, now seen corresponding path program 1 times [2019-01-12 20:07:13,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:13,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:13,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:13,409 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 20:07:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:13,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:13,410 INFO L87 Difference]: Start difference. First operand 15559 states and 24019 transitions. Second operand 3 states. [2019-01-12 20:07:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:16,004 INFO L93 Difference]: Finished difference Result 37293 states and 57686 transitions. [2019-01-12 20:07:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:16,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-01-12 20:07:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:16,037 INFO L225 Difference]: With dead ends: 37293 [2019-01-12 20:07:16,037 INFO L226 Difference]: Without dead ends: 22483 [2019-01-12 20:07:16,059 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 20:07:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2019-01-12 20:07:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 22481. [2019-01-12 20:07:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22481 states. [2019-01-12 20:07:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22481 states to 22481 states and 34190 transitions. [2019-01-12 20:07:17,608 INFO L78 Accepts]: Start accepts. Automaton has 22481 states and 34190 transitions. Word has length 112 [2019-01-12 20:07:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:17,608 INFO L480 AbstractCegarLoop]: Abstraction has 22481 states and 34190 transitions. [2019-01-12 20:07:17,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 22481 states and 34190 transitions. [2019-01-12 20:07:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:17,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:17,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:17,615 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash -114669100, now seen corresponding path program 1 times [2019-01-12 20:07:17,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:17,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:17,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:17,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:17,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:17,721 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 20:07:17,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:17,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:17,724 INFO L87 Difference]: Start difference. First operand 22481 states and 34190 transitions. Second operand 3 states. [2019-01-12 20:07:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:20,509 INFO L93 Difference]: Finished difference Result 61637 states and 95608 transitions. [2019-01-12 20:07:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:20,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-12 20:07:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:20,562 INFO L225 Difference]: With dead ends: 61637 [2019-01-12 20:07:20,562 INFO L226 Difference]: Without dead ends: 42059 [2019-01-12 20:07:20,580 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 20:07:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42059 states. [2019-01-12 20:07:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42059 to 41973. [2019-01-12 20:07:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-01-12 20:07:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63782 transitions. [2019-01-12 20:07:23,287 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63782 transitions. Word has length 115 [2019-01-12 20:07:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:23,288 INFO L480 AbstractCegarLoop]: Abstraction has 41973 states and 63782 transitions. [2019-01-12 20:07:23,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63782 transitions. [2019-01-12 20:07:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:23,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:23,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:23,293 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:23,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:23,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1641098498, now seen corresponding path program 1 times [2019-01-12 20:07:23,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:23,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:23,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:23,636 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 20:07:23,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:23,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:07:23,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:07:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:07:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:23,639 INFO L87 Difference]: Start difference. First operand 41973 states and 63782 transitions. Second operand 5 states. [2019-01-12 20:07:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:27,585 INFO L93 Difference]: Finished difference Result 81591 states and 124774 transitions. [2019-01-12 20:07:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:27,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-01-12 20:07:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:27,634 INFO L225 Difference]: With dead ends: 81591 [2019-01-12 20:07:27,634 INFO L226 Difference]: Without dead ends: 41975 [2019-01-12 20:07:27,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 20:07:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41975 states. [2019-01-12 20:07:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41975 to 41973. [2019-01-12 20:07:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-01-12 20:07:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63590 transitions. [2019-01-12 20:07:30,520 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63590 transitions. Word has length 115 [2019-01-12 20:07:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:30,520 INFO L480 AbstractCegarLoop]: Abstraction has 41973 states and 63590 transitions. [2019-01-12 20:07:30,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:07:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63590 transitions. [2019-01-12 20:07:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:30,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:30,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:30,525 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 823040093, now seen corresponding path program 1 times [2019-01-12 20:07:30,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:30,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:30,829 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 20:07:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:07:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 20:07:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 20:07:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 20:07:30,831 INFO L87 Difference]: Start difference. First operand 41973 states and 63590 transitions. Second operand 6 states. [2019-01-12 20:07:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:39,408 INFO L93 Difference]: Finished difference Result 158117 states and 241003 transitions. [2019-01-12 20:07:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:07:39,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-01-12 20:07:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:39,604 INFO L225 Difference]: With dead ends: 158117 [2019-01-12 20:07:39,604 INFO L226 Difference]: Without dead ends: 120065 [2019-01-12 20:07:39,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 20:07:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120065 states. [2019-01-12 20:07:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120065 to 120061. [2019-01-12 20:07:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120061 states. [2019-01-12 20:07:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120061 states to 120061 states and 182620 transitions. [2019-01-12 20:07:48,468 INFO L78 Accepts]: Start accepts. Automaton has 120061 states and 182620 transitions. Word has length 115 [2019-01-12 20:07:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:48,468 INFO L480 AbstractCegarLoop]: Abstraction has 120061 states and 182620 transitions. [2019-01-12 20:07:48,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 20:07:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 120061 states and 182620 transitions. [2019-01-12 20:07:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:48,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:48,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:48,475 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash 452099970, now seen corresponding path program 1 times [2019-01-12 20:07:48,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:48,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:48,748 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 20:07:48,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:48,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:48,750 INFO L87 Difference]: Start difference. First operand 120061 states and 182620 transitions. Second operand 4 states. [2019-01-12 20:07:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:59,609 INFO L93 Difference]: Finished difference Result 231119 states and 351418 transitions. [2019-01-12 20:07:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:59,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-12 20:07:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:59,758 INFO L225 Difference]: With dead ends: 231119 [2019-01-12 20:07:59,758 INFO L226 Difference]: Without dead ends: 111362 [2019-01-12 20:07:59,817 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 20:07:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111362 states. [2019-01-12 20:08:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111362 to 111320. [2019-01-12 20:08:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111320 states. [2019-01-12 20:08:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111320 states to 111320 states and 169093 transitions. [2019-01-12 20:08:07,858 INFO L78 Accepts]: Start accepts. Automaton has 111320 states and 169093 transitions. Word has length 115 [2019-01-12 20:08:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:07,858 INFO L480 AbstractCegarLoop]: Abstraction has 111320 states and 169093 transitions. [2019-01-12 20:08:07,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111320 states and 169093 transitions. [2019-01-12 20:08:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 20:08:07,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:07,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:07,863 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 630278213, now seen corresponding path program 1 times [2019-01-12 20:08:07,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:07,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:08,037 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 20:08:08,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:08,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:08,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:08,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:08,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:08,038 INFO L87 Difference]: Start difference. First operand 111320 states and 169093 transitions. Second operand 4 states. [2019-01-12 20:08:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:17,087 INFO L93 Difference]: Finished difference Result 222648 states and 338190 transitions. [2019-01-12 20:08:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:17,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 20:08:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:17,240 INFO L225 Difference]: With dead ends: 222648 [2019-01-12 20:08:17,240 INFO L226 Difference]: Without dead ends: 111485 [2019-01-12 20:08:17,296 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 20:08:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111485 states. [2019-01-12 20:08:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111485 to 111423. [2019-01-12 20:08:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111423 states. [2019-01-12 20:08:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111423 states to 111423 states and 169199 transitions. [2019-01-12 20:08:25,872 INFO L78 Accepts]: Start accepts. Automaton has 111423 states and 169199 transitions. Word has length 117 [2019-01-12 20:08:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:25,872 INFO L480 AbstractCegarLoop]: Abstraction has 111423 states and 169199 transitions. [2019-01-12 20:08:25,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 111423 states and 169199 transitions. [2019-01-12 20:08:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 20:08:25,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:25,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:25,877 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 856369869, now seen corresponding path program 1 times [2019-01-12 20:08:25,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:25,944 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 20:08:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:25,945 INFO L87 Difference]: Start difference. First operand 111423 states and 169199 transitions. Second operand 3 states. [2019-01-12 20:08:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:42,657 INFO L93 Difference]: Finished difference Result 305539 states and 463991 transitions. [2019-01-12 20:08:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:42,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-01-12 20:08:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:42,983 INFO L225 Difference]: With dead ends: 305539 [2019-01-12 20:08:42,983 INFO L226 Difference]: Without dead ends: 222636 [2019-01-12 20:08:43,047 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 20:08:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222636 states. [2019-01-12 20:08:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222636 to 111433. [2019-01-12 20:08:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111433 states. [2019-01-12 20:08:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111433 states to 111433 states and 169209 transitions. [2019-01-12 20:08:56,679 INFO L78 Accepts]: Start accepts. Automaton has 111433 states and 169209 transitions. Word has length 118 [2019-01-12 20:08:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:56,680 INFO L480 AbstractCegarLoop]: Abstraction has 111433 states and 169209 transitions. [2019-01-12 20:08:56,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 111433 states and 169209 transitions. [2019-01-12 20:08:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 20:08:56,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:56,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:56,685 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1613219331, now seen corresponding path program 1 times [2019-01-12 20:08:56,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:56,880 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 20:08:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:56,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:56,882 INFO L87 Difference]: Start difference. First operand 111433 states and 169209 transitions. Second operand 4 states. [2019-01-12 20:09:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:07,409 INFO L93 Difference]: Finished difference Result 223001 states and 338560 transitions. [2019-01-12 20:09:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:07,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-12 20:09:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:07,567 INFO L225 Difference]: With dead ends: 223001 [2019-01-12 20:09:07,567 INFO L226 Difference]: Without dead ends: 111841 [2019-01-12 20:09:07,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 20:09:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111841 states. [2019-01-12 20:09:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111841 to 111684. [2019-01-12 20:09:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111684 states. [2019-01-12 20:09:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111684 states to 111684 states and 169465 transitions. [2019-01-12 20:09:17,921 INFO L78 Accepts]: Start accepts. Automaton has 111684 states and 169465 transitions. Word has length 119 [2019-01-12 20:09:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:17,921 INFO L480 AbstractCegarLoop]: Abstraction has 111684 states and 169465 transitions. [2019-01-12 20:09:17,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 111684 states and 169465 transitions. [2019-01-12 20:09:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 20:09:17,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:17,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:09:17,927 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash 88340068, now seen corresponding path program 1 times [2019-01-12 20:09:17,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:17,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:17,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:18,085 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 20:09:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:18,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:18,087 INFO L87 Difference]: Start difference. First operand 111684 states and 169465 transitions. Second operand 4 states. [2019-01-12 20:09:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:27,289 INFO L93 Difference]: Finished difference Result 163639 states and 247980 transitions. [2019-01-12 20:09:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:27,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-12 20:09:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:27,439 INFO L225 Difference]: With dead ends: 163639 [2019-01-12 20:09:27,439 INFO L226 Difference]: Without dead ends: 102848 [2019-01-12 20:09:27,485 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 20:09:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102848 states. [2019-01-12 20:09:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102848 to 102848. [2019-01-12 20:09:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102848 states. [2019-01-12 20:09:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102848 states to 102848 states and 155959 transitions. [2019-01-12 20:09:37,098 INFO L78 Accepts]: Start accepts. Automaton has 102848 states and 155959 transitions. Word has length 119 [2019-01-12 20:09:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:37,098 INFO L480 AbstractCegarLoop]: Abstraction has 102848 states and 155959 transitions. [2019-01-12 20:09:37,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 102848 states and 155959 transitions. [2019-01-12 20:09:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 20:09:37,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:37,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:09:37,103 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -775506488, now seen corresponding path program 1 times [2019-01-12 20:09:37,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:37,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:37,387 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 20:09:37,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:37,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:37,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:09:37,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:09:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:37,388 INFO L87 Difference]: Start difference. First operand 102848 states and 155959 transitions. Second operand 5 states. [2019-01-12 20:09:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:48,378 INFO L93 Difference]: Finished difference Result 204448 states and 310514 transitions. [2019-01-12 20:09:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:09:48,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-01-12 20:09:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:48,527 INFO L225 Difference]: With dead ends: 204448 [2019-01-12 20:09:48,528 INFO L226 Difference]: Without dead ends: 102848 [2019-01-12 20:09:48,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 20:09:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102848 states. [2019-01-12 20:10:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102848 to 102848. [2019-01-12 20:10:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102848 states. [2019-01-12 20:10:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102848 states to 102848 states and 154685 transitions. [2019-01-12 20:10:01,549 INFO L78 Accepts]: Start accepts. Automaton has 102848 states and 154685 transitions. Word has length 121 [2019-01-12 20:10:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:10:01,550 INFO L480 AbstractCegarLoop]: Abstraction has 102848 states and 154685 transitions. [2019-01-12 20:10:01,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:10:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 102848 states and 154685 transitions. [2019-01-12 20:10:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 20:10:01,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:10:01,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:10:01,556 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:10:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:10:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 302450541, now seen corresponding path program 1 times [2019-01-12 20:10:01,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:10:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:10:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:01,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:10:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:10:01,858 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2019-01-12 20:10:02,334 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-01-12 20:10:03,220 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 20:10:03,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:10:03,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 20:10:03,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 20:10:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 20:10:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-01-12 20:10:03,221 INFO L87 Difference]: Start difference. First operand 102848 states and 154685 transitions. Second operand 22 states. [2019-01-12 20:10:03,824 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-12 20:10:04,127 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 20:10:04,356 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 20:10:04,766 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-12 20:10:05,017 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-12 20:10:05,542 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-12 20:10:05,865 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-12 20:10:06,104 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 20:10:06,429 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 20:10:06,668 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-12 20:10:07,168 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 20:10:07,537 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-12 20:10:07,922 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 20:10:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:10:35,100 INFO L93 Difference]: Finished difference Result 261413 states and 393928 transitions. [2019-01-12 20:10:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 20:10:35,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2019-01-12 20:10:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:10:35,418 INFO L225 Difference]: With dead ends: 261413 [2019-01-12 20:10:35,418 INFO L226 Difference]: Without dead ends: 216601 [2019-01-12 20:10:35,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 20:10:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216601 states. [2019-01-12 20:10:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216601 to 103402. [2019-01-12 20:10:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103402 states. [2019-01-12 20:10:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103402 states to 103402 states and 155322 transitions. [2019-01-12 20:10:49,835 INFO L78 Accepts]: Start accepts. Automaton has 103402 states and 155322 transitions. Word has length 121 [2019-01-12 20:10:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:10:49,835 INFO L480 AbstractCegarLoop]: Abstraction has 103402 states and 155322 transitions. [2019-01-12 20:10:49,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 20:10:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 103402 states and 155322 transitions. [2019-01-12 20:10:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 20:10:49,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:10:49,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:10:49,841 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:10:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:10:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -590053851, now seen corresponding path program 1 times [2019-01-12 20:10:49,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:10:49,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:10:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:49,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:10:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:10:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:10:49,990 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 20:10:50,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:10:50 BoogieIcfgContainer [2019-01-12 20:10:50,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 20:10:50,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 20:10:50,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 20:10:50,242 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 20:10:50,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:06:54" (3/4) ... [2019-01-12 20:10:50,246 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 20:10:50,527 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 20:10:50,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 20:10:50,529 INFO L168 Benchmark]: Toolchain (without parser) took 239410.05 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 951.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,530 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 20:10:50,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.63 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,531 INFO L168 Benchmark]: Boogie Preprocessor took 104.44 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,531 INFO L168 Benchmark]: RCFGBuilder took 2083.09 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: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,532 INFO L168 Benchmark]: TraceAbstraction took 236035.92 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,532 INFO L168 Benchmark]: Witness Printer took 286.87 ms. Allocated memory is still 6.1 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. [2019-01-12 20:10:50,537 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.63 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.44 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2083.09 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: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 236035.92 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 286.87 ms. Allocated memory is still 6.1 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 572]: 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] _Bool newmax1 = 0; [L44] char id2 = '\x0'; [L45] char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] _Bool newmax2 = 0; [L52] char id3 = '\x0'; [L53] char r3 = '\x0'; [L54] char st3 = '\x0'; [L55] char nl3 = '\x0'; [L56] char m3 = '\x0'; [L57] char max3 = '\x0'; [L58] _Bool mode3 = 0; [L59] _Bool newmax3 = 0; [L63] void (*nodes[3])() = { &node1, &node2, &node3 }; [L67] int __return_1237; [L68] int __return_1383; [L69] int __return_1517; [L70] int __tmp_1518_0; [L71] int __return_1641; [L72] int __return_1531; VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_char() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_char() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_char() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L134] COND FALSE !(!(init__r121 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1764] COND TRUE !(init__r131 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1766] COND TRUE !(ep32 == 0) [L1768] init__tmp = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] init__r122 = (_Bool)init__tmp VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L139] COND TRUE !(init__r131 == 0) [L141] init__tmp___0 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] init__r132 = (_Bool)init__tmp___0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L144] COND TRUE !(init__r211 == 0) [L146] init__tmp___1 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] init__r212 = (_Bool)init__tmp___1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L149] COND FALSE !(!(init__r231 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1695] COND TRUE !(init__r211 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1697] COND TRUE !(ep13 == 0) [L1699] init__tmp___2 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] init__r232 = (_Bool)init__tmp___2 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L154] COND FALSE !(!(init__r311 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1672] COND TRUE !(init__r321 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1674] COND TRUE !(ep21 == 0) [L1676] init__tmp___3 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] init__r312 = (_Bool)init__tmp___3 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND TRUE !(init__r321 == 0) [L161] init__tmp___4 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1237 = init__tmp___5 [L226] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L242] COND TRUE main__i2 < 6 [L245] _Bool node1__newmax; [L246] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(ep13 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND TRUE !(newmax1 == 0) [L272] int node1____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L275] COND TRUE p13_new == nomsg [L277] node1____CPAchecker_TMP_1 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L281] mode1 = 1 [L283] _Bool node2__newmax; [L284] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, 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] [L285] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, 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] [L291] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] COND TRUE !(ep21 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] COND TRUE !(newmax2 == 0) [L297] int node2____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, 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] [L298] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L300] COND TRUE p21_new == nomsg [L302] node2____CPAchecker_TMP_0 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, 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] [L304] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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 !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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] [L319] mode2 = 1 [L321] _Bool node3__newmax; [L322] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L323] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L331] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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] [L344] COND TRUE !(ep32 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE !(newmax3 == 0) [L348] int node3____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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] [L349] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L351] COND TRUE p32_new == nomsg [L353] node3____CPAchecker_TMP_1 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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] [L355] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=125, p13_old=-1, p21=0, p21_new=124, 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] [L357] mode3 = 1 [L358] p12_old = p12_new [L359] p12_new = nomsg [L360] p13_old = p13_new [L361] p13_new = nomsg [L362] p21_old = p21_new [L363] p21_new = nomsg [L364] p23_old = p23_new [L365] p23_new = nomsg [L366] p31_old = p31_new [L367] p31_new = nomsg [L368] p32_old = p32_new [L369] p32_new = nomsg [L371] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L372] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L374] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L376] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L378] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L380] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L388] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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 FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L396] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L398] COND TRUE ((int)r1) < 2 [L400] check__tmp = 1 [L401] __return_1383 = check__tmp [L402] main__c1 = __return_1383 [L404] _Bool __tmp_1; [L405] __tmp_1 = main__c1 [L406] _Bool assert__arg; [L407] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L408] COND FALSE !(assert__arg == 0) [L414] int main____CPAchecker_TMP_0 = main__i2; [L415] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L416] COND TRUE main__i2 < 6 [L419] _Bool node1__newmax; [L420] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L421] COND TRUE !(mode1 == 0) [L423] r1 = (char)(((int)r1) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=0, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=124, 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] [L424] COND TRUE !(ep21 == 0) [L426] m1 = p21_old [L427] p21_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L428] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L433] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L442] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L443] COND TRUE ((int)r1) == 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L449] mode1 = 0 [L451] _Bool node2__newmax; [L452] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L453] COND TRUE !(mode2 == 0) [L455] r2 = (char)(((int)r2) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L456] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L465] COND TRUE !(ep32 == 0) [L467] m2 = p32_old [L468] p32_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L469] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L474] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L475] COND FALSE !(((int)r2) == 2) [L481] mode2 = 0 [L483] _Bool node3__newmax; [L484] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L485] COND TRUE !(mode3 == 0) [L487] r3 = (char)(((int)r3) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=0, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L488] COND TRUE !(ep13 == 0) [L490] m3 = p13_old [L491] p13_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L492] COND TRUE ((int)m3) > ((int)max3) [L494] max3 = m3 [L495] node3__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L506] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L507] COND FALSE !(((int)r3) == 2) [L513] mode3 = 0 [L514] p12_old = p12_new [L515] p12_new = nomsg [L516] p13_old = p13_new [L517] p13_new = nomsg [L518] p21_old = p21_new [L519] p21_new = nomsg [L520] p23_old = p23_new [L521] p23_new = nomsg [L522] p31_old = p31_new [L523] p31_new = nomsg [L524] p32_old = p32_new [L525] p32_new = nomsg [L527] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L528] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L530] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L532] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L534] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L536] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L542] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1167] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L560] __return_1517 = check__tmp [L561] main__c1 = __return_1517 [L562] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L564] main____CPAchecker_TMP_0 = __tmp_1518_0 [L566] _Bool __tmp_2; [L567] __tmp_2 = main__c1 [L568] _Bool assert__arg; [L569] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L570] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L572] __VERIFIER_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=125, id2=124, id3=0, m1=124, m2=0, m3=125, max1=125, max2=124, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 1 error locations. UNSAFE Result, 235.9s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 128.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12081 SDtfs, 11503 SDslu, 16731 SDs, 0 SdLazy, 3481 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120061occurred in iteration=18, 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: 100.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 241283 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2880 NumberOfCodeBlocks, 2880 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2734 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...