./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer --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-678e011 [2019-11-20 07:14:15,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:14:15,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:14:15,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:14:15,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:14:15,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:14:15,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:14:15,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:14:15,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:14:15,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:14:15,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:14:15,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:14:15,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:14:15,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:14:15,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:14:15,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:14:15,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:14:15,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:14:15,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:14:15,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:14:15,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:14:15,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:14:15,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:14:15,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:14:15,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:14:15,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:14:15,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:14:15,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:14:15,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:14:15,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:14:15,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:14:15,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:14:15,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:14:15,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:14:15,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:14:15,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:14:15,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:14:15,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:14:15,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:14:15,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:14:15,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:14:15,161 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:14:15,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:14:15,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:14:15,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:14:15,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:14:15,204 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:14:15,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:14:15,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:14:15,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:14:15,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:14:15,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:14:15,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:14:15,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:14:15,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:14:15,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:14:15,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:14:15,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:14:15,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:14:15,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:14:15,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:14:15,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:14:15,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:14:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:14:15,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:14:15,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:14:15,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:14:15,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:14:15,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:14:15,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:14:15,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer 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-11-20 07:14:15,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:14:15,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:14:15,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:14:15,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:14:15,439 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:14:15,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 07:14:15,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/data/9a28dce09/26a877c9fe7e48d3bb5002816643b9a2/FLAG3b0e57510 [2019-11-20 07:14:16,072 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:14:16,073 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 07:14:16,086 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/data/9a28dce09/26a877c9fe7e48d3bb5002816643b9a2/FLAG3b0e57510 [2019-11-20 07:14:16,387 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/data/9a28dce09/26a877c9fe7e48d3bb5002816643b9a2 [2019-11-20 07:14:16,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:14:16,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:14:16,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:14:16,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:14:16,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:14:16,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:14:16" (1/1) ... [2019-11-20 07:14:16,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2580638a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:16, skipping insertion in model container [2019-11-20 07:14:16,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:14:16" (1/1) ... [2019-11-20 07:14:16,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:14:16,484 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:14:16,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:14:16,938 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:14:17,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:14:17,121 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:14:17,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17 WrapperNode [2019-11-20 07:14:17,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:14:17,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:14:17,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:14:17,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:14:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:14:17,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:14:17,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:14:17,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:14:17,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... [2019-11-20 07:14:17,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:14:17,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:14:17,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:14:17,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:14:17,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:14:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:14:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:14:18,985 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:14:18,985 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 07:14:18,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:18 BoogieIcfgContainer [2019-11-20 07:14:18,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:14:18,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:14:18,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:14:18,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:14:18,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:14:16" (1/3) ... [2019-11-20 07:14:18,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d427f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:14:18, skipping insertion in model container [2019-11-20 07:14:18,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:17" (2/3) ... [2019-11-20 07:14:18,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d427f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:14:18, skipping insertion in model container [2019-11-20 07:14:18,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:18" (3/3) ... [2019-11-20 07:14:18,996 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 07:14:19,007 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:14:19,015 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:14:19,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:14:19,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:14:19,057 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:14:19,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:14:19,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:14:19,058 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:14:19,058 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:14:19,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:14:19,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:14:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-11-20 07:14:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:14:19,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:19,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:19,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2019-11-20 07:14:19,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:19,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575303142] [2019-11-20 07:14:19,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:19,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575303142] [2019-11-20 07:14:19,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:19,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595524548] [2019-11-20 07:14:19,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:19,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:19,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:19,685 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 3 states. [2019-11-20 07:14:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:19,881 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2019-11-20 07:14:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:19,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 07:14:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:19,909 INFO L225 Difference]: With dead ends: 482 [2019-11-20 07:14:19,911 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 07:14:19,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 07:14:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-20 07:14:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 07:14:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2019-11-20 07:14:20,006 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2019-11-20 07:14:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:20,007 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2019-11-20 07:14:20,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2019-11-20 07:14:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:14:20,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:20,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:20,013 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2019-11-20 07:14:20,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:20,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25808033] [2019-11-20 07:14:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:20,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-11-20 07:14:20,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25808033] [2019-11-20 07:14:20,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:20,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:20,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933038723] [2019-11-20 07:14:20,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:20,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:20,414 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand 4 states. [2019-11-20 07:14:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:20,567 INFO L93 Difference]: Finished difference Result 1034 states and 1572 transitions. [2019-11-20 07:14:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:20,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 07:14:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:20,575 INFO L225 Difference]: With dead ends: 1034 [2019-11-20 07:14:20,575 INFO L226 Difference]: Without dead ends: 687 [2019-11-20 07:14:20,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-20 07:14:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-11-20 07:14:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-20 07:14:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1034 transitions. [2019-11-20 07:14:20,645 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1034 transitions. Word has length 100 [2019-11-20 07:14:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:20,648 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1034 transitions. [2019-11-20 07:14:20,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1034 transitions. [2019-11-20 07:14:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:14:20,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:20,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:20,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2019-11-20 07:14:20,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:20,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666229249] [2019-11-20 07:14:20,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:20,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666229249] [2019-11-20 07:14:20,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:20,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:20,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914606723] [2019-11-20 07:14:20,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:20,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:20,799 INFO L87 Difference]: Start difference. First operand 685 states and 1034 transitions. Second operand 3 states. [2019-11-20 07:14:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:20,873 INFO L93 Difference]: Finished difference Result 2017 states and 3040 transitions. [2019-11-20 07:14:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:20,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 07:14:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:20,889 INFO L225 Difference]: With dead ends: 2017 [2019-11-20 07:14:20,890 INFO L226 Difference]: Without dead ends: 1360 [2019-11-20 07:14:20,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-11-20 07:14:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 687. [2019-11-20 07:14:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-20 07:14:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1036 transitions. [2019-11-20 07:14:20,953 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1036 transitions. Word has length 101 [2019-11-20 07:14:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 1036 transitions. [2019-11-20 07:14:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1036 transitions. [2019-11-20 07:14:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 07:14:20,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:20,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:20,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2019-11-20 07:14:20,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:20,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708842485] [2019-11-20 07:14:20,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:21,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708842485] [2019-11-20 07:14:21,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:21,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520846083] [2019-11-20 07:14:21,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:21,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:21,105 INFO L87 Difference]: Start difference. First operand 687 states and 1036 transitions. Second operand 3 states. [2019-11-20 07:14:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:21,210 INFO L93 Difference]: Finished difference Result 1818 states and 2761 transitions. [2019-11-20 07:14:21,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:21,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 07:14:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:21,219 INFO L225 Difference]: With dead ends: 1818 [2019-11-20 07:14:21,220 INFO L226 Difference]: Without dead ends: 1326 [2019-11-20 07:14:21,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-20 07:14:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2019-11-20 07:14:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-20 07:14:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1979 transitions. [2019-11-20 07:14:21,287 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1979 transitions. Word has length 102 [2019-11-20 07:14:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:21,287 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1979 transitions. [2019-11-20 07:14:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1979 transitions. [2019-11-20 07:14:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 07:14:21,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:21,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:21,290 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2019-11-20 07:14:21,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:21,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866963439] [2019-11-20 07:14:21,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:21,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866963439] [2019-11-20 07:14:21,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:21,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:21,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029439002] [2019-11-20 07:14:21,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:21,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:21,496 INFO L87 Difference]: Start difference. First operand 1324 states and 1979 transitions. Second operand 4 states. [2019-11-20 07:14:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:21,586 INFO L93 Difference]: Finished difference Result 2153 states and 3239 transitions. [2019-11-20 07:14:21,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:21,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 07:14:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:21,594 INFO L225 Difference]: With dead ends: 2153 [2019-11-20 07:14:21,595 INFO L226 Difference]: Without dead ends: 1012 [2019-11-20 07:14:21,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-11-20 07:14:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2019-11-20 07:14:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-11-20 07:14:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1507 transitions. [2019-11-20 07:14:21,658 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1507 transitions. Word has length 102 [2019-11-20 07:14:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:21,659 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1507 transitions. [2019-11-20 07:14:21,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1507 transitions. [2019-11-20 07:14:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 07:14:21,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:21,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:21,662 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1659633849, now seen corresponding path program 1 times [2019-11-20 07:14:21,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069190803] [2019-11-20 07:14:21,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:21,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069190803] [2019-11-20 07:14:21,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:21,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:21,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722616486] [2019-11-20 07:14:21,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:21,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:21,747 INFO L87 Difference]: Start difference. First operand 1012 states and 1507 transitions. Second operand 3 states. [2019-11-20 07:14:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:21,859 INFO L93 Difference]: Finished difference Result 2287 states and 3527 transitions. [2019-11-20 07:14:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:21,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 07:14:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:21,870 INFO L225 Difference]: With dead ends: 2287 [2019-11-20 07:14:21,870 INFO L226 Difference]: Without dead ends: 1460 [2019-11-20 07:14:21,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-20 07:14:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1428. [2019-11-20 07:14:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-20 07:14:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2186 transitions. [2019-11-20 07:14:21,973 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2186 transitions. Word has length 102 [2019-11-20 07:14:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:21,975 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2186 transitions. [2019-11-20 07:14:21,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2186 transitions. [2019-11-20 07:14:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 07:14:21,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:21,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:21,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1296481524, now seen corresponding path program 1 times [2019-11-20 07:14:21,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:21,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844048946] [2019-11-20 07:14:21,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:22,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844048946] [2019-11-20 07:14:22,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:22,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:22,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929310619] [2019-11-20 07:14:22,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:22,105 INFO L87 Difference]: Start difference. First operand 1428 states and 2186 transitions. Second operand 3 states. [2019-11-20 07:14:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:22,269 INFO L93 Difference]: Finished difference Result 3393 states and 5353 transitions. [2019-11-20 07:14:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:22,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 07:14:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:22,284 INFO L225 Difference]: With dead ends: 3393 [2019-11-20 07:14:22,284 INFO L226 Difference]: Without dead ends: 2234 [2019-11-20 07:14:22,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-11-20 07:14:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2172. [2019-11-20 07:14:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-11-20 07:14:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3392 transitions. [2019-11-20 07:14:22,442 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3392 transitions. Word has length 104 [2019-11-20 07:14:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:22,443 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 3392 transitions. [2019-11-20 07:14:22,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3392 transitions. [2019-11-20 07:14:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 07:14:22,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:22,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:22,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -600271295, now seen corresponding path program 1 times [2019-11-20 07:14:22,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:22,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240845783] [2019-11-20 07:14:22,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:22,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240845783] [2019-11-20 07:14:22,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:22,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:22,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220140035] [2019-11-20 07:14:22,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:22,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:22,632 INFO L87 Difference]: Start difference. First operand 2172 states and 3392 transitions. Second operand 4 states. [2019-11-20 07:14:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:22,895 INFO L93 Difference]: Finished difference Result 5607 states and 8769 transitions. [2019-11-20 07:14:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:22,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 07:14:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:22,919 INFO L225 Difference]: With dead ends: 5607 [2019-11-20 07:14:22,920 INFO L226 Difference]: Without dead ends: 3454 [2019-11-20 07:14:22,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2019-11-20 07:14:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2019-11-20 07:14:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-11-20 07:14:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5357 transitions. [2019-11-20 07:14:23,174 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5357 transitions. Word has length 105 [2019-11-20 07:14:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:23,175 INFO L462 AbstractCegarLoop]: Abstraction has 3452 states and 5357 transitions. [2019-11-20 07:14:23,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5357 transitions. [2019-11-20 07:14:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 07:14:23,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:23,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:23,178 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -668110988, now seen corresponding path program 1 times [2019-11-20 07:14:23,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:23,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500440123] [2019-11-20 07:14:23,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:23,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500440123] [2019-11-20 07:14:23,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:23,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:23,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596830667] [2019-11-20 07:14:23,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:23,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:23,362 INFO L87 Difference]: Start difference. First operand 3452 states and 5357 transitions. Second operand 4 states. [2019-11-20 07:14:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:23,567 INFO L93 Difference]: Finished difference Result 6107 states and 9506 transitions. [2019-11-20 07:14:23,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:23,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 07:14:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:23,591 INFO L225 Difference]: With dead ends: 6107 [2019-11-20 07:14:23,592 INFO L226 Difference]: Without dead ends: 3452 [2019-11-20 07:14:23,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2019-11-20 07:14:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2019-11-20 07:14:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-11-20 07:14:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5356 transitions. [2019-11-20 07:14:23,840 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5356 transitions. Word has length 107 [2019-11-20 07:14:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:23,841 INFO L462 AbstractCegarLoop]: Abstraction has 3452 states and 5356 transitions. [2019-11-20 07:14:23,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5356 transitions. [2019-11-20 07:14:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 07:14:23,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:23,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:23,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -854881039, now seen corresponding path program 1 times [2019-11-20 07:14:23,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:23,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376474364] [2019-11-20 07:14:23,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:23,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376474364] [2019-11-20 07:14:23,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:23,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:23,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767245658] [2019-11-20 07:14:23,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:23,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:23,926 INFO L87 Difference]: Start difference. First operand 3452 states and 5356 transitions. Second operand 3 states. [2019-11-20 07:14:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:24,269 INFO L93 Difference]: Finished difference Result 8389 states and 13116 transitions. [2019-11-20 07:14:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:24,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-20 07:14:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:24,303 INFO L225 Difference]: With dead ends: 8389 [2019-11-20 07:14:24,303 INFO L226 Difference]: Without dead ends: 5309 [2019-11-20 07:14:24,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-11-20 07:14:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5307. [2019-11-20 07:14:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2019-11-20 07:14:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 8164 transitions. [2019-11-20 07:14:24,639 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 8164 transitions. Word has length 107 [2019-11-20 07:14:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:24,639 INFO L462 AbstractCegarLoop]: Abstraction has 5307 states and 8164 transitions. [2019-11-20 07:14:24,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 8164 transitions. [2019-11-20 07:14:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 07:14:24,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:24,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:24,643 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 914270762, now seen corresponding path program 1 times [2019-11-20 07:14:24,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:24,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628310405] [2019-11-20 07:14:24,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:24,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628310405] [2019-11-20 07:14:24,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:24,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:24,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496108471] [2019-11-20 07:14:24,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:24,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:24,709 INFO L87 Difference]: Start difference. First operand 5307 states and 8164 transitions. Second operand 3 states. [2019-11-20 07:14:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:25,227 INFO L93 Difference]: Finished difference Result 13931 states and 21827 transitions. [2019-11-20 07:14:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:25,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-20 07:14:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:25,278 INFO L225 Difference]: With dead ends: 13931 [2019-11-20 07:14:25,278 INFO L226 Difference]: Without dead ends: 8961 [2019-11-20 07:14:25,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-11-20 07:14:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8679. [2019-11-20 07:14:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-11-20 07:14:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 13555 transitions. [2019-11-20 07:14:25,925 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 13555 transitions. Word has length 109 [2019-11-20 07:14:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:25,925 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 13555 transitions. [2019-11-20 07:14:25,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 13555 transitions. [2019-11-20 07:14:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 07:14:25,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:25,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:25,930 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1141316501, now seen corresponding path program 1 times [2019-11-20 07:14:25,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:25,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333689929] [2019-11-20 07:14:25,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:26,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333689929] [2019-11-20 07:14:26,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:26,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:26,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220931496] [2019-11-20 07:14:26,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:26,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:26,111 INFO L87 Difference]: Start difference. First operand 8679 states and 13555 transitions. Second operand 4 states. [2019-11-20 07:14:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:27,119 INFO L93 Difference]: Finished difference Result 24201 states and 37733 transitions. [2019-11-20 07:14:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:27,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 07:14:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:27,161 INFO L225 Difference]: With dead ends: 24201 [2019-11-20 07:14:27,161 INFO L226 Difference]: Without dead ends: 15561 [2019-11-20 07:14:27,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2019-11-20 07:14:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 15559. [2019-11-20 07:14:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-11-20 07:14:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24025 transitions. [2019-11-20 07:14:28,175 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24025 transitions. Word has length 110 [2019-11-20 07:14:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:28,176 INFO L462 AbstractCegarLoop]: Abstraction has 15559 states and 24025 transitions. [2019-11-20 07:14:28,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24025 transitions. [2019-11-20 07:14:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 07:14:28,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:28,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:28,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1423961921, now seen corresponding path program 1 times [2019-11-20 07:14:28,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:28,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23119738] [2019-11-20 07:14:28,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:28,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23119738] [2019-11-20 07:14:28,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:28,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:28,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191015631] [2019-11-20 07:14:28,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:28,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:28,242 INFO L87 Difference]: Start difference. First operand 15559 states and 24025 transitions. Second operand 3 states. [2019-11-20 07:14:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:30,257 INFO L93 Difference]: Finished difference Result 46483 states and 71824 transitions. [2019-11-20 07:14:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:30,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-20 07:14:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:30,331 INFO L225 Difference]: With dead ends: 46483 [2019-11-20 07:14:30,331 INFO L226 Difference]: Without dead ends: 31030 [2019-11-20 07:14:30,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31030 states. [2019-11-20 07:14:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31030 to 15565. [2019-11-20 07:14:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15565 states. [2019-11-20 07:14:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15565 states to 15565 states and 24031 transitions. [2019-11-20 07:14:31,526 INFO L78 Accepts]: Start accepts. Automaton has 15565 states and 24031 transitions. Word has length 111 [2019-11-20 07:14:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:31,527 INFO L462 AbstractCegarLoop]: Abstraction has 15565 states and 24031 transitions. [2019-11-20 07:14:31,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15565 states and 24031 transitions. [2019-11-20 07:14:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 07:14:31,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:31,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:31,533 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 396960300, now seen corresponding path program 1 times [2019-11-20 07:14:31,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:31,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626605318] [2019-11-20 07:14:31,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:31,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626605318] [2019-11-20 07:14:31,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:31,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:14:31,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331661394] [2019-11-20 07:14:31,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:14:31,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:14:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:14:31,660 INFO L87 Difference]: Start difference. First operand 15565 states and 24031 transitions. Second operand 4 states. [2019-11-20 07:14:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:32,865 INFO L93 Difference]: Finished difference Result 31092 states and 48010 transitions. [2019-11-20 07:14:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:32,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-20 07:14:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:32,904 INFO L225 Difference]: With dead ends: 31092 [2019-11-20 07:14:32,904 INFO L226 Difference]: Without dead ends: 15559 [2019-11-20 07:14:32,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:14:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2019-11-20 07:14:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15559. [2019-11-20 07:14:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-11-20 07:14:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24019 transitions. [2019-11-20 07:14:33,819 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24019 transitions. Word has length 112 [2019-11-20 07:14:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:33,820 INFO L462 AbstractCegarLoop]: Abstraction has 15559 states and 24019 transitions. [2019-11-20 07:14:33,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:14:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24019 transitions. [2019-11-20 07:14:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 07:14:33,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:33,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:33,826 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1369855469, now seen corresponding path program 1 times [2019-11-20 07:14:33,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:33,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922710020] [2019-11-20 07:14:33,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:33,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922710020] [2019-11-20 07:14:33,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:33,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:33,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314369355] [2019-11-20 07:14:33,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:33,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:33,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:33,914 INFO L87 Difference]: Start difference. First operand 15559 states and 24019 transitions. Second operand 3 states. [2019-11-20 07:14:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:35,125 INFO L93 Difference]: Finished difference Result 37293 states and 57686 transitions. [2019-11-20 07:14:35,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:35,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-20 07:14:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:35,192 INFO L225 Difference]: With dead ends: 37293 [2019-11-20 07:14:35,192 INFO L226 Difference]: Without dead ends: 22483 [2019-11-20 07:14:35,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2019-11-20 07:14:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 22481. [2019-11-20 07:14:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22481 states. [2019-11-20 07:14:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22481 states to 22481 states and 34190 transitions. [2019-11-20 07:14:36,823 INFO L78 Accepts]: Start accepts. Automaton has 22481 states and 34190 transitions. Word has length 112 [2019-11-20 07:14:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:36,824 INFO L462 AbstractCegarLoop]: Abstraction has 22481 states and 34190 transitions. [2019-11-20 07:14:36,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 22481 states and 34190 transitions. [2019-11-20 07:14:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 07:14:36,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:36,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:36,834 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -114669100, now seen corresponding path program 1 times [2019-11-20 07:14:36,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:36,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522689642] [2019-11-20 07:14:36,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:36,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522689642] [2019-11-20 07:14:36,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:36,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:14:36,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719243753] [2019-11-20 07:14:36,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:14:36,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:14:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:36,945 INFO L87 Difference]: Start difference. First operand 22481 states and 34190 transitions. Second operand 3 states. [2019-11-20 07:14:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:39,251 INFO L93 Difference]: Finished difference Result 61637 states and 95608 transitions. [2019-11-20 07:14:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:14:39,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-20 07:14:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:39,320 INFO L225 Difference]: With dead ends: 61637 [2019-11-20 07:14:39,320 INFO L226 Difference]: Without dead ends: 42059 [2019-11-20 07:14:39,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:14:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42059 states. [2019-11-20 07:14:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42059 to 41973. [2019-11-20 07:14:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-11-20 07:14:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63782 transitions. [2019-11-20 07:14:41,648 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63782 transitions. Word has length 115 [2019-11-20 07:14:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:41,649 INFO L462 AbstractCegarLoop]: Abstraction has 41973 states and 63782 transitions. [2019-11-20 07:14:41,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:14:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63782 transitions. [2019-11-20 07:14:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 07:14:41,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:41,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:41,658 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1641098498, now seen corresponding path program 1 times [2019-11-20 07:14:41,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:41,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506894672] [2019-11-20 07:14:41,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:14:41,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506894672] [2019-11-20 07:14:41,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:41,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 07:14:41,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391057563] [2019-11-20 07:14:41,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:14:41,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:14:41,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:14:41,912 INFO L87 Difference]: Start difference. First operand 41973 states and 63782 transitions. Second operand 8 states. [2019-11-20 07:14:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:44,411 INFO L93 Difference]: Finished difference Result 81591 states and 124774 transitions. [2019-11-20 07:14:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:14:44,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-11-20 07:14:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:44,473 INFO L225 Difference]: With dead ends: 81591 [2019-11-20 07:14:44,473 INFO L226 Difference]: Without dead ends: 41975 [2019-11-20 07:14:44,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:14:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41975 states. [2019-11-20 07:14:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41975 to 41973. [2019-11-20 07:14:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-11-20 07:14:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63590 transitions. [2019-11-20 07:14:46,861 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63590 transitions. Word has length 115 [2019-11-20 07:14:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:14:46,862 INFO L462 AbstractCegarLoop]: Abstraction has 41973 states and 63590 transitions. [2019-11-20 07:14:46,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:14:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63590 transitions. [2019-11-20 07:14:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 07:14:46,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:14:46,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:14:46,869 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:14:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:14:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 823040093, now seen corresponding path program 1 times [2019-11-20 07:14:46,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:14:46,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280102213] [2019-11-20 07:14:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:14:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:14:47,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-11-20 07:14:47,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280102213] [2019-11-20 07:14:47,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:14:47,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:14:47,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342744154] [2019-11-20 07:14:47,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:14:47,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:14:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:14:47,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:14:47,040 INFO L87 Difference]: Start difference. First operand 41973 states and 63590 transitions. Second operand 6 states. [2019-11-20 07:14:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:14:54,567 INFO L93 Difference]: Finished difference Result 158117 states and 241003 transitions. [2019-11-20 07:14:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:14:54,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-11-20 07:14:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:14:54,730 INFO L225 Difference]: With dead ends: 158117 [2019-11-20 07:14:54,730 INFO L226 Difference]: Without dead ends: 120065 [2019-11-20 07:14:54,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:14:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120065 states. [2019-11-20 07:15:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120065 to 120061. [2019-11-20 07:15:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120061 states. [2019-11-20 07:15:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120061 states to 120061 states and 182620 transitions. [2019-11-20 07:15:01,825 INFO L78 Accepts]: Start accepts. Automaton has 120061 states and 182620 transitions. Word has length 115 [2019-11-20 07:15:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:15:01,826 INFO L462 AbstractCegarLoop]: Abstraction has 120061 states and 182620 transitions. [2019-11-20 07:15:01,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:15:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 120061 states and 182620 transitions. [2019-11-20 07:15:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 07:15:01,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:15:01,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:15:01,834 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:15:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:15:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 452099970, now seen corresponding path program 1 times [2019-11-20 07:15:01,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:15:01,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430232855] [2019-11-20 07:15:01,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:15:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:15:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:15:01,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430232855] [2019-11-20 07:15:01,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:15:01,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:15:01,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839160426] [2019-11-20 07:15:01,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:15:01,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:15:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:15:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:15:01,982 INFO L87 Difference]: Start difference. First operand 120061 states and 182620 transitions. Second operand 4 states. [2019-11-20 07:15:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:15:12,215 INFO L93 Difference]: Finished difference Result 231119 states and 351418 transitions. [2019-11-20 07:15:12,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:15:12,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-20 07:15:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:15:12,378 INFO L225 Difference]: With dead ends: 231119 [2019-11-20 07:15:12,378 INFO L226 Difference]: Without dead ends: 111362 [2019-11-20 07:15:12,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:15:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111362 states. [2019-11-20 07:15:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111362 to 111320. [2019-11-20 07:15:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111320 states. [2019-11-20 07:15:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111320 states to 111320 states and 169093 transitions. [2019-11-20 07:15:18,590 INFO L78 Accepts]: Start accepts. Automaton has 111320 states and 169093 transitions. Word has length 115 [2019-11-20 07:15:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:15:18,591 INFO L462 AbstractCegarLoop]: Abstraction has 111320 states and 169093 transitions. [2019-11-20 07:15:18,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:15:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 111320 states and 169093 transitions. [2019-11-20 07:15:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 07:15:18,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:15:18,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:15:18,597 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:15:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:15:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 630278213, now seen corresponding path program 1 times [2019-11-20 07:15:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:15:18,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045702124] [2019-11-20 07:15:18,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:15:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:15:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:15:18,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045702124] [2019-11-20 07:15:18,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:15:18,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:15:18,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192113195] [2019-11-20 07:15:18,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:15:18,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:15:18,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:15:18,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:15:18,742 INFO L87 Difference]: Start difference. First operand 111320 states and 169093 transitions. Second operand 4 states. [2019-11-20 07:15:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:15:25,674 INFO L93 Difference]: Finished difference Result 222648 states and 338190 transitions. [2019-11-20 07:15:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:15:25,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 07:15:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:15:25,848 INFO L225 Difference]: With dead ends: 222648 [2019-11-20 07:15:25,848 INFO L226 Difference]: Without dead ends: 111485 [2019-11-20 07:15:25,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:15:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111485 states. [2019-11-20 07:15:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111485 to 111423. [2019-11-20 07:15:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111423 states. [2019-11-20 07:15:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111423 states to 111423 states and 169199 transitions. [2019-11-20 07:15:33,192 INFO L78 Accepts]: Start accepts. Automaton has 111423 states and 169199 transitions. Word has length 117 [2019-11-20 07:15:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:15:33,193 INFO L462 AbstractCegarLoop]: Abstraction has 111423 states and 169199 transitions. [2019-11-20 07:15:33,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:15:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 111423 states and 169199 transitions. [2019-11-20 07:15:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 07:15:33,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:15:33,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:15:33,198 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:15:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:15:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash 856369869, now seen corresponding path program 1 times [2019-11-20 07:15:33,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:15:33,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900832685] [2019-11-20 07:15:33,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:15:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:15:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:15:33,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900832685] [2019-11-20 07:15:33,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:15:33,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:15:33,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714766730] [2019-11-20 07:15:33,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:15:33,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:15:33,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:15:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:15:33,250 INFO L87 Difference]: Start difference. First operand 111423 states and 169199 transitions. Second operand 3 states. [2019-11-20 07:15:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:15:46,338 INFO L93 Difference]: Finished difference Result 305539 states and 463991 transitions. [2019-11-20 07:15:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:15:46,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-20 07:15:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:15:46,667 INFO L225 Difference]: With dead ends: 305539 [2019-11-20 07:15:46,667 INFO L226 Difference]: Without dead ends: 222636 [2019-11-20 07:15:46,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:15:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222636 states. [2019-11-20 07:15:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222636 to 111433. [2019-11-20 07:15:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111433 states. [2019-11-20 07:16:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111433 states to 111433 states and 169209 transitions. [2019-11-20 07:16:00,047 INFO L78 Accepts]: Start accepts. Automaton has 111433 states and 169209 transitions. Word has length 118 [2019-11-20 07:16:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:16:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 111433 states and 169209 transitions. [2019-11-20 07:16:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:16:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 111433 states and 169209 transitions. [2019-11-20 07:16:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 07:16:00,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:16:00,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:16:00,053 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:16:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:16:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1613219331, now seen corresponding path program 1 times [2019-11-20 07:16:00,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:16:00,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884098768] [2019-11-20 07:16:00,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:16:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:16:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:16:00,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884098768] [2019-11-20 07:16:00,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:16:00,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:16:00,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126476346] [2019-11-20 07:16:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:16:00,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:16:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:16:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:16:00,201 INFO L87 Difference]: Start difference. First operand 111433 states and 169209 transitions. Second operand 4 states. [2019-11-20 07:16:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:16:07,818 INFO L93 Difference]: Finished difference Result 223001 states and 338560 transitions. [2019-11-20 07:16:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:16:07,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 07:16:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:16:07,993 INFO L225 Difference]: With dead ends: 223001 [2019-11-20 07:16:07,993 INFO L226 Difference]: Without dead ends: 111841 [2019-11-20 07:16:08,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:16:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111841 states. [2019-11-20 07:16:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111841 to 111684. [2019-11-20 07:16:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111684 states. [2019-11-20 07:16:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111684 states to 111684 states and 169465 transitions. [2019-11-20 07:16:16,269 INFO L78 Accepts]: Start accepts. Automaton has 111684 states and 169465 transitions. Word has length 119 [2019-11-20 07:16:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:16:16,270 INFO L462 AbstractCegarLoop]: Abstraction has 111684 states and 169465 transitions. [2019-11-20 07:16:16,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:16:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111684 states and 169465 transitions. [2019-11-20 07:16:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 07:16:16,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:16:16,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:16:16,275 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:16:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:16:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 88340068, now seen corresponding path program 1 times [2019-11-20 07:16:16,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:16:16,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495991530] [2019-11-20 07:16:16,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:16:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:16:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:16:16,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495991530] [2019-11-20 07:16:16,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:16:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:16:16,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096102150] [2019-11-20 07:16:16,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:16:16,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:16:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:16:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:16:16,388 INFO L87 Difference]: Start difference. First operand 111684 states and 169465 transitions. Second operand 4 states. [2019-11-20 07:16:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:16:23,444 INFO L93 Difference]: Finished difference Result 163639 states and 247980 transitions. [2019-11-20 07:16:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:16:23,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 07:16:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:16:23,605 INFO L225 Difference]: With dead ends: 163639 [2019-11-20 07:16:23,605 INFO L226 Difference]: Without dead ends: 102848 [2019-11-20 07:16:23,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:16:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102848 states. [2019-11-20 07:16:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102848 to 102848. [2019-11-20 07:16:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102848 states. [2019-11-20 07:16:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102848 states to 102848 states and 155959 transitions. [2019-11-20 07:16:31,310 INFO L78 Accepts]: Start accepts. Automaton has 102848 states and 155959 transitions. Word has length 119 [2019-11-20 07:16:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:16:31,311 INFO L462 AbstractCegarLoop]: Abstraction has 102848 states and 155959 transitions. [2019-11-20 07:16:31,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:16:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 102848 states and 155959 transitions. [2019-11-20 07:16:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 07:16:31,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:16:31,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:16:31,316 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:16:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:16:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash -775506488, now seen corresponding path program 1 times [2019-11-20 07:16:31,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:16:31,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957758491] [2019-11-20 07:16:31,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:16:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:16:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:16:31,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957758491] [2019-11-20 07:16:31,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:16:31,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:16:31,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33447916] [2019-11-20 07:16:31,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:16:31,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:16:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:16:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:16:31,418 INFO L87 Difference]: Start difference. First operand 102848 states and 155959 transitions. Second operand 5 states. [2019-11-20 07:16:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:16:39,435 INFO L93 Difference]: Finished difference Result 204448 states and 310514 transitions. [2019-11-20 07:16:39,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:16:39,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-20 07:16:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:16:39,591 INFO L225 Difference]: With dead ends: 204448 [2019-11-20 07:16:39,591 INFO L226 Difference]: Without dead ends: 102848 [2019-11-20 07:16:39,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:16:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102848 states. [2019-11-20 07:16:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102848 to 102848. [2019-11-20 07:16:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102848 states. [2019-11-20 07:16:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102848 states to 102848 states and 154685 transitions. [2019-11-20 07:16:47,823 INFO L78 Accepts]: Start accepts. Automaton has 102848 states and 154685 transitions. Word has length 121 [2019-11-20 07:16:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:16:47,823 INFO L462 AbstractCegarLoop]: Abstraction has 102848 states and 154685 transitions. [2019-11-20 07:16:47,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:16:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102848 states and 154685 transitions. [2019-11-20 07:16:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 07:16:47,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:16:47,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:16:47,828 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:16:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:16:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 302450541, now seen corresponding path program 1 times [2019-11-20 07:16:47,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:16:47,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502249866] [2019-11-20 07:16:47,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:16:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:16:48,617 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-20 07:16:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:16:49,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502249866] [2019-11-20 07:16:49,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:16:49,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-20 07:16:49,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647268333] [2019-11-20 07:16:49,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 07:16:49,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:16:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 07:16:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-20 07:16:49,505 INFO L87 Difference]: Start difference. First operand 102848 states and 154685 transitions. Second operand 23 states. [2019-11-20 07:16:50,006 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 07:16:50,290 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-20 07:16:50,575 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-20 07:16:50,866 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-20 07:16:51,145 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-20 07:16:51,622 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-20 07:16:51,964 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-11-20 07:16:52,226 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 07:16:52,517 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 07:16:52,772 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-20 07:16:53,201 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-20 07:16:53,504 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-20 07:16:53,817 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-20 07:17:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:17:18,474 INFO L93 Difference]: Finished difference Result 277957 states and 419032 transitions. [2019-11-20 07:17:18,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 07:17:18,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2019-11-20 07:17:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:17:18,821 INFO L225 Difference]: With dead ends: 277957 [2019-11-20 07:17:18,822 INFO L226 Difference]: Without dead ends: 233145 [2019-11-20 07:17:18,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 07:17:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233145 states. [2019-11-20 07:17:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233145 to 103402. [2019-11-20 07:17:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103402 states. [2019-11-20 07:17:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103402 states to 103402 states and 155322 transitions. [2019-11-20 07:17:30,384 INFO L78 Accepts]: Start accepts. Automaton has 103402 states and 155322 transitions. Word has length 121 [2019-11-20 07:17:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:17:30,384 INFO L462 AbstractCegarLoop]: Abstraction has 103402 states and 155322 transitions. [2019-11-20 07:17:30,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 07:17:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 103402 states and 155322 transitions. [2019-11-20 07:17:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 07:17:30,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:17:30,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:17:30,390 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:17:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:17:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash -590053851, now seen corresponding path program 1 times [2019-11-20 07:17:30,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:17:30,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177954778] [2019-11-20 07:17:30,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:17:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:17:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:17:30,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:17:30,601 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:17:30,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:17:30 BoogieIcfgContainer [2019-11-20 07:17:30,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:17:30,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:17:30,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:17:30,814 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:17:30,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:18" (3/4) ... [2019-11-20 07:17:30,817 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:17:31,039 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d266360e-6934-43b9-87a2-19bb81cf7cbd/bin/uautomizer/witness.graphml [2019-11-20 07:17:31,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:17:31,041 INFO L168 Benchmark]: Toolchain (without parser) took 194649.10 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 5.0 GB). Free memory was 940.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,041 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:17:31,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,043 INFO L168 Benchmark]: Boogie Preprocessor took 88.58 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,043 INFO L168 Benchmark]: RCFGBuilder took 1665.13 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,044 INFO L168 Benchmark]: TraceAbstraction took 191825.23 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,044 INFO L168 Benchmark]: Witness Printer took 226.16 ms. Allocated memory is still 6.0 GB. Free memory was 2.8 GB in the beginning and 2.6 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:17:31,046 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 729.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.58 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1665.13 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191825.23 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 226.16 ms. Allocated memory is still 6.0 GB. Free memory was 2.8 GB in the beginning and 2.6 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L306] COND FALSE !(!(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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p13_old=-1, p21=0, p21_new=126, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=0, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, 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=127, id2=126, id3=125, m1=126, m2=125, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=0, max1=127, max2=126, max3=125, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=0, max1=127, max2=126, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=0, max1=127, max2=126, 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=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, 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] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [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=127, id2=126, id3=125, m1=126, m2=125, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 1 error locations. Result: UNSAFE, OverallTime: 191.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 104.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12088 SDtfs, 12347 SDslu, 16536 SDs, 0 SdLazy, 3480 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.2s 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 DumpTime, AutomataMinimizationStatistics: 80.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 257827 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2880 NumberOfCodeBlocks, 2880 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2734 ConstructedInterpolants, 0 QuantifiedInterpolants, 1414126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...