./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:50:45,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:50:45,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:50:45,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:50:45,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:50:45,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:50:45,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:50:45,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:50:45,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:50:45,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:50:45,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:50:45,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:50:45,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:50:45,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:50:45,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:50:45,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:50:45,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:50:45,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:50:45,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:50:45,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:50:45,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:50:45,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:50:45,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:50:45,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:50:45,905 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:50:45,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:50:45,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:50:45,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:50:45,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:50:45,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:50:45,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:50:45,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:50:45,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:50:45,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:50:45,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:50:45,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:50:45,911 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 09:50:45,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:50:45,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:50:45,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:50:45,923 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:50:45,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:50:45,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:50:45,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:50:45,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:50:45,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:50:45,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:50:45,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:50:45,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:50:45,926 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 09:50:45,926 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 09:50:45,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:50:45,926 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:50:45,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 09:50:45,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:50:45,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:50:45,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:50:45,927 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 09:50:45,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:50:45,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:50:45,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak 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 -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2018-11-10 09:50:45,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:50:45,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:50:45,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:50:45,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:50:45,965 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:50:45,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-11-10 09:50:46,002 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/data/cec2690bc/eaaa652a7a2f45cca56095c9eee0562b/FLAG54c3feab6 [2018-11-10 09:50:46,355 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:50:46,356 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-11-10 09:50:46,364 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/data/cec2690bc/eaaa652a7a2f45cca56095c9eee0562b/FLAG54c3feab6 [2018-11-10 09:50:46,377 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/data/cec2690bc/eaaa652a7a2f45cca56095c9eee0562b [2018-11-10 09:50:46,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:50:46,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:50:46,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:46,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:50:46,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:50:46,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338863a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46, skipping insertion in model container [2018-11-10 09:50:46,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:50:46,430 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:50:46,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:46,668 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:50:46,746 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:46,756 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:50:46,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46 WrapperNode [2018-11-10 09:50:46,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:46,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:46,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:50:46,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:50:46,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:46,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:50:46,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:50:46,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:50:46,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... [2018-11-10 09:50:46,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:50:46,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:50:46,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:50:46,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:50:46,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-10 09:50:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:50:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:50:48,380 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:50:48,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:48 BoogieIcfgContainer [2018-11-10 09:50:48,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:50:48,381 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 09:50:48,382 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 09:50:48,392 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 09:50:48,392 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:48" (1/1) ... [2018-11-10 09:50:48,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2018-11-10 09:50:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2018-11-10 09:50:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 09:50:48,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 183 states and 324 transitions. [2018-11-10 09:50:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 324 transitions. [2018-11-10 09:50:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:50:49,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 185 states and 327 transitions. [2018-11-10 09:50:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 327 transitions. [2018-11-10 09:50:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:50:49,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 196 states and 352 transitions. [2018-11-10 09:50:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 352 transitions. [2018-11-10 09:50:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:50:49,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 203 states and 370 transitions. [2018-11-10 09:50:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 370 transitions. [2018-11-10 09:50:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:50:50,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 204 states and 371 transitions. [2018-11-10 09:50:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 371 transitions. [2018-11-10 09:50:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:50:50,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 204 states and 369 transitions. [2018-11-10 09:50:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 369 transitions. [2018-11-10 09:50:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:50:50,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 207 states and 376 transitions. [2018-11-10 09:50:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 376 transitions. [2018-11-10 09:50:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:50:52,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 212 states and 386 transitions. [2018-11-10 09:50:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 386 transitions. [2018-11-10 09:50:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:50:55,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:50:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 224 states and 414 transitions. [2018-11-10 09:50:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 414 transitions. [2018-11-10 09:50:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:50:59,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:50:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 230 states and 428 transitions. [2018-11-10 09:51:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 428 transitions. [2018-11-10 09:51:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:05,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 238 states and 449 transitions. [2018-11-10 09:51:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 449 transitions. [2018-11-10 09:51:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:13,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 242 states and 455 transitions. [2018-11-10 09:51:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 455 transitions. [2018-11-10 09:51:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:14,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 247 states and 469 transitions. [2018-11-10 09:51:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 469 transitions. [2018-11-10 09:51:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:15,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 249 states and 473 transitions. [2018-11-10 09:51:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 473 transitions. [2018-11-10 09:51:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:16,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 249 states and 472 transitions. [2018-11-10 09:51:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 472 transitions. [2018-11-10 09:51:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:51:16,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 250 states and 473 transitions. [2018-11-10 09:51:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 473 transitions. [2018-11-10 09:51:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:17,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 254 states and 479 transitions. [2018-11-10 09:51:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 479 transitions. [2018-11-10 09:51:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:18,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 258 states and 485 transitions. [2018-11-10 09:51:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 485 transitions. [2018-11-10 09:51:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:19,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 262 states and 493 transitions. [2018-11-10 09:51:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 493 transitions. [2018-11-10 09:51:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:22,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 266 states and 499 transitions. [2018-11-10 09:51:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 499 transitions. [2018-11-10 09:51:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:23,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 275 states and 520 transitions. [2018-11-10 09:51:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 520 transitions. [2018-11-10 09:51:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:27,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 279 states and 527 transitions. [2018-11-10 09:51:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 527 transitions. [2018-11-10 09:51:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:29,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 287 states and 547 transitions. [2018-11-10 09:51:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 547 transitions. [2018-11-10 09:51:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:33,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 289 states and 551 transitions. [2018-11-10 09:51:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 551 transitions. [2018-11-10 09:51:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:34,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 290 states and 553 transitions. [2018-11-10 09:51:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 553 transitions. [2018-11-10 09:51:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:35,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 291 states and 554 transitions. [2018-11-10 09:51:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 554 transitions. [2018-11-10 09:51:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:35,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 292 states and 555 transitions. [2018-11-10 09:51:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 555 transitions. [2018-11-10 09:51:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:37,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 293 states and 556 transitions. [2018-11-10 09:51:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 556 transitions. [2018-11-10 09:51:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:51:37,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 279 states and 515 transitions. [2018-11-10 09:51:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 515 transitions. [2018-11-10 09:51:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:51:40,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 283 states and 523 transitions. [2018-11-10 09:51:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 523 transitions. [2018-11-10 09:51:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:51:43,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:51:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 287 states and 528 transitions. [2018-11-10 09:51:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 528 transitions. [2018-11-10 09:51:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:51:46,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:51:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:52:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:52:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 296 states and 546 transitions. [2018-11-10 09:52:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 546 transitions. [2018-11-10 09:52:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:52:05,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:52:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:52:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:52:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 315 states and 595 transitions. [2018-11-10 09:52:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 595 transitions. [2018-11-10 09:52:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:52:35,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:52:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:52:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:52:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 321 states and 607 transitions. [2018-11-10 09:52:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 607 transitions. [2018-11-10 09:52:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:52:38,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:52:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:52:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:52:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 325 states and 612 transitions. [2018-11-10 09:52:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 612 transitions. [2018-11-10 09:52:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:52:41,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:52:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:52:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:52:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 342 states and 646 transitions. [2018-11-10 09:52:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 646 transitions. [2018-11-10 09:52:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:52:52,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:52:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 355 states and 675 transitions. [2018-11-10 09:53:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 675 transitions. [2018-11-10 09:53:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:01,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 359 states and 681 transitions. [2018-11-10 09:53:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 681 transitions. [2018-11-10 09:53:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:04,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 363 states and 692 transitions. [2018-11-10 09:53:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 692 transitions. [2018-11-10 09:53:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:08,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 366 states and 700 transitions. [2018-11-10 09:53:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 700 transitions. [2018-11-10 09:53:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:12,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 367 states and 703 transitions. [2018-11-10 09:53:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 703 transitions. [2018-11-10 09:53:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:13,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 364 states and 696 transitions. [2018-11-10 09:53:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 696 transitions. [2018-11-10 09:53:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:17,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 364 states and 695 transitions. [2018-11-10 09:53:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 695 transitions. [2018-11-10 09:53:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:22,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 361 states and 691 transitions. [2018-11-10 09:53:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 691 transitions. [2018-11-10 09:53:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:26,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 360 states and 688 transitions. [2018-11-10 09:53:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 688 transitions. [2018-11-10 09:53:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:29,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 359 states and 679 transitions. [2018-11-10 09:53:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 679 transitions. [2018-11-10 09:53:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:34,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 361 states and 680 transitions. [2018-11-10 09:53:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 680 transitions. [2018-11-10 09:53:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:37,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 358 states and 673 transitions. [2018-11-10 09:53:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 673 transitions. [2018-11-10 09:53:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 09:53:42,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 358 states and 672 transitions. [2018-11-10 09:53:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 672 transitions. [2018-11-10 09:53:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:53:44,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 362 states and 679 transitions. [2018-11-10 09:53:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 679 transitions. [2018-11-10 09:53:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:53:47,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:53:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:53:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 373 states and 697 transitions. [2018-11-10 09:53:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 697 transitions. [2018-11-10 09:53:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:53:57,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:53:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:53:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 377 states and 703 transitions. [2018-11-10 09:54:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 703 transitions. [2018-11-10 09:54:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:03,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 379 states and 707 transitions. [2018-11-10 09:54:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 707 transitions. [2018-11-10 09:54:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:05,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 386 states and 720 transitions. [2018-11-10 09:54:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 720 transitions. [2018-11-10 09:54:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:09,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 403 states and 754 transitions. [2018-11-10 09:54:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 754 transitions. [2018-11-10 09:54:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:24,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 405 states and 757 transitions. [2018-11-10 09:54:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 757 transitions. [2018-11-10 09:54:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:26,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 409 states and 764 transitions. [2018-11-10 09:54:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 764 transitions. [2018-11-10 09:54:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:28,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 417 states and 778 transitions. [2018-11-10 09:54:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 778 transitions. [2018-11-10 09:54:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:37,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 418 states and 783 transitions. [2018-11-10 09:54:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 783 transitions. [2018-11-10 09:54:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:38,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 421 states and 787 transitions. [2018-11-10 09:54:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 787 transitions. [2018-11-10 09:54:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:41,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 423 states and 788 transitions. [2018-11-10 09:54:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 788 transitions. [2018-11-10 09:54:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:44,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 420 states and 778 transitions. [2018-11-10 09:54:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 778 transitions. [2018-11-10 09:54:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:49,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 417 states and 770 transitions. [2018-11-10 09:54:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 770 transitions. [2018-11-10 09:54:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:54,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:54:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 416 states and 768 transitions. [2018-11-10 09:54:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 768 transitions. [2018-11-10 09:54:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:54:59,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:54:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 415 states and 765 transitions. [2018-11-10 09:55:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 765 transitions. [2018-11-10 09:55:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:55:01,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 393 states and 706 transitions. [2018-11-10 09:55:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 706 transitions. [2018-11-10 09:55:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:55:04,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 390 states and 699 transitions. [2018-11-10 09:55:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 699 transitions. [2018-11-10 09:55:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:55:08,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 390 states and 698 transitions. [2018-11-10 09:55:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 698 transitions. [2018-11-10 09:55:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 09:55:10,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 390 states and 697 transitions. [2018-11-10 09:55:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 697 transitions. [2018-11-10 09:55:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 09:55:11,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 391 states and 698 transitions. [2018-11-10 09:55:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 698 transitions. [2018-11-10 09:55:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 09:55:13,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 395 states and 704 transitions. [2018-11-10 09:55:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 704 transitions. [2018-11-10 09:55:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 09:55:17,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:55:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:55:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:55:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:55:18,042 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2018-11-10 09:55:18,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 09:55:18 ImpRootNode [2018-11-10 09:55:18,194 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 09:55:18,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:55:18,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:55:18,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:55:18,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:48" (3/4) ... [2018-11-10 09:55:18,197 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 09:55:18,334 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4249fab-09c8-4a0d-86b4-32005141f1a5/bin-2019/ukojak/witness.graphml [2018-11-10 09:55:18,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:55:18,334 INFO L168 Benchmark]: Toolchain (without parser) took 271953.76 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 498.1 MB). Free memory was 952.2 MB in the beginning and 848.5 MB in the end (delta: 103.6 MB). Peak memory consumption was 601.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,337 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:55:18,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 925.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 925.3 MB in the beginning and 1.2 GB in the end (delta: -231.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,337 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,338 INFO L168 Benchmark]: RCFGBuilder took 1498.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,338 INFO L168 Benchmark]: CodeCheck took 269812.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 934.7 MB in the beginning and 886.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 381.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,338 INFO L168 Benchmark]: Witness Printer took 139.58 ms. Allocated memory is still 1.5 GB. Free memory was 886.1 MB in the beginning and 848.5 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:55:18,340 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 247 locations, 1 error locations. UNSAFE Result, 269.6s OverallTime, 72 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19464192 SDtfs, 1891826480 SDslu, -1156477708 SDs, 0 SdLazy, -1235802116 SolverSat, 1951301632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48321 GetRequests, 46437 SyntacticMatches, 696 SemanticMatches, 1188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701032 ImplicationChecksByTransitivity, 263.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 6030 NumberOfCodeBlocks, 6030 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 5870 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 71 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L17] port_t p13 = 0; [L21] port_t p21 = 0; [L25] port_t p23 = 0; [L29] port_t p31 = 0; [L33] port_t p32 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 [L133] COND FALSE !(!(init__r121 == 0)) [L1782] COND TRUE !(init__r131 == 0) [L1784] COND TRUE !(ep32 == 0) [L1786] init__tmp = 1 [L137] init__r122 = (_Bool)init__tmp [L138] COND TRUE !(init__r131 == 0) [L140] init__tmp___0 = 1 [L142] init__r132 = (_Bool)init__tmp___0 [L143] COND TRUE !(init__r211 == 0) [L145] init__tmp___1 = 1 [L147] init__r212 = (_Bool)init__tmp___1 [L148] COND FALSE !(!(init__r231 == 0)) [L1713] COND TRUE !(init__r211 == 0) [L1715] COND TRUE !(ep13 == 0) [L1717] init__tmp___2 = 1 [L152] init__r232 = (_Bool)init__tmp___2 [L153] COND FALSE !(!(init__r311 == 0)) [L1690] COND TRUE !(init__r321 == 0) [L1692] COND TRUE !(ep21 == 0) [L1694] init__tmp___3 = 1 [L157] init__r312 = (_Bool)init__tmp___3 [L158] COND TRUE !(init__r321 == 0) [L160] init__tmp___4 = 1 [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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] [L265] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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] [L267] COND TRUE !(newmax1 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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 max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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] [L292] COND TRUE !(newmax2 == 0) [L294] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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 max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] COND TRUE p21_new == nomsg [L299] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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] [L301] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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] [L328] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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] [L341] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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] [L343] COND TRUE !(newmax3 == 0) [L345] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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 max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE p32_new == nomsg [L350] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-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] [L352] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p13_old=-1, p21=0, p21_new=16, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=17, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=0, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, p21=0, p21_new=-1, p21_old=16, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=17, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 [L423] COND TRUE !(ep21 == 0) [L425] m1 = p21_old [L426] p21_old = nomsg [L427] COND FALSE !(((int)m1) > ((int)max1)) [L432] COND FALSE !(!(ep31 == 0)) [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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=17, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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=17, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=0, m3=17, max1=18, max2=16, max3=17, 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=18, 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=17, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=17, max1=18, max2=17, max3=17, 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=18, 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] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=17, max1=18, max2=17, max3=17, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=18, 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] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=17, max1=18, max2=17, max3=17, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=18, 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] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND TRUE ((int)m3) > ((int)max3) [L505] max3 = m3 [L506] node3__newmax = 1 [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=18, id2=16, id3=17, m1=16, m2=17, m3=18, max1=18, max2=17, max3=18, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 925.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 925.3 MB in the beginning and 1.2 GB in the end (delta: -231.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1498.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. * CodeCheck took 269812.61 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 934.7 MB in the beginning and 886.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 381.0 MB. Max. memory is 11.5 GB. * Witness Printer took 139.58 ms. Allocated memory is still 1.5 GB. Free memory was 886.1 MB in the beginning and 848.5 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...