./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.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_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ....................................................................................................................................................................................................................................................................................................................................................................................................... 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_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:24:10,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:24:10,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:24:10,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:24:10,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:24:10,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:24:10,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:24:10,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:24:10,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:24:10,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:24:10,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:24:10,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:24:10,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:24:10,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:24:10,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:24:10,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:24:10,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:24:10,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:24:10,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:24:10,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:24:10,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:24:10,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:24:10,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:24:10,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:24:10,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:24:10,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:24:10,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:24:10,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:24:10,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:24:10,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:24:10,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:24:10,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:24:10,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:24:10,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:24:10,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:24:10,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:24:10,845 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-12-01 16:24:10,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:24:10,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:24:10,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:24:10,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:24:10,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 16:24:10,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:24:10,856 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 16:24:10,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 16:24:10,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:24:10,856 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 16:24:10,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:24:10,857 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_2965518f-2db8-4155-84ed-97b29325130d/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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-01 16:24:10,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:24:10,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:24:10,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:24:10,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:24:10,891 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:24:10,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 16:24:10,936 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/0a2ef6639/844c1ac9937644eab2b9a62a06371b85/FLAGfb6828c34 [2018-12-01 16:24:11,375 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:24:11,376 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 16:24:11,381 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/0a2ef6639/844c1ac9937644eab2b9a62a06371b85/FLAGfb6828c34 [2018-12-01 16:24:11,389 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/0a2ef6639/844c1ac9937644eab2b9a62a06371b85 [2018-12-01 16:24:11,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:24:11,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:24:11,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:11,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:24:11,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:24:11,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceaa519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11, skipping insertion in model container [2018-12-01 16:24:11,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:24:11,423 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:24:11,570 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:11,577 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:24:11,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:11,668 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:24:11,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11 WrapperNode [2018-12-01 16:24:11,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:11,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:24:11,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:24:11,668 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:24:11,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:24:11,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:24:11,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:24:11,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:24:11,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:24:11,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:24:11,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:24:11,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:24:11,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/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 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 16:24:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 16:24:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:24:11,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:24:11,975 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:24:11,975 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 16:24:11,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:11 BoogieIcfgContainer [2018-12-01 16:24:11,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:24:11,976 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 16:24:11,976 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 16:24:11,983 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 16:24:11,983 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:11" (1/1) ... [2018-12-01 16:24:11,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-01 16:24:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-01 16:24:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-01 16:24:12,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,108 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 16:24:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-01 16:24:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-01 16:24:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-01 16:24:12,129 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,167 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 16:24:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-01 16:24:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-01 16:24:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-01 16:24:12,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,239 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 16:24:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-01 16:24:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-01 16:24:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-01 16:24:12,251 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,281 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 16:24:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-01 16:24:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-01 16:24:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 16:24:12,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,351 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 16:24:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-01 16:24:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-01 16:24:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 16:24:12,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,398 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 16:24:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-01 16:24:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-01 16:24:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 16:24:12,485 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,562 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 16:24:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-01 16:24:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-01 16:24:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 16:24:12,855 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:12,999 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 16:24:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-01 16:24:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-01 16:24:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:24:13,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,639 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 16:24:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-01 16:24:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-01 16:24:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:24:13,738 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,784 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 16:24:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-01 16:24:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-01 16:24:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:24:14,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,261 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 16:24:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-01 16:24:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-01 16:24:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:24:15,437 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:15,737 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 16:24:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-01 16:24:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-01 16:24:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:24:17,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:17,864 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 16:24:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-01 16:24:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-01 16:24:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:24:20,188 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:20,475 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 16:24:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-01 16:24:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-01 16:24:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:24:23,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:23,378 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 16:24:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-01 16:24:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-01 16:24:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:24:23,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:23,451 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 16:24:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-01 16:24:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-01 16:24:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 16:24:23,582 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:24,340 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 16:24:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-01 16:24:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-01 16:24:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 16:24:27,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:28,009 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 16:24:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-01 16:24:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-01 16:24:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:24:31,915 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:33,001 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 16:24:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-01 16:24:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-01 16:24:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:24:36,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:37,288 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 16:24:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-01 16:24:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-01 16:24:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:24:41,177 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:41,233 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 16:24:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:24:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:24:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:24:42,146 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:42,523 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 16:24:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-01 16:24:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-01 16:24:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:24:44,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:45,781 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 16:24:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:24:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:24:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:24:50,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:50,403 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 16:24:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 29 states and 30 transitions. [2018-12-01 16:24:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-01 16:24:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:24:50,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:50,577 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 16:24:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-01 16:24:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-01 16:24:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:24:53,552 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:53,558 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 16:24:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:24:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:24:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:24:55,169 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:55,283 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. [2018-12-01 16:24:55,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:24:55 ImpRootNode [2018-12-01 16:24:55,309 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 16:24:55,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:24:55,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:24:55,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:24:55,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:11" (3/4) ... [2018-12-01 16:24:55,312 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 16:24:55,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:24:55,313 INFO L168 Benchmark]: Toolchain (without parser) took 43921.85 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.9 MB). Free memory was 954.9 MB in the beginning and 1.5 GB in the end (delta: -523.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:55,314 INFO L168 Benchmark]: CDTParser took 0.15 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 16:24:55,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:55,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:55,314 INFO L168 Benchmark]: Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:55,315 INFO L168 Benchmark]: RCFGBuilder took 266.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:55,315 INFO L168 Benchmark]: CodeCheck took 43333.24 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 395.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -412.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:55,315 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:55,317 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, 58 locations, 29 error locations. UNSAFE Result, 43.2s OverallTime, 27 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 11439050 SDslu, 440 SDs, 0 SdLazy, 536820228 SolverSat, 277706750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1794 GetRequests, 1302 SyntacticMatches, 48 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88889 ImplicationChecksByTransitivity, 42.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 17526 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; [L625] pdata->lo = (int *)malloc(sizeof(int)) [L626] pdata->hi = (int *)malloc(sizeof(int)) [L627] EXPR pdata->lo [L627] *(pdata->lo) = 4 [L628] EXPR pdata->hi [L628] *(pdata->hi) = 8 [L632] EXPR data->lo [L632] int *lo = data->lo; [L633] EXPR data->hi [L633] int *hi = data->hi; [L634] EXPR \read(*lo) [L634] EXPR \read(*hi) [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) [L639] data->hi = ((void *)0) [L645] return 0; [L645] 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * CodeCheck took 43333.24 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 395.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -412.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 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 16:24:56,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:24:56,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:24:56,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:24:56,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:24:56,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:24:56,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:24:56,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:24:56,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:24:56,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:24:56,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:24:56,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:24:56,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:24:56,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:24:56,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:24:56,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:24:56,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:24:56,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:24:56,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:24:56,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:24:56,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:24:56,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:24:56,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:24:56,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:24:56,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:24:56,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:24:56,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:24:56,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:24:56,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:24:56,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:24:56,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:24:56,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:24:56,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:24:56,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:24:56,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:24:56,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:24:56,561 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-12-01 16:24:56,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:24:56,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:24:56,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:24:56,569 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:24:56,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 16:24:56,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:24:56,571 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 16:24:56,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 16:24:56,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:24:56,571 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 16:24:56,571 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_2965518f-2db8-4155-84ed-97b29325130d/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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-01 16:24:56,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:24:56,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:24:56,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:24:56,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:24:56,604 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:24:56,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 16:24:56,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/1b5ee093b/18a2860d49d84b2e90c338d4e868eaed/FLAGb059e8ed8 [2018-12-01 16:24:57,045 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:24:57,046 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 16:24:57,052 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/1b5ee093b/18a2860d49d84b2e90c338d4e868eaed/FLAGb059e8ed8 [2018-12-01 16:24:57,061 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/bin-2019/ukojak/data/1b5ee093b/18a2860d49d84b2e90c338d4e868eaed [2018-12-01 16:24:57,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:24:57,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:24:57,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:57,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:24:57,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:24:57,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39933d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57, skipping insertion in model container [2018-12-01 16:24:57,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:24:57,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:24:57,234 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:57,242 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:24:57,267 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:57,290 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:24:57,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57 WrapperNode [2018-12-01 16:24:57,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:57,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:24:57,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:24:57,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:24:57,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:24:57,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:24:57,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:24:57,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:24:57,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:24:57,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:24:57,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:24:57,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:24:57,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2965518f-2db8-4155-84ed-97b29325130d/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 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-01 16:24:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:24:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:24:57,747 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:24:57,747 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 16:24:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:57 BoogieIcfgContainer [2018-12-01 16:24:57,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:24:57,748 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 16:24:57,748 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 16:24:57,754 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 16:24:57,754 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:57" (1/1) ... [2018-12-01 16:24:57,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-01 16:24:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-01 16:24:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-01 16:24:57,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:57,815 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:57,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:57,857 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 24 treesize of output 23 [2018-12-01 16:24:57,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:57,881 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2018-12-01 16:24:57,885 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 30 treesize of output 18 [2018-12-01 16:24:57,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:57,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:57,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:57,912 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 22 treesize of output 34 [2018-12-01 16:24:57,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:57,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:24:57,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:24:57,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 16:24:57,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:58 [2018-12-01 16:24:58,014 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 16:24:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-01 16:24:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-01 16:24:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-01 16:24:58,061 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,062 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,075 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 16:24:58,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-01 16:24:58,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,104 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 11 treesize of output 14 [2018-12-01 16:24:58,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:24:58,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:58,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-12-01 16:24:58,134 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 16:24:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-01 16:24:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-01 16:24:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-01 16:24:58,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,292 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,307 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 17 treesize of output 21 [2018-12-01 16:24:58,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:58,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-01 16:24:58,319 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 16:24:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-01 16:24:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-01 16:24:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-01 16:24:58,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,396 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 16:24:58,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-01 16:24:58,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,439 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 11 treesize of output 14 [2018-12-01 16:24:58,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:24:58,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:58,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-12-01 16:24:58,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,465 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 11 treesize of output 4 [2018-12-01 16:24:58,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-12-01 16:24:58,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,509 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 1 xjuncts. [2018-12-01 16:24:58,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:19 [2018-12-01 16:24:58,521 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 16:24:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-01 16:24:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-01 16:24:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 16:24:58,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,585 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,603 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 16:24:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-01 16:24:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-01 16:24:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 16:24:58,643 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,644 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,715 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 16:24:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:24:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-01 16:24:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-01 16:24:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 16:24:58,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:24:58,885 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:24:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:58,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:58,898 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 12 treesize of output 15 [2018-12-01 16:24:58,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,909 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-01 16:24:58,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 [2018-12-01 16:24:58,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:58,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:58,937 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:24:58,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:58,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:24:58,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:24:58,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 16:24:58,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-01 16:24:59,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:59,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:59,031 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 17 treesize of output 21 [2018-12-01 16:24:59,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,046 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 16:24:59,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:24:59,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,060 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:23 [2018-12-01 16:24:59,099 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 31 treesize of output 24 [2018-12-01 16:24:59,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:59,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-01 16:24:59,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:59,124 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 16:24:59,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-12-01 16:24:59,169 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 42 treesize of output 32 [2018-12-01 16:24:59,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-01 16:24:59,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:59,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:59,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:59,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:15 [2018-12-01 16:24:59,217 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 16:25:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-01 16:25:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-01 16:25:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 16:25:00,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:00,305 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:00,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:00,325 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 12 treesize of output 15 [2018-12-01 16:25:00,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,342 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-01 16:25:00,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 [2018-12-01 16:25:00,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:00,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,385 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:25:00,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 16:25:00,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:25:00,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:25:00,507 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 16:25:00,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,522 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 16:25:00,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 16:25:00,537 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:25:00,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-01 16:25:00,575 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-01 16:25:00,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,755 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 51 treesize of output 44 [2018-12-01 16:25:00,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:00,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:00,906 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 51 treesize of output 45 [2018-12-01 16:25:00,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-01 16:25:01,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:01,159 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 46 treesize of output 49 [2018-12-01 16:25:01,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:01,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:01,364 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 45 treesize of output 37 [2018-12-01 16:25:01,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,477 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 39 treesize of output 36 [2018-12-01 16:25:01,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:25:01,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,499 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 37 treesize of output 34 [2018-12-01 16:25:01,501 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 16:25:01,501 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,513 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,547 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 35 treesize of output 32 [2018-12-01 16:25:01,550 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 16:25:01,550 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,564 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 33 treesize of output 30 [2018-12-01 16:25:01,567 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 16:25:01,568 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,576 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:25:01,597 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 9 variables, input treesize:149, output treesize:60 [2018-12-01 16:25:01,695 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 21 treesize of output 16 [2018-12-01 16:25:01,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:01,706 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 16 treesize of output 23 [2018-12-01 16:25:01,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,744 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 31 treesize of output 24 [2018-12-01 16:25:01,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:01,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-01 16:25:01,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,777 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 16:25:01,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:44 [2018-12-01 16:25:01,865 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 16:25:01,868 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 16:25:01,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:01,885 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 46 treesize of output 36 [2018-12-01 16:25:01,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-12-01 16:25:01,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:01,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:01,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:01,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-01 16:25:01,975 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 16:25:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-01 16:25:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-01 16:25:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:25:04,174 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:04,174 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:04,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:04,183 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 16:25:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-01 16:25:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-01 16:25:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:25:04,595 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:04,595 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:04,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:04,739 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 16:25:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-01 16:25:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-01 16:25:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:25:06,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:06,000 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:06,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:06,011 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 11 treesize of output 14 [2018-12-01 16:25:06,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:25:06,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-01 16:25:06,109 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 16:25:06,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:25:06,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:25:06,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,130 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:14 [2018-12-01 16:25:06,240 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 22 treesize of output 17 [2018-12-01 16:25:06,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:06,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:25:06,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,261 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 16:25:06,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-01 16:25:06,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-01 16:25:06,573 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 20 treesize of output 1 [2018-12-01 16:25:06,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,584 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 16:25:06,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:20 [2018-12-01 16:25:06,587 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 29 treesize of output 23 [2018-12-01 16:25:06,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:06,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-01 16:25:06,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:06,595 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 16:25:06,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2018-12-01 16:25:06,691 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 16:25:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-01 16:25:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-01 16:25:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:25:09,053 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:09,053 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:09,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:09,066 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 11 treesize of output 14 [2018-12-01 16:25:09,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:25:09,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-01 16:25:09,080 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 16:25:09,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:25:09,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:25:09,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:17 [2018-12-01 16:25:09,275 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 16:25:09,277 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 16:25:09,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,297 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 22 treesize of output 17 [2018-12-01 16:25:09,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:09,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:25:09,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,322 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 16:25:09,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2018-12-01 16:25:09,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-12-01 16:25:09,726 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 20 treesize of output 1 [2018-12-01 16:25:09,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-01 16:25:09,766 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 20 treesize of output 1 [2018-12-01 16:25:09,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,779 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 16:25:09,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:31 [2018-12-01 16:25:09,783 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 16:25:09,786 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 16:25:09,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,809 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 31 treesize of output 25 [2018-12-01 16:25:09,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:09,816 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-01 16:25:09,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:09,824 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 16:25:09,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:11 [2018-12-01 16:25:09,959 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 16:25:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-01 16:25:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-01 16:25:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:25:14,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:14,824 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:14,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:15,318 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 16:25:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-01 16:25:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-01 16:25:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:25:21,600 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:21,601 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:21,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:22,956 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 16:25:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-01 16:25:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-01 16:25:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:25:32,753 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:32,754 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:32,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:33,789 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 16:25:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-01 16:25:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-01 16:25:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:25:33,817 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:33,817 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:33,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:33,828 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 16:25:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-01 16:25:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-01 16:25:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 16:25:34,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:34,354 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:34,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:34,374 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 11 treesize of output 14 [2018-12-01 16:25:34,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:25:34,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-01 16:25:34,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:34,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:34,657 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 11 treesize of output 4 [2018-12-01 16:25:34,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:25:34,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:25:34,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-12-01 16:25:34,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-01 16:25:34,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:34,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:25:34,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:34,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:35,005 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 16:25:35,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-01 16:25:35,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:35,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2018-12-01 16:25:35,739 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 20 treesize of output 1 [2018-12-01 16:25:35,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:35,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:35,762 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 16:25:35,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:34 [2018-12-01 16:25:36,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-01 16:25:36,559 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 24 treesize of output 1 [2018-12-01 16:25:36,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:36,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:36,576 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 16:25:36,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:28 [2018-12-01 16:25:36,978 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 37 treesize of output 29 [2018-12-01 16:25:36,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:36,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-01 16:25:36,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:36,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:36,989 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 16:25:36,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-12-01 16:25:37,235 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 16:25:38,697 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2018-12-01 16:25:39,624 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-12-01 16:25:41,904 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-01 16:25:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-01 16:25:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-01 16:25:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 16:25:48,277 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:48,277 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:25:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:48,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:25:48,303 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 16:25:48,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-01 16:25:48,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:48,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:48,335 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 24 treesize of output 23 [2018-12-01 16:25:48,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,355 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2018-12-01 16:25:48,366 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 32 treesize of output 28 [2018-12-01 16:25:48,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 16:25:48,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,396 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 20 treesize of output 24 [2018-12-01 16:25:48,397 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:48,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:25:48,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:25:48,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 16:25:48,492 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:42, output treesize:102 [2018-12-01 16:25:48,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:48,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 88 [2018-12-01 16:25:48,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:49,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-01 16:25:49,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:49,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-12-01 16:25:49,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:49,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:49,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2018-12-01 16:25:49,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-12-01 16:25:50,132 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:50,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-12-01 16:25:50,365 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,508 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 50 treesize of output 47 [2018-12-01 16:25:50,511 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 16:25:50,512 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,542 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 50 treesize of output 47 [2018-12-01 16:25:50,545 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 16:25:50,545 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,564 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,643 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 46 treesize of output 43 [2018-12-01 16:25:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:25:50,646 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,667 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 46 treesize of output 43 [2018-12-01 16:25:50,668 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 16:25:50,669 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,684 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:50,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:25:50,723 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:216, output treesize:86 [2018-12-01 16:25:51,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-01 16:25:51,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:51,281 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 16 treesize of output 23 [2018-12-01 16:25:51,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:51,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:51,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-01 16:25:51,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:51,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-01 16:25:51,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:51,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:51,376 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 16:25:51,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:57 [2018-12-01 16:25:52,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:52,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 131 [2018-12-01 16:25:52,395 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 28 treesize of output 1 [2018-12-01 16:25:52,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:52,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:52,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:52,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-12-01 16:25:52,472 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 28 treesize of output 1 [2018-12-01 16:25:52,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:52,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:52,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:52,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:162, output treesize:57 [2018-12-01 16:25:53,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:53,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 107 [2018-12-01 16:25:53,045 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 24 treesize of output 1 [2018-12-01 16:25:53,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:25:53,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-01 16:25:53,101 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 24 treesize of output 1 [2018-12-01 16:25:53,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,119 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 16:25:53,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:115, output treesize:49 [2018-12-01 16:25:53,677 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 16:25:53,680 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 16:25:53,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:25:53,699 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 42 treesize of output 32 [2018-12-01 16:25:53,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-01 16:25:53,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:53,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:53,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 16:25:53,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:23 [2018-12-01 16:25:54,150 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 16:25:59,968 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-01 16:26:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-01 16:26:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-01 16:26:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:26:11,705 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:11,706 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:26:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:11,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:26:11,728 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 11 treesize of output 14 [2018-12-01 16:26:11,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:26:11,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:11,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:11,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:11,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-01 16:26:12,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:12,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:12,128 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 11 treesize of output 4 [2018-12-01 16:26:12,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:26:12,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:26:12,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:22 [2018-12-01 16:26:12,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-01 16:26:12,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:12,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:26:12,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:12,621 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 16:26:12,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2018-12-01 16:26:13,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:13,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-12-01 16:26:13,549 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 20 treesize of output 1 [2018-12-01 16:26:13,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:13,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:13,564 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 16:26:13,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:28 [2018-12-01 16:26:14,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-12-01 16:26:14,049 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 24 treesize of output 1 [2018-12-01 16:26:14,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:14,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:14,064 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 16:26:14,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:33 [2018-12-01 16:26:14,984 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 33 treesize of output 25 [2018-12-01 16:26:14,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-01 16:26:14,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:14,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:14,992 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 16:26:14,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-12-01 16:26:15,350 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 16:26:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-01 16:26:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-01 16:26:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:26:24,422 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:24,422 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:26:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:24,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:26:24,454 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 11 treesize of output 14 [2018-12-01 16:26:24,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:26:24,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-01 16:26:24,474 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 16:26:24,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:24,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:24,498 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 11 treesize of output 4 [2018-12-01 16:26:24,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:26:24,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:26:24,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:24,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:30 [2018-12-01 16:26:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-01 16:26:25,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:25,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:26:25,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:25,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:25,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:26:25,080 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 16:26:25,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:25,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:25,098 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 16:26:25,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:50 [2018-12-01 16:26:26,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:26,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 93 [2018-12-01 16:26:26,185 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 20 treesize of output 1 [2018-12-01 16:26:26,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:26,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-01 16:26:26,238 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 20 treesize of output 1 [2018-12-01 16:26:26,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,264 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 16:26:26,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:50 [2018-12-01 16:26:26,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2018-12-01 16:26:26,795 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 36 treesize of output 1 [2018-12-01 16:26:26,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-12-01 16:26:26,848 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 36 treesize of output 1 [2018-12-01 16:26:26,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:26,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:177, output treesize:42 [2018-12-01 16:26:28,115 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 16:26:28,117 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 16:26:28,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:28,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:28,128 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 35 treesize of output 27 [2018-12-01 16:26:28,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-01 16:26:28,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:28,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:28,139 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 16:26:28,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:11 [2018-12-01 16:26:28,616 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 16:26:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-01 16:26:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-01 16:26:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:26:42,178 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:42,178 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:26:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:42,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:26:42,194 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 16:26:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:26:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:26:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:26:45,573 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:45,573 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:26:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:45,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:26:46,405 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 16:26:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-01 16:26:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-01 16:26:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:26:55,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:55,874 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:26:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:26:55,900 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 11 treesize of output 14 [2018-12-01 16:26:55,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 16:26:55,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:55,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:55,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:55,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-01 16:26:56,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:56,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:56,481 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 11 treesize of output 4 [2018-12-01 16:26:56,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:26:56,516 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 16:26:56,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 16:26:56,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-01 16:26:56,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:56,557 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:43, output treesize:26 [2018-12-01 16:26:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-01 16:26:57,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:57,195 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 16 treesize of output 23 [2018-12-01 16:26:57,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:57,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:57,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-01 16:26:57,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:57,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-01 16:26:57,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:57,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:57,275 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 16:26:57,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-12-01 16:26:58,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:58,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-01 16:26:58,528 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 20 treesize of output 1 [2018-12-01 16:26:58,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:58,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-12-01 16:26:58,583 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 20 treesize of output 1 [2018-12-01 16:26:58,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,606 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 16:26:58,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-12-01 16:26:58,609 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 28 treesize of output 22 [2018-12-01 16:26:58,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:26:58,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-01 16:26:58,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:58,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:12 [2018-12-01 16:26:59,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 16:26:59,129 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 12 treesize of output 1 [2018-12-01 16:26:59,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:59,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:59,136 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 16:26:59,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2018-12-01 16:26:59,611 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 16:26:59,612 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 16:26:59,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:26:59,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:26:59,614 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 16:26:59,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-01 16:27:00,017 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 16:27:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:27:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:27:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:27:09,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:09,009 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:27:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:09,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:27:09,025 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 16:27:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 29 states and 30 transitions. [2018-12-01 16:27:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-01 16:27:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:27:09,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:09,056 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:27:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:09,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:27:09,803 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 16:27:10,516 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-01 16:27:12,129 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-01 16:27:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-01 16:27:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-01 16:27:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:27:26,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:26,720 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:27:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:26,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:27:26,734 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 16:27:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-01 16:27:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-01 16:27:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:27:34,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:34,109 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 16:27:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:27:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:27:35,994 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. [2018-12-01 16:27:36,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:27:36 ImpRootNode [2018-12-01 16:27:36,028 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 16:27:36,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:27:36,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:27:36,029 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:27:36,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:57" (3/4) ... [2018-12-01 16:27:36,032 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 16:27:36,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:27:36,033 INFO L168 Benchmark]: Toolchain (without parser) took 158970.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-12-01 16:27:36,033 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 16:27:36,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.78 ms. Allocated memory is still 1.0 GB. Free memory was 939.4 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:27:36,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-01 16:27:36,034 INFO L168 Benchmark]: Boogie Preprocessor took 15.71 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 16:27:36,034 INFO L168 Benchmark]: RCFGBuilder took 383.45 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: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:27:36,034 INFO L168 Benchmark]: CodeCheck took 158280.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-01 16:27:36,035 INFO L168 Benchmark]: Witness Printer took 3.99 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 16:27:36,036 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, 58 locations, 29 error locations. UNSAFE Result, 158.2s OverallTime, 27 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 13153808 SDslu, 440 SDs, 0 SdLazy, 636202002 SolverSat, 246895806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1955 GetRequests, 1504 SyntacticMatches, 45 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69997 ImplicationChecksByTransitivity, 147.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 185 ConstructedInterpolants, 9 QuantifiedInterpolants, 23295 SizeOfPredicates, 141 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; [L625] pdata->lo = (int *)malloc(sizeof(int)) [L626] pdata->hi = (int *)malloc(sizeof(int)) [L627] EXPR pdata->lo [L627] *(pdata->lo) = 4 [L628] EXPR pdata->hi [L628] *(pdata->hi) = 8 [L632] EXPR data->lo [L632] int *lo = data->lo; [L633] EXPR data->hi [L633] int *hi = data->hi; [L634] EXPR \read(*lo) [L634] EXPR \read(*hi) [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) [L639] data->hi = ((void *)0) [L645] return 0; [L645] 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 226.78 ms. Allocated memory is still 1.0 GB. Free memory was 939.4 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.71 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 383.45 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: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * CodeCheck took 158280.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 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. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...