./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/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 6d9066a9c9a0f98758515c22da9fb874b191c54e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 11:12:29,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:12:29,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:12:29,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:12:29,842 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:12:29,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:12:29,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:12:29,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:12:29,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:12:29,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:12:29,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:12:29,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:12:29,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:12:29,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:12:29,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:12:29,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:12:29,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:12:29,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:12:29,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:12:29,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:12:29,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:12:29,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:12:29,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:12:29,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:12:29,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:12:29,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:12:29,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:12:29,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:12:29,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:12:29,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:12:29,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:12:29,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:12:29,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:12:29,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:12:29,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:12:29,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:12:29,864 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 11:12:29,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:12:29,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:12:29,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:12:29,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:12:29,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:12:29,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:12:29,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:12:29,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:12:29,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:12:29,877 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:12:29,878 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:12:29,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:12:29,878 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 11:12:29,878 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 11:12:29,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:12:29,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:12:29,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 11:12:29,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:12:29,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:12:29,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:12:29,879 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 11:12:29,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:12:29,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:12:29,880 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_1d6e0571-009c-4ab7-9524-4e6b3c287be1/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 -> 6d9066a9c9a0f98758515c22da9fb874b191c54e [2018-11-18 11:12:29,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:12:29,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:12:29,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:12:29,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:12:29,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:12:29,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-11-18 11:12:29,948 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/data/7c73ca3ae/15af4af09f23418ab851cfeb5842e9c5/FLAG162c01be5 [2018-11-18 11:12:30,371 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:12:30,372 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-11-18 11:12:30,380 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/data/7c73ca3ae/15af4af09f23418ab851cfeb5842e9c5/FLAG162c01be5 [2018-11-18 11:12:30,389 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/data/7c73ca3ae/15af4af09f23418ab851cfeb5842e9c5 [2018-11-18 11:12:30,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:12:30,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:12:30,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:12:30,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:12:30,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:12:30,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30, skipping insertion in model container [2018-11-18 11:12:30,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:12:30,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:12:30,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:12:30,604 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:12:30,689 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:12:30,703 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:12:30,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30 WrapperNode [2018-11-18 11:12:30,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:12:30,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:12:30,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:12:30,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:12:30,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:12:30,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:12:30,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:12:30,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:12:30,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:12:30,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:12:30,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:12:30,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:12:30,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/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-18 11:12:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:12:30,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:12:32,727 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:12:32,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:32 BoogieIcfgContainer [2018-11-18 11:12:32,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:12:32,728 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 11:12:32,728 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 11:12:32,735 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 11:12:32,735 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:32" (1/1) ... [2018-11-18 11:12:32,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 11:12:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 11:12:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 11:12:32,767 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:33,126 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-18 11:12:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-18 11:12:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-18 11:12:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 11:12:33,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:33,342 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-18 11:12:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-18 11:12:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-18 11:12:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 11:12:33,536 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:33,680 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-18 11:12:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-18 11:12:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 11:12:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 11:12:33,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-18 11:12:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-18 11:12:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 11:12:34,470 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:34,669 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-18 11:12:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-18 11:12:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-18 11:12:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 11:12:35,268 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:35,407 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-18 11:12:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-18 11:12:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-18 11:12:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 11:12:36,150 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:36,249 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-18 11:12:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-18 11:12:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-18 11:12:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 11:12:36,417 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:36,439 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-18 11:12:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-18 11:12:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-18 11:12:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 11:12:36,446 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:36,628 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-18 11:12:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-18 11:12:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-18 11:12:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 11:12:37,981 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:38,092 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-18 11:12:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-18 11:12:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-18 11:12:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:12:38,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 86 states and 147 transitions. [2018-11-18 11:12:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 147 transitions. [2018-11-18 11:12:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:12:41,570 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 104 states and 180 transitions. [2018-11-18 11:12:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 180 transitions. [2018-11-18 11:12:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:12:44,813 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 107 states and 191 transitions. [2018-11-18 11:12:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 191 transitions. [2018-11-18 11:12:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:12:45,541 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 125 states and 223 transitions. [2018-11-18 11:12:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 223 transitions. [2018-11-18 11:12:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:12:48,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 128 states and 236 transitions. [2018-11-18 11:12:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 236 transitions. [2018-11-18 11:12:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:12:49,800 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 129 states and 239 transitions. [2018-11-18 11:12:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 239 transitions. [2018-11-18 11:12:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:12:50,290 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 131 states and 242 transitions. [2018-11-18 11:12:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 242 transitions. [2018-11-18 11:12:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:12:50,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 146 states and 273 transitions. [2018-11-18 11:12:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 273 transitions. [2018-11-18 11:12:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:12:54,710 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 150 states and 283 transitions. [2018-11-18 11:12:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 283 transitions. [2018-11-18 11:12:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:12:55,911 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 151 states and 288 transitions. [2018-11-18 11:12:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 288 transitions. [2018-11-18 11:12:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:12:56,372 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:12:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 152 states and 291 transitions. [2018-11-18 11:12:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 291 transitions. [2018-11-18 11:12:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:12:56,857 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:12:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 174 states and 322 transitions. [2018-11-18 11:13:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 322 transitions. [2018-11-18 11:13:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:13:04,113 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 179 states and 331 transitions. [2018-11-18 11:13:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 331 transitions. [2018-11-18 11:13:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:13:06,984 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 188 states and 350 transitions. [2018-11-18 11:13:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 350 transitions. [2018-11-18 11:13:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 11:13:12,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 203 states and 402 transitions. [2018-11-18 11:13:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 402 transitions. [2018-11-18 11:13:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:13:21,387 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 218 states and 441 transitions. [2018-11-18 11:13:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 441 transitions. [2018-11-18 11:13:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:13:29,950 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 229 states and 457 transitions. [2018-11-18 11:13:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 457 transitions. [2018-11-18 11:13:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:13:36,199 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 231 states and 463 transitions. [2018-11-18 11:13:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 463 transitions. [2018-11-18 11:13:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:13:37,044 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 242 states and 490 transitions. [2018-11-18 11:13:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 490 transitions. [2018-11-18 11:13:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:13:43,777 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 244 states and 497 transitions. [2018-11-18 11:13:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 497 transitions. [2018-11-18 11:13:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:13:44,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 246 states and 498 transitions. [2018-11-18 11:13:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 498 transitions. [2018-11-18 11:13:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:13:45,408 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 255 states and 526 transitions. [2018-11-18 11:13:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 526 transitions. [2018-11-18 11:13:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:13:53,662 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 260 states and 546 transitions. [2018-11-18 11:13:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 546 transitions. [2018-11-18 11:13:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:13:56,387 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 262 states and 552 transitions. [2018-11-18 11:13:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 552 transitions. [2018-11-18 11:13:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:13:57,582 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 263 states and 553 transitions. [2018-11-18 11:13:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 553 transitions. [2018-11-18 11:13:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:13:58,388 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:13:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 264 states and 560 transitions. [2018-11-18 11:13:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 560 transitions. [2018-11-18 11:13:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:13:59,315 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:13:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 278 states and 595 transitions. [2018-11-18 11:14:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 595 transitions. [2018-11-18 11:14:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:14:08,040 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 280 states and 600 transitions. [2018-11-18 11:14:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 600 transitions. [2018-11-18 11:14:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:14:09,100 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 286 states and 631 transitions. [2018-11-18 11:14:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 631 transitions. [2018-11-18 11:14:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:14:13,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 291 states and 655 transitions. [2018-11-18 11:14:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 655 transitions. [2018-11-18 11:14:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:14:16,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 293 states and 661 transitions. [2018-11-18 11:14:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 661 transitions. [2018-11-18 11:14:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:14:18,953 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 299 states and 683 transitions. [2018-11-18 11:14:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 683 transitions. [2018-11-18 11:14:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:14:23,037 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 304 states and 700 transitions. [2018-11-18 11:14:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 700 transitions. [2018-11-18 11:14:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:14:26,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:14:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 306 states and 704 transitions. [2018-11-18 11:14:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 704 transitions. [2018-11-18 11:14:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:14:27,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:14:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:14:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:14:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:14:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:14:30,228 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 45 iterations. [2018-11-18 11:14:30,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 11:14:30 ImpRootNode [2018-11-18 11:14:30,322 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 11:14:30,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:14:30,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:14:30,323 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:14:30,323 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:32" (3/4) ... [2018-11-18 11:14:30,325 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:14:30,415 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1d6e0571-009c-4ab7-9524-4e6b3c287be1/bin-2019/ukojak/witness.graphml [2018-11-18 11:14:30,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:14:30,416 INFO L168 Benchmark]: Toolchain (without parser) took 120024.88 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 958.2 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,417 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:14:30,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,418 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:14:30,418 INFO L168 Benchmark]: RCFGBuilder took 1958.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -9.6 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,418 INFO L168 Benchmark]: CodeCheck took 117593.92 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,418 INFO L168 Benchmark]: Witness Printer took 92.83 ms. Allocated memory is still 2.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:30,422 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, 148 locations, 1 error locations. UNSAFE Result, 117.4s OverallTime, 45 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1464498060 SDslu, 897435404 SDs, 0 SdLazy, 555933554 SolverSat, -759478406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12917 GetRequests, 11171 SyntacticMatches, 760 SemanticMatches, 986 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608514 ImplicationChecksByTransitivity, 104.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1259 ConstructedInterpolants, 0 QuantifiedInterpolants, 521418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 10 PerfectInterpolantSequences, 153/792 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: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L606] CALL, EXPR init() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND TRUE \read(r131) [L315] COND TRUE \read(ep32) [L316] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND TRUE \read(r211) [L354] COND TRUE \read(ep13) [L355] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND FALSE !(\read(r311)) [L366] COND TRUE \read(r321) [L367] COND TRUE \read(ep21) [L368] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] RET return (tmp___5); [L606] EXPR init() [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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] [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 1 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=29, m2=27, m3=1, max1=0, max2=28, max3=26, 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=0, p21=0, p21_new=-1, p21_old=28, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND TRUE (int )m1 > (int )max1 [L134] max1 = m1 [L135] newmax = (_Bool)1 [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND FALSE !((int )r1 < 1) [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND FALSE !(\read(newmax2)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND FALSE !(\read(newmax3)) [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=28, m2=26, m3=0, max1=28, max2=28, max3=26, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] nl1 = (char)1 [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=-1, m2=-1, m3=-1, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=-1, m2=-1, m3=-1, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=-1, m2=-1, m3=-1, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L652] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=28, id3=26, m1=-1, m2=-1, m3=-1, max1=28, max2=28, max3=26, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1958.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -9.6 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. * CodeCheck took 117593.92 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 92.83 ms. Allocated memory is still 2.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...