./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/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 4e7975b17d935115e9ca07f323e5eabfbd25e139 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:48:40,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:48:40,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:48:40,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:48:40,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:48:40,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:48:40,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:48:40,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:48:40,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:48:40,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:48:40,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:48:40,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:48:40,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:48:40,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:48:40,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:48:40,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:48:40,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:48:40,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:48:40,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:48:40,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:48:40,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:48:40,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:48:40,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:48:40,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:48:40,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:48:40,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:48:40,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:48:40,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:48:40,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:48:40,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:48:40,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:48:40,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:48:40,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:48:40,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:48:40,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:48:40,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:48:40,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:48:40,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:48:40,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:48:40,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:48:40,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:48:40,089 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 02:48:40,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:48:40,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:48:40,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 02:48:40,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 02:48:40,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:48:40,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:48:40,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:48:40,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:48:40,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:48:40,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:48:40,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:48:40,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:48:40,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:48:40,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:48:40,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:48:40,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:48:40,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:48:40,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:48:40,115 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 02:48:40,115 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 02:48:40,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:48:40,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:48:40,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 02:48:40,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:48:40,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:48:40,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:48:40,116 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 02:48:40,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:48:40,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:48:40,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/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 -> 4e7975b17d935115e9ca07f323e5eabfbd25e139 [2019-11-20 02:48:40,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:48:40,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:48:40,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:48:40,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:48:40,314 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:48:40,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-11-20 02:48:40,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/data/0a3712c03/22457ab01d05472c8af82684856ead6b/FLAG9b00f6177 [2019-11-20 02:48:40,827 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:48:40,828 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-11-20 02:48:40,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/data/0a3712c03/22457ab01d05472c8af82684856ead6b/FLAG9b00f6177 [2019-11-20 02:48:41,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/data/0a3712c03/22457ab01d05472c8af82684856ead6b [2019-11-20 02:48:41,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:48:41,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:48:41,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:48:41,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:48:41,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:48:41,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92a6523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41, skipping insertion in model container [2019-11-20 02:48:41,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,179 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:48:41,229 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:48:41,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:48:41,587 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:48:41,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:48:41,665 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:48:41,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41 WrapperNode [2019-11-20 02:48:41,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:48:41,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:48:41,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:48:41,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:48:41,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:48:41,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:48:41,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:48:41,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:48:41,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... [2019-11-20 02:48:41,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:48:41,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:48:41,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:48:41,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:48:41,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:48:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/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 [2019-11-20 02:48:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:48:41,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:48:44,276 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:48:44,276 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 02:48:44,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:48:44 BoogieIcfgContainer [2019-11-20 02:48:44,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:48:44,278 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 02:48:44,278 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 02:48:44,288 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 02:48:44,288 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:48:44" (1/1) ... [2019-11-20 02:48:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:48:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2019-11-20 02:48:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2019-11-20 02:48:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 02:48:44,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2019-11-20 02:48:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2019-11-20 02:48:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 02:48:44,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2019-11-20 02:48:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2019-11-20 02:48:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 02:48:45,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2019-11-20 02:48:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2019-11-20 02:48:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 02:48:46,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2019-11-20 02:48:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2019-11-20 02:48:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:48:47,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2019-11-20 02:48:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2019-11-20 02:48:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:48:48,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2019-11-20 02:48:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2019-11-20 02:48:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 02:48:49,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2019-11-20 02:48:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2019-11-20 02:48:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 02:48:49,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2019-11-20 02:48:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2019-11-20 02:48:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 02:48:49,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2019-11-20 02:48:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2019-11-20 02:48:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:48:51,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2019-11-20 02:48:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2019-11-20 02:48:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:48:52,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:48:53,219 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2019-11-20 02:48:53,495 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-20 02:48:53,738 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 35 [2019-11-20 02:48:53,988 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 37 [2019-11-20 02:48:54,475 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 43 [2019-11-20 02:48:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:48:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:48:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 77 states and 140 transitions. [2019-11-20 02:48:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 140 transitions. [2019-11-20 02:48:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 02:48:59,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:48:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:01,573 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 02:49:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 94 states and 172 transitions. [2019-11-20 02:49:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2019-11-20 02:49:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 02:49:05,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 95 states and 175 transitions. [2019-11-20 02:49:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2019-11-20 02:49:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:49:06,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 113 states and 209 transitions. [2019-11-20 02:49:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 209 transitions. [2019-11-20 02:49:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:49:13,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 114 states and 210 transitions. [2019-11-20 02:49:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 210 transitions. [2019-11-20 02:49:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:49:13,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 115 states and 214 transitions. [2019-11-20 02:49:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 214 transitions. [2019-11-20 02:49:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:49:14,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:17,544 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-20 02:49:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 129 states and 242 transitions. [2019-11-20 02:49:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 242 transitions. [2019-11-20 02:49:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:49:20,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 132 states and 250 transitions. [2019-11-20 02:49:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 250 transitions. [2019-11-20 02:49:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:49:22,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 133 states and 251 transitions. [2019-11-20 02:49:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 251 transitions. [2019-11-20 02:49:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:49:22,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:49:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:49:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:49:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 134 states and 256 transitions. [2019-11-20 02:49:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 256 transitions. [2019-11-20 02:49:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 02:49:23,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:49:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:49:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:49:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:49:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:49:24,399 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2019-11-20 02:49:24,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 02:49:24 ImpRootNode [2019-11-20 02:49:24,523 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 02:49:24,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:49:24,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:49:24,524 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:49:24,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:48:44" (3/4) ... [2019-11-20 02:49:24,527 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 02:49:24,743 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_89a607fe-8044-4a3e-8a93-80d1abccffef/bin/ukojak/witness.graphml [2019-11-20 02:49:24,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:49:24,744 INFO L168 Benchmark]: Toolchain (without parser) took 43580.66 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 635.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 430.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,745 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:49:24,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,746 INFO L168 Benchmark]: Boogie Preprocessor took 52.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:49:24,746 INFO L168 Benchmark]: RCFGBuilder took 2499.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,747 INFO L168 Benchmark]: CodeCheck took 40245.20 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -122.9 MB). Peak memory consumption was 366.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,747 INFO L168 Benchmark]: Witness Printer took 219.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:49:24,749 INFO L335 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, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 40.0s, OverallIterations: 21, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9230880 SDtfs, 4056328 SDslu, 3262272 SDs, 0 SdLazy, 26295166 SolverSat, 5861946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3265 GetRequests, 2766 SyntacticMatches, 121 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80324 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 58948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 20/60 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 601]: 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] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND TRUE \read(r131) [L278] COND TRUE \read(ep32) [L279] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND TRUE \read(ep13) [L318] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND TRUE \read(r321) [L330] COND TRUE \read(ep21) [L331] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] return (tmp___5); [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=-128, m2=3, m3=127, max1=126, max2=2, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 1 [L137] COND TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND TRUE (int )m3 > (int )max3 [L212] max3 = m3 [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L476] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L503] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] [L601] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=2, id3=0, m1=2, m2=0, m3=126, max1=126, max2=2, max3=126, mode1=0, mode2=0, mode3=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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 501.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2499.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. * CodeCheck took 40245.20 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -122.9 MB). Peak memory consumption was 366.3 MB. Max. memory is 11.5 GB. * Witness Printer took 219.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...