./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i --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_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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 62ed6df4fdaf468f52c0eff1159abadc4f432e3d ............................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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 62ed6df4fdaf468f52c0eff1159abadc4f432e3d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:01:45,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:01:45,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:01:45,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:01:45,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:01:45,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:01:45,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:01:45,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:01:45,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:01:45,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:01:45,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:01:45,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:01:45,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:01:45,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:01:45,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:01:45,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:01:45,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:01:45,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:01:45,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:01:45,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:01:45,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:01:45,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:01:45,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:01:45,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:01:45,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:01:45,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:01:45,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:01:45,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:01:45,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:01:45,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:01:45,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:01:45,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:01:45,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:01:45,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:01:45,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:01:45,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:01:45,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-12-01 17:01:45,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:01:45,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:01:45,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:01:45,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:01:45,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:01:45,627 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:01:45,628 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 17:01:45,628 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 17:01:45,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:01:45,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:01:45,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 17:01:45,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:01:45,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:01:45,629 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 17:01:45,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:01:45,629 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_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2018-12-01 17:01:45,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:01:45,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:01:45,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:01:45,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:01:45,656 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:01:45,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-01 17:01:45,688 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/7e530c6ed/86f854b37c5e4b418276195d5ba463cb/FLAG64405261d [2018-12-01 17:01:46,123 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:01:46,123 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-01 17:01:46,130 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/7e530c6ed/86f854b37c5e4b418276195d5ba463cb/FLAG64405261d [2018-12-01 17:01:46,138 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/7e530c6ed/86f854b37c5e4b418276195d5ba463cb [2018-12-01 17:01:46,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:01:46,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:01:46,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:46,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:01:46,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:01:46,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fe4f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46, skipping insertion in model container [2018-12-01 17:01:46,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:01:46,167 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:01:46,305 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:46,311 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:01:46,363 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:46,383 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:01:46,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46 WrapperNode [2018-12-01 17:01:46,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:46,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:46,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:01:46,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:01:46,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:46,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:01:46,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:01:46,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:01:46,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:01:46,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:01:46,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:01:46,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:01:46,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 17:01:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:01:46,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:01:46,652 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:01:46,652 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-01 17:01:46,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:46 BoogieIcfgContainer [2018-12-01 17:01:46,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:01:46,653 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 17:01:46,653 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 17:01:46,663 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 17:01:46,663 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:46" (1/1) ... [2018-12-01 17:01:46,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 32 states and 36 transitions. [2018-12-01 17:01:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-01 17:01:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 17:01:46,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:46,770 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-01 17:01:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 32 states and 35 transitions. [2018-12-01 17:01:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 17:01:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:46,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:46,814 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-01 17:01:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 35 states and 40 transitions. [2018-12-01 17:01:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-01 17:01:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:46,845 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:46,881 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-01 17:01:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2018-12-01 17:01:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-01 17:01:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:47,012 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,022 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-01 17:01:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 39 states and 46 transitions. [2018-12-01 17:01:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-01 17:01:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:47,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,041 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-01 17:01:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 40 states and 47 transitions. [2018-12-01 17:01:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-01 17:01:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 17:01:47,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,059 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-01 17:01:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 39 states and 46 transitions. [2018-12-01 17:01:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-01 17:01:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 17:01:47,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,082 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-01 17:01:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 40 states and 47 transitions. [2018-12-01 17:01:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-01 17:01:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:47,096 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,115 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-01 17:01:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 39 states and 46 transitions. [2018-12-01 17:01:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-01 17:01:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:47,125 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,145 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-01 17:01:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 41 states and 49 transitions. [2018-12-01 17:01:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-01 17:01:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:47,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,185 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-01 17:01:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 45 states and 56 transitions. [2018-12-01 17:01:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-12-01 17:01:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:47,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,411 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-01 17:01:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 51 states and 68 transitions. [2018-12-01 17:01:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2018-12-01 17:01:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:47,630 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,653 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-01 17:01:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-12-01 17:01:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-12-01 17:01:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:47,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,839 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-01 17:01:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 56 states and 78 transitions. [2018-12-01 17:01:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2018-12-01 17:01:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:47,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:47,963 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-01 17:01:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 55 states and 77 transitions. [2018-12-01 17:01:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-12-01 17:01:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:48,129 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:48,139 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-01 17:01:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 54 states and 76 transitions. [2018-12-01 17:01:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2018-12-01 17:01:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:48,149 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:48,178 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-01 17:01:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 55 states and 80 transitions. [2018-12-01 17:01:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2018-12-01 17:01:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:01:48,194 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:48,238 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. [2018-12-01 17:01:48,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:01:48 ImpRootNode [2018-12-01 17:01:48,261 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 17:01:48,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:01:48,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:01:48,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:01:48,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:46" (3/4) ... [2018-12-01 17:01:48,265 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:01:48,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:01:48,266 INFO L168 Benchmark]: Toolchain (without parser) took 2126.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -195.3 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:01:48,267 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:01:48,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-01 17:01:48,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:01:48,268 INFO L168 Benchmark]: Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:01:48,268 INFO L168 Benchmark]: RCFGBuilder took 227.81 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-01 17:01:48,269 INFO L168 Benchmark]: CodeCheck took 1607.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-01 17:01:48,269 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:01:48,272 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, 42 locations, 15 error locations. UNSAFE Result, 1.5s OverallTime, 17 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 527104 SDtfs, 238804 SDslu, 299200 SDs, 0 SdLazy, 694866 SolverSat, 259142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 784 SyntacticMatches, 24 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 3016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); [L628] COND FALSE !(a == 0) [L629] List t; [L630] List p = a; [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 [L639] p->n = 0 [L640] p = a [L641] COND TRUE p!=0 [L642] EXPR p->h [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n [L645] p = p->n [L641] COND FALSE !(p!=0) [L647] return 0; * 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 227.81 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * CodeCheck took 1607.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:01:49,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:01:49,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:01:49,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:01:49,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:01:49,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:01:49,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:01:49,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:01:49,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:01:49,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:01:49,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:01:49,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:01:49,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:01:49,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:01:49,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:01:49,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:01:49,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:01:49,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:01:49,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:01:49,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:01:49,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:01:49,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:01:49,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:01:49,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:01:49,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:01:49,640 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:01:49,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:01:49,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:01:49,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:01:49,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:01:49,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:01:49,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:01:49,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:01:49,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:01:49,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:01:49,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:01:49,644 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-12-01 17:01:49,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:01:49,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:01:49,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:01:49,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:01:49,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:01:49,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:01:49,652 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:01:49,653 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:01:49,654 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 17:01:49,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 17:01:49,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:01:49,654 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 17:01:49,655 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2018-12-01 17:01:49,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:01:49,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:01:49,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:01:49,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:01:49,686 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:01:49,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-01 17:01:49,732 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/fbb5f34dc/0873e032fa3747359b2ca15407457307/FLAGa9e87f2a7 [2018-12-01 17:01:50,150 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:01:50,151 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-01 17:01:50,156 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/fbb5f34dc/0873e032fa3747359b2ca15407457307/FLAGa9e87f2a7 [2018-12-01 17:01:50,164 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/bin-2019/ukojak/data/fbb5f34dc/0873e032fa3747359b2ca15407457307 [2018-12-01 17:01:50,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:01:50,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:01:50,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:50,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:01:50,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:01:50,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5554d819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50, skipping insertion in model container [2018-12-01 17:01:50,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:01:50,193 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:01:50,336 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:50,344 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:01:50,368 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:50,434 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:01:50,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50 WrapperNode [2018-12-01 17:01:50,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:50,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:50,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:01:50,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:01:50,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:50,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:01:50,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:01:50,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:01:50,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:01:50,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:01:50,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:01:50,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:01:50,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d33b619b-ce23-45e3-b9f5-b11517bfeedf/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-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-01 17:01:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:01:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:01:50,786 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:01:50,787 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-01 17:01:50,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:50 BoogieIcfgContainer [2018-12-01 17:01:50,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:01:50,787 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 17:01:50,787 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 17:01:50,794 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 17:01:50,794 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:50" (1/1) ... [2018-12-01 17:01:50,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 31 states and 34 transitions. [2018-12-01 17:01:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 17:01:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 17:01:50,826 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:50,860 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:50,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:50,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:01:50,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:50,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:01:50,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:50,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:50,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:50,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-12-01 17:01:50,960 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-01 17:01:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 33 states and 39 transitions. [2018-12-01 17:01:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-01 17:01:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 17:01:51,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,031 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:51,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:51,067 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-01 17:01:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 35 states and 43 transitions. [2018-12-01 17:01:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-12-01 17:01:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 17:01:51,349 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,350 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:01:51,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:01:51,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-12-01 17:01:51,393 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-01 17:01:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2018-12-01 17:01:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-12-01 17:01:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 17:01:51,410 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,411 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:51,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:51,425 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-01 17:01:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 37 states and 46 transitions. [2018-12-01 17:01:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-12-01 17:01:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:51,440 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,441 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:51,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:51,471 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-01 17:01:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 38 states and 49 transitions. [2018-12-01 17:01:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-12-01 17:01:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 17:01:51,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,514 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,546 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-01 17:01:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2018-12-01 17:01:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-12-01 17:01:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 17:01:51,657 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,658 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:01:51,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:01:51,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-12-01 17:01:51,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 17:01:51,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2018-12-01 17:01:51,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 17:01:51,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:62 [2018-12-01 17:01:51,805 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-01 17:01:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 37 states and 47 transitions. [2018-12-01 17:01:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-12-01 17:01:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 17:01:51,891 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:51,892 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:51,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:51,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:51,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:01:51,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:01:51,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:51,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2018-12-01 17:01:51,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-12-01 17:01:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-12-01 17:01:51,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:52,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:52,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:52,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:52,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-01 17:01:52,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:52,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:52,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:52,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-01 17:01:52,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:52,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:01:52,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:18 [2018-12-01 17:01:52,083 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-01 17:01:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 39 states and 51 transitions. [2018-12-01 17:01:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-12-01 17:01:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:52,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:52,328 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:52,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:52,337 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-01 17:01:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 38 states and 50 transitions. [2018-12-01 17:01:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2018-12-01 17:01:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:52,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:52,371 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:52,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:52,471 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-01 17:01:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 37 states and 49 transitions. [2018-12-01 17:01:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-12-01 17:01:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:52,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:52,903 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:52,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:52,983 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-01 17:01:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 40 states and 56 transitions. [2018-12-01 17:01:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-01 17:01:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:53,809 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:53,810 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:53,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:53,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 17:01:53,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:53,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 17:01:53,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 17:01:53,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:53,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 17:01:53,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-12-01 17:01:53,842 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-01 17:01:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 45 states and 67 transitions. [2018-12-01 17:01:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2018-12-01 17:01:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:01:54,568 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:54,569 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:54,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:54,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:54,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:54,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:54,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:54,583 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-01 17:01:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 50 states and 76 transitions. [2018-12-01 17:01:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2018-12-01 17:01:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:55,034 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:55,035 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:55,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:55,042 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-01 17:01:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 49 states and 75 transitions. [2018-12-01 17:01:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-12-01 17:01:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:01:55,058 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:55,059 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:55,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:55,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:55,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:55,087 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-01 17:01:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 50 states and 80 transitions. [2018-12-01 17:01:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2018-12-01 17:01:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:55,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:55,182 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:55,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:55,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:55,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:01:55,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:55,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:55,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-01 17:01:55,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-01 17:01:55,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-01 17:01:55,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:55,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-01 17:01:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:01:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 53 states and 85 transitions. [2018-12-01 17:01:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2018-12-01 17:01:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:57,287 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:57,287 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:57,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:57,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:57,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:57,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:57,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:57,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:57,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:57,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-12-01 17:01:57,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 17:01:57,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-01 17:01:57,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-01 17:01:57,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-01 17:01:57,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:57,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-12-01 17:01:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:01:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 42 states and 66 transitions. [2018-12-01 17:01:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-12-01 17:01:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:59,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:59,252 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:59,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:59,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:01:59,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:59,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:59,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-01 17:01:59,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-01 17:01:59,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-01 17:01:59,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-01 17:01:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:01:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 41 states and 65 transitions. [2018-12-01 17:01:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2018-12-01 17:01:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:01:59,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:59,313 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:59,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:59,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 17:01:59,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:01:59,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:59,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:59,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 17:01:59,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 17:01:59,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-12-01 17:01:59,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 17:01:59,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-01 17:01:59,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-01 17:01:59,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-01 17:01:59,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-12-01 17:01:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:01:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:01:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 37 states and 57 transitions. [2018-12-01 17:01:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2018-12-01 17:01:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 17:01:59,410 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:01:59,411 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:01:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:59,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:59,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 17:01:59,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 17:01:59,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 17:01:59,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 17:01:59,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-01 17:01:59,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 17:01:59,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 17:01:59,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 17:01:59,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 17:01:59,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:59,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-01 17:02:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:02:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:02:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 43 states and 69 transitions. [2018-12-01 17:02:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2018-12-01 17:02:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 17:02:02,437 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:02:02,438 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 17:02:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:02:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:02:02,484 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2018-12-01 17:02:02,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:02:02 ImpRootNode [2018-12-01 17:02:02,500 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 17:02:02,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:02:02,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:02:02,501 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:02:02,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:50" (3/4) ... [2018-12-01 17:02:02,504 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:02:02,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:02:02,504 INFO L168 Benchmark]: Toolchain (without parser) took 12337.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 145.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,505 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:02:02,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.94 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,506 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,506 INFO L168 Benchmark]: RCFGBuilder took 305.61 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,506 INFO L168 Benchmark]: CodeCheck took 11713.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:02:02,507 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:02:02,508 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, 41 locations, 15 error locations. UNSAFE Result, 11.6s OverallTime, 21 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3229696 SDtfs, 3380620 SDslu, 4270924 SDs, 0 SdLazy, 16342948 SolverSat, 4884480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1272 GetRequests, 1118 SyntacticMatches, 28 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6486 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 115 ConstructedInterpolants, 4 QuantifiedInterpolants, 6712 SizeOfPredicates, 61 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 7/8 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 - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); [L628] COND FALSE !(a == 0) [L629] List t; [L630] List p = a; [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 [L639] p->n = 0 [L640] p = a [L641] COND TRUE p!=0 [L642] EXPR p->h [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n [L645] p = p->n [L641] COND FALSE !(p!=0) [L647] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.94 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 305.61 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * CodeCheck took 11713.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...