./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 23:46:27,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:46:27,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:46:27,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:46:27,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:46:27,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:46:27,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:46:27,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:46:27,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:46:27,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:46:27,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:46:27,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:46:27,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:46:27,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:46:27,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:46:27,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:46:27,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:46:27,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:46:27,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:46:27,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:46:27,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:46:27,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:46:27,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:46:27,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:46:27,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:46:27,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:46:27,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:46:27,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:46:27,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:46:27,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:46:27,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:46:27,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:46:27,852 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:46:27,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:46:27,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:46:27,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:46:27,854 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-12-08 23:46:27,862 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:46:27,862 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:46:27,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 23:46:27,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 23:46:27,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 23:46:27,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:46:27,865 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:46:27,865 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:46:27,865 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 23:46:27,865 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 23:46:27,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:46:27,865 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:46:27,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 23:46:27,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:46:27,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:46:27,866 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 23:46:27,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:46:27,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_6903837d-e773-4ec7-87f4-5e4760bf2c65/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2018-12-08 23:46:27,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:46:27,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:46:27,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:46:27,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:46:27,893 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:46:27,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-12-08 23:46:27,928 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/data/89140ef90/211476f48b124794adb1b2ca4e9ed0ed/FLAGf398dba63 [2018-12-08 23:46:28,297 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:46:28,297 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-12-08 23:46:28,301 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/data/89140ef90/211476f48b124794adb1b2ca4e9ed0ed/FLAGf398dba63 [2018-12-08 23:46:28,309 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/data/89140ef90/211476f48b124794adb1b2ca4e9ed0ed [2018-12-08 23:46:28,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:46:28,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:46:28,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:46:28,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:46:28,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:46:28,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf0b28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28, skipping insertion in model container [2018-12-08 23:46:28,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:46:28,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:46:28,434 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:46:28,442 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:46:28,455 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:46:28,466 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:46:28,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28 WrapperNode [2018-12-08 23:46:28,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:46:28,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:46:28,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:46:28,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:46:28,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:46:28,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:46:28,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:46:28,525 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:46:28,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:46:28,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:46:28,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:46:28,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:46:28,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:46:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/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 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:46:28,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 23:46:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 23:46:28,818 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:46:28,818 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 23:46:28,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:46:28 BoogieIcfgContainer [2018-12-08 23:46:28,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:46:28,818 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 23:46:28,818 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 23:46:28,825 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 23:46:28,825 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:46:28" (1/1) ... [2018-12-08 23:46:28,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 33 states and 37 transitions. [2018-12-08 23:46:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-08 23:46:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 23:46:28,854 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:28,947 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 23:46:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 32 states and 36 transitions. [2018-12-08 23:46:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-08 23:46:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 23:46:28,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:29,015 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 23:46:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 34 states and 38 transitions. [2018-12-08 23:46:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-08 23:46:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-08 23:46:29,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 36 states and 40 transitions. [2018-12-08 23:46:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-08 23:46:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 23:46:29,318 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 38 states and 42 transitions. [2018-12-08 23:46:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-08 23:46:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 23:46:29,626 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 40 states and 44 transitions. [2018-12-08 23:46:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-08 23:46:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:46:29,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 42 states and 46 transitions. [2018-12-08 23:46:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-08 23:46:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 23:46:30,257 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 44 states and 48 transitions. [2018-12-08 23:46:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-08 23:46:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 23:46:30,591 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 46 states and 50 transitions. [2018-12-08 23:46:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-08 23:46:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 23:46:30,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 48 states and 52 transitions. [2018-12-08 23:46:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-08 23:46:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 23:46:31,414 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 50 states and 54 transitions. [2018-12-08 23:46:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-08 23:46:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:46:31,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 49 states and 53 transitions. [2018-12-08 23:46:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-08 23:46:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:46:33,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 50 states and 53 transitions. [2018-12-08 23:46:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-08 23:46:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 23:46:33,971 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 52 states and 58 transitions. [2018-12-08 23:46:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-08 23:46:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 23:46:34,880 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-08 23:46:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 54 states and 61 transitions. [2018-12-08 23:46:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-12-08 23:46:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:46:35,250 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2018-12-08 23:46:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-12-08 23:46:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:46:37,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 59 states and 73 transitions. [2018-12-08 23:46:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-12-08 23:46:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 23:46:44,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 63 states and 85 transitions. [2018-12-08 23:46:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2018-12-08 23:46:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 23:46:45,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 65 states and 89 transitions. [2018-12-08 23:46:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2018-12-08 23:46:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:46:46,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 67 states and 92 transitions. [2018-12-08 23:46:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2018-12-08 23:46:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:46:47,966 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 70 states and 100 transitions. [2018-12-08 23:46:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2018-12-08 23:46:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:46:54,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 71 states and 102 transitions. [2018-12-08 23:46:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-12-08 23:46:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:46:55,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-08 23:46:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 71 states and 101 transitions. [2018-12-08 23:46:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2018-12-08 23:46:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:46:55,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-08 23:46:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 72 states and 104 transitions. [2018-12-08 23:46:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2018-12-08 23:46:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:46:56,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 94 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 23:46:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 73 states and 104 transitions. [2018-12-08 23:46:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2018-12-08 23:46:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 23:46:56,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:46:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:46:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 76 states and 111 transitions. [2018-12-08 23:46:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-12-08 23:46:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 23:46:57,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:46:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 80 states and 116 transitions. [2018-12-08 23:47:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2018-12-08 23:47:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 23:47:02,663 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-08 23:47:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 80 states and 115 transitions. [2018-12-08 23:47:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2018-12-08 23:47:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:47:03,096 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 83 states and 122 transitions. [2018-12-08 23:47:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2018-12-08 23:47:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:47:04,741 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 88 states and 128 transitions. [2018-12-08 23:47:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2018-12-08 23:47:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:47:10,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-08 23:47:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 88 states and 127 transitions. [2018-12-08 23:47:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2018-12-08 23:47:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 23:47:11,448 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 91 states and 134 transitions. [2018-12-08 23:47:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2018-12-08 23:47:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 23:47:13,067 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 97 states and 141 transitions. [2018-12-08 23:47:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2018-12-08 23:47:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 23:47:19,836 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-08 23:47:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 97 states and 140 transitions. [2018-12-08 23:47:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2018-12-08 23:47:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 23:47:20,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 100 states and 147 transitions. [2018-12-08 23:47:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2018-12-08 23:47:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 23:47:23,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 109 states and 158 transitions. [2018-12-08 23:47:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2018-12-08 23:47:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 23:47:35,310 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-08 23:47:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 109 states and 157 transitions. [2018-12-08 23:47:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2018-12-08 23:47:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 23:47:36,310 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 112 states and 164 transitions. [2018-12-08 23:47:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2018-12-08 23:47:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 23:47:39,483 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 23:47:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 113 states and 170 transitions. [2018-12-08 23:47:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2018-12-08 23:47:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 23:47:40,578 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 118 states and 176 transitions. [2018-12-08 23:47:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2018-12-08 23:47:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 23:47:49,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:47:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 121 states and 184 transitions. [2018-12-08 23:47:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-12-08 23:47:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 23:47:53,019 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-12-08 23:47:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:47:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 121 states and 182 transitions. [2018-12-08 23:47:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2018-12-08 23:47:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 23:47:54,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:47:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:48:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 127 states and 189 transitions. [2018-12-08 23:48:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2018-12-08 23:48:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 23:48:05,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:48:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 130 states and 197 transitions. [2018-12-08 23:48:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2018-12-08 23:48:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 23:48:08,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:48:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 139 states and 207 transitions. [2018-12-08 23:48:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 207 transitions. [2018-12-08 23:48:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 23:48:23,598 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-12-08 23:48:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 139 states and 206 transitions. [2018-12-08 23:48:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2018-12-08 23:48:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 23:48:24,736 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:48:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 142 states and 210 transitions. [2018-12-08 23:48:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-08 23:48:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 23:48:29,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-08 23:48:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 142 states and 208 transitions. [2018-12-08 23:48:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2018-12-08 23:48:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 23:48:30,255 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 100 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 23:48:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 74 states and 76 transitions. [2018-12-08 23:48:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-08 23:48:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 23:48:51,239 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-12-08 23:48:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 76 states and 80 transitions. [2018-12-08 23:48:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-08 23:48:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 23:48:52,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-08 23:48:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 78 states and 83 transitions. [2018-12-08 23:48:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-12-08 23:48:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 23:48:57,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:48:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:48:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 79 states and 85 transitions. [2018-12-08 23:48:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-12-08 23:48:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 23:48:59,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:48:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 82 states and 91 transitions. [2018-12-08 23:49:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-12-08 23:49:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 23:49:08,043 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 82 states and 90 transitions. [2018-12-08 23:49:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-08 23:49:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 23:49:10,303 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-08 23:49:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 85 states and 98 transitions. [2018-12-08 23:49:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-12-08 23:49:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 23:49:19,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 85 states and 97 transitions. [2018-12-08 23:49:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2018-12-08 23:49:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 23:49:20,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 87 states and 100 transitions. [2018-12-08 23:49:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-12-08 23:49:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 23:49:25,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 88 states and 101 transitions. [2018-12-08 23:49:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2018-12-08 23:49:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 23:49:29,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-08 23:49:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 91 states and 111 transitions. [2018-12-08 23:49:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2018-12-08 23:49:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 23:49:37,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 94 states and 116 transitions. [2018-12-08 23:49:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2018-12-08 23:49:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 23:49:41,367 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-08 23:49:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 95 states and 117 transitions. [2018-12-08 23:49:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2018-12-08 23:49:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 23:49:44,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-08 23:49:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 97 states and 121 transitions. [2018-12-08 23:49:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2018-12-08 23:49:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 23:49:49,063 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 98 states and 122 transitions. [2018-12-08 23:49:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2018-12-08 23:49:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 23:49:50,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-12-08 23:49:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 80 states and 85 transitions. [2018-12-08 23:49:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-12-08 23:49:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 23:49:51,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:49:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:49:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 83 states and 90 transitions. [2018-12-08 23:49:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-12-08 23:49:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 23:49:56,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:49:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 85 states and 91 transitions. [2018-12-08 23:50:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-12-08 23:50:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 23:50:01,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 88 states and 96 transitions. [2018-12-08 23:50:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-12-08 23:50:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 23:50:05,948 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 90 states and 97 transitions. [2018-12-08 23:50:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-12-08 23:50:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 23:50:09,298 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 93 states and 102 transitions. [2018-12-08 23:50:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-08 23:50:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 23:50:14,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 95 states and 103 transitions. [2018-12-08 23:50:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-12-08 23:50:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 23:50:18,355 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 98 states and 108 transitions. [2018-12-08 23:50:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-12-08 23:50:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 23:50:22,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 100 states and 109 transitions. [2018-12-08 23:50:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-12-08 23:50:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:50:24,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 103 states and 114 transitions. [2018-12-08 23:50:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-08 23:50:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:50:30,094 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 105 states and 115 transitions. [2018-12-08 23:50:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-08 23:50:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 23:50:34,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 108 states and 120 transitions. [2018-12-08 23:50:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-12-08 23:50:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 23:50:39,770 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 110 states and 121 transitions. [2018-12-08 23:50:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-12-08 23:50:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 23:50:42,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 113 states and 125 transitions. [2018-12-08 23:50:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-12-08 23:50:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 23:50:47,238 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-08 23:50:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 115 states and 125 transitions. [2018-12-08 23:50:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-12-08 23:50:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 23:50:48,760 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:50:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:50:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:50:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:50:49,513 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 78 iterations. [2018-12-08 23:50:49,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 11:50:49 ImpRootNode [2018-12-08 23:50:49,578 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 23:50:49,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:50:49,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:50:49,579 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:50:49,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:46:28" (3/4) ... [2018-12-08 23:50:49,580 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 23:50:49,641 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6903837d-e773-4ec7-87f4-5e4760bf2c65/bin-2019/ukojak/witness.graphml [2018-12-08 23:50:49,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:50:49,642 INFO L168 Benchmark]: Toolchain (without parser) took 261330.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.0 MB in the beginning and 959.9 MB in the end (delta: -3.9 MB). Peak memory consumption was 144.5 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,643 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:50:49,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,643 INFO L168 Benchmark]: Boogie Preprocessor took 21.23 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,643 INFO L168 Benchmark]: RCFGBuilder took 272.32 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,644 INFO L168 Benchmark]: CodeCheck took 260759.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 966.3 MB in the end (delta: 141.8 MB). Peak memory consumption was 136.5 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,644 INFO L168 Benchmark]: Witness Printer took 62.86 ms. Allocated memory is still 1.2 GB. Free memory was 966.3 MB in the beginning and 959.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:50:49,645 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, 53 locations, 17 error locations. UNSAFE Result, 260.6s OverallTime, 78 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1086324736 SDtfs, 577404926 SDslu, 1073741824 SDs, 0 SdLazy, 727274800 SolverSat, -915374086 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22319 GetRequests, 20262 SyntacticMatches, 949 SemanticMatches, 1108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719924 ImplicationChecksByTransitivity, 255.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 3477 NumberOfCodeBlocks, 3477 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3314 ConstructedInterpolants, 0 QuantifiedInterpolants, 880331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 77 InterpolantComputations, 27 PerfectInterpolantSequences, 11428/13395 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: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L8] int i = 0; VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L8] COND FALSE !(i < 10) [L12] return array; [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L18] COND FALSE !(i < 10) [L21] return numbers2; [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L27] COND FALSE !(i < 10) [L31] return numbers3; [L31] return numbers3; [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L37] COND TRUE i < 10 VAL [array={18:0}, numbers2={11:0}, numbers4={13:0}] [L38] numbers[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.23 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 272.32 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * CodeCheck took 260759.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 966.3 MB in the end (delta: 141.8 MB). Peak memory consumption was 136.5 MB. Max. memory is 11.5 GB. * Witness Printer took 62.86 ms. Allocated memory is still 1.2 GB. Free memory was 966.3 MB in the beginning and 959.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...