./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/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 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-08 12:37:30,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:37:30,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:37:30,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:37:30,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:37:30,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:37:30,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:37:30,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:37:30,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:37:30,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:37:30,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:37:30,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:37:30,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:37:30,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:37:30,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:37:30,873 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:37:30,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:37:30,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:37:30,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:37:30,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:37:30,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:37:30,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:37:30,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:37:30,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:37:30,881 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:37:30,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:37:30,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:37:30,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:37:30,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:37:30,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:37:30,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:37:30,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:37:30,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:37:30,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:37:30,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:37:30,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:37:30,886 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 12:37:30,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:37:30,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:37:30,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:37:30,897 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 12:37:30,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:37:30,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:37:30,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:37:30,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:37:30,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:37:30,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 12:37:30,900 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 12:37:30,900 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 12:37:30,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:37:30,900 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:37:30,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:37:30,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:37:30,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:37:30,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 12:37:30,901 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 12:37:30,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:37:30,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 12:37:30,901 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_f5b01f5d-a7e6-457b-818b-bf8ae6275408/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 -> 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 [2018-12-08 12:37:30,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:37:30,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:37:30,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:37:30,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:37:30,932 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:37:30,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 12:37:30,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/data/af985e7a1/fb06959f029542749bf09147e47eb407/FLAG83d947783 [2018-12-08 12:37:31,348 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:37:31,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 12:37:31,354 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/data/af985e7a1/fb06959f029542749bf09147e47eb407/FLAG83d947783 [2018-12-08 12:37:31,721 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/data/af985e7a1/fb06959f029542749bf09147e47eb407 [2018-12-08 12:37:31,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:37:31,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:37:31,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:37:31,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:37:31,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:37:31,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:31,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38efbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31, skipping insertion in model container [2018-12-08 12:37:31,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:31,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:37:31,753 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:37:31,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:37:31,883 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:37:31,953 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:37:31,966 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:37:31,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31 WrapperNode [2018-12-08 12:37:31,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:37:31,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:37:31,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:37:31,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:37:31,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:31,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:37:32,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:37:32,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:37:32,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:37:32,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... [2018-12-08 12:37:32,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:37:32,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:37:32,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:37:32,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:37:32,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/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-12-08 12:37:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:37:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:37:33,538 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:37:33,538 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 12:37:33,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:33 BoogieIcfgContainer [2018-12-08 12:37:33,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:37:33,539 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 12:37:33,539 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 12:37:33,545 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 12:37:33,546 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:33" (1/1) ... [2018-12-08 12:37:33,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-08 12:37:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-08 12:37:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 12:37:33,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-08 12:37:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-08 12:37:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 12:37:33,857 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-08 12:37:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-08 12:37:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 12:37:34,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-08 12:37:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-08 12:37:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 12:37:34,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-08 12:37:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-08 12:37:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 12:37:34,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-08 12:37:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-08 12:37:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 12:37:35,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-08 12:37:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-08 12:37:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:37:36,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-08 12:37:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-08 12:37:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:37:36,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-08 12:37:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-08 12:37:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:37:37,017 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-08 12:37:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-08 12:37:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 12:37:38,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-08 12:37:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-08 12:37:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 12:37:39,028 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-08 12:37:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-08 12:37:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 12:37:42,854 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:43,475 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-08 12:37:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 93 states and 182 transitions. [2018-12-08 12:37:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 182 transitions. [2018-12-08 12:37:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 12:37:46,873 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 94 states and 183 transitions. [2018-12-08 12:37:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 183 transitions. [2018-12-08 12:37:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 12:37:47,139 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 112 states and 223 transitions. [2018-12-08 12:37:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 223 transitions. [2018-12-08 12:37:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 12:37:51,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 113 states and 227 transitions. [2018-12-08 12:37:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 227 transitions. [2018-12-08 12:37:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 12:37:51,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 114 states and 229 transitions. [2018-12-08 12:37:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 229 transitions. [2018-12-08 12:37:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 12:37:52,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:53,295 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-08 12:37:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 133 states and 271 transitions. [2018-12-08 12:37:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 271 transitions. [2018-12-08 12:37:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 12:37:57,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 135 states and 274 transitions. [2018-12-08 12:37:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 274 transitions. [2018-12-08 12:37:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 12:37:58,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:37:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 136 states and 277 transitions. [2018-12-08 12:37:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 277 transitions. [2018-12-08 12:37:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 12:37:58,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:37:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 155 states and 313 transitions. [2018-12-08 12:38:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 313 transitions. [2018-12-08 12:38:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 12:38:05,702 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:05,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 159 states and 325 transitions. [2018-12-08 12:38:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 325 transitions. [2018-12-08 12:38:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 12:38:08,461 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 161 states and 327 transitions. [2018-12-08 12:38:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 327 transitions. [2018-12-08 12:38:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 12:38:09,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 181 states and 368 transitions. [2018-12-08 12:38:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 368 transitions. [2018-12-08 12:38:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 12:38:15,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:18,938 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-08 12:38:20,275 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-08 12:38:21,162 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-08 12:38:22,486 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-08 12:38:23,479 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 12:38:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 200 states and 404 transitions. [2018-12-08 12:38:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 404 transitions. [2018-12-08 12:38:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 12:38:28,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 214 states and 463 transitions. [2018-12-08 12:38:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 463 transitions. [2018-12-08 12:38:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 12:38:40,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:42,482 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-08 12:38:42,923 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-08 12:38:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 219 states and 474 transitions. [2018-12-08 12:38:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 474 transitions. [2018-12-08 12:38:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 12:38:45,754 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 230 states and 492 transitions. [2018-12-08 12:38:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 492 transitions. [2018-12-08 12:38:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 12:38:52,857 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:38:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:38:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 233 states and 501 transitions. [2018-12-08 12:38:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 501 transitions. [2018-12-08 12:38:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 12:38:57,487 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:38:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 243 states and 518 transitions. [2018-12-08 12:39:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 518 transitions. [2018-12-08 12:39:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 12:39:04,536 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 245 states and 524 transitions. [2018-12-08 12:39:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 524 transitions. [2018-12-08 12:39:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 12:39:07,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 246 states and 527 transitions. [2018-12-08 12:39:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 527 transitions. [2018-12-08 12:39:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 12:39:08,277 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 260 states and 569 transitions. [2018-12-08 12:39:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 569 transitions. [2018-12-08 12:39:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 12:39:19,581 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 266 states and 585 transitions. [2018-12-08 12:39:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 585 transitions. [2018-12-08 12:39:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 12:39:22,910 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 267 states and 589 transitions. [2018-12-08 12:39:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 589 transitions. [2018-12-08 12:39:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 12:39:23,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 269 states and 598 transitions. [2018-12-08 12:39:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 598 transitions. [2018-12-08 12:39:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 12:39:24,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:29,300 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-08 12:39:31,365 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-08 12:39:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 274 states and 617 transitions. [2018-12-08 12:39:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 617 transitions. [2018-12-08 12:39:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 12:39:35,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 275 states and 620 transitions. [2018-12-08 12:39:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 620 transitions. [2018-12-08 12:39:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 12:39:36,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 277 states and 631 transitions. [2018-12-08 12:39:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 631 transitions. [2018-12-08 12:39:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 12:39:40,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 282 states and 650 transitions. [2018-12-08 12:39:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2018-12-08 12:39:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 12:39:45,577 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 283 states and 655 transitions. [2018-12-08 12:39:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 655 transitions. [2018-12-08 12:39:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 12:39:46,213 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 287 states and 668 transitions. [2018-12-08 12:39:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 668 transitions. [2018-12-08 12:39:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 12:39:50,671 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:39:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:39:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 292 states and 681 transitions. [2018-12-08 12:39:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 681 transitions. [2018-12-08 12:39:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 12:39:57,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:39:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:40:00,625 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-08 12:40:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:40:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 299 states and 703 transitions. [2018-12-08 12:40:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 703 transitions. [2018-12-08 12:40:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 12:40:10,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:40:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:40:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:40:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:40:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 301 states and 713 transitions. [2018-12-08 12:40:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 713 transitions. [2018-12-08 12:40:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 12:40:14,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:40:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:40:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:40:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:40:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 303 states and 715 transitions. [2018-12-08 12:40:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 715 transitions. [2018-12-08 12:40:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 12:40:18,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:40:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:40:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:40:19,414 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-08 12:40:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:40:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 304 states and 718 transitions. [2018-12-08 12:40:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 718 transitions. [2018-12-08 12:40:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 12:40:20,893 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:40:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:40:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:40:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:40:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 306 states and 728 transitions. [2018-12-08 12:40:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 728 transitions. [2018-12-08 12:40:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 12:40:22,423 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:40:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:40:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:40:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:40:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:40:27,568 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2018-12-08 12:40:27,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 12:40:27 ImpRootNode [2018-12-08 12:40:27,665 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 12:40:27,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:40:27,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:40:27,666 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:40:27,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:33" (3/4) ... [2018-12-08 12:40:27,668 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 12:40:27,753 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5b01f5d-a7e6-457b-818b-bf8ae6275408/bin-2019/ukojak/witness.graphml [2018-12-08 12:40:27,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:40:27,753 INFO L168 Benchmark]: Toolchain (without parser) took 176030.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 961.4 MB in the beginning and 580.1 MB in the end (delta: 381.3 MB). Peak memory consumption was 592.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -104.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: Boogie Preprocessor took 21.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: RCFGBuilder took 1516.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.7 MB). Peak memory consumption was 337.1 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,754 INFO L168 Benchmark]: CodeCheck took 174126.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Free memory was 1.1 GB in the beginning and 598.8 MB in the end (delta: 528.3 MB). Peak memory consumption was 552.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,755 INFO L168 Benchmark]: Witness Printer took 87.25 ms. Allocated memory is still 1.2 GB. Free memory was 598.8 MB in the beginning and 580.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:40:27,755 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, 141 locations, 1 error locations. UNSAFE Result, 174.0s OverallTime, 48 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729677804 SDtfs, -995030604 SDslu, 1618739100 SDs, 0 SdLazy, 1328001076 SolverSat, 1377864936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14386 GetRequests, 12597 SyntacticMatches, 735 SemanticMatches, 1054 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684305 ImplicationChecksByTransitivity, 161.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 466612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 150/797 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: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND TRUE \read(ep32) [L306] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND TRUE \read(r211) [L328] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND TRUE \read(r211) [L344] COND TRUE \read(ep13) [L345] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND TRUE \read(ep21) [L358] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 1 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, 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=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=127, m2=127, m3=-2, max1=1, max2=3, max3=2, 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=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L131] newmax = (_Bool)1 [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND FALSE !((int )r1 < 1) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND FALSE !(\read(newmax2)) [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] nl1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, 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] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, 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] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -104.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1516.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.7 MB). Peak memory consumption was 337.1 MB. Max. memory is 11.5 GB. * CodeCheck took 174126.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Free memory was 1.1 GB in the beginning and 598.8 MB in the end (delta: 528.3 MB). Peak memory consumption was 552.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.25 ms. Allocated memory is still 1.2 GB. Free memory was 598.8 MB in the beginning and 580.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...