./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 ...................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:04:13,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:04:13,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:04:13,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:04:13,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:04:13,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:04:13,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:04:13,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:04:13,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:04:13,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:04:13,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:04:13,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:04:13,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:04:13,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:04:13,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:04:13,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:04:13,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:04:13,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:04:13,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:04:13,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:04:13,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:04:13,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:04:13,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:04:13,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:04:13,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:04:13,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:04:13,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:04:13,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:04:13,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:04:13,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:04:13,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:04:13,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:04:13,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:04:13,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:04:13,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:04:13,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:04:13,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:04:13,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:04:13,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:04:13,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:04:13,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:04:13,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:04:13,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:04:13,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:04:13,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:04:13,532 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:04:13,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:04:13,533 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:04:13,533 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:04:13,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:04:13,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:04:13,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:04:13,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:04:13,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:04:13,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:04:13,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:04:13,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:04:13,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:04:13,537 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2019-12-07 20:04:13,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:04:13,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:04:13,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:04:13,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:04:13,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:04:13,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 20:04:13,703 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/a4d2fcb14/94ab991dcb18432d8fc707557e284b12/FLAG108a767c0 [2019-12-07 20:04:14,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:04:14,182 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 20:04:14,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/a4d2fcb14/94ab991dcb18432d8fc707557e284b12/FLAG108a767c0 [2019-12-07 20:04:14,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/a4d2fcb14/94ab991dcb18432d8fc707557e284b12 [2019-12-07 20:04:14,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:04:14,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:04:14,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:14,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:04:14,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:04:14,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:14" (1/1) ... [2019-12-07 20:04:14,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b1d85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:14, skipping insertion in model container [2019-12-07 20:04:14,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:14" (1/1) ... [2019-12-07 20:04:14,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:04:14,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:04:14,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:14,850 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 20:04:14,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@757ef56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:14, skipping insertion in model container [2019-12-07 20:04:14,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:14,851 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 20:04:14,853 INFO L168 Benchmark]: Toolchain (without parser) took 171.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:14,854 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:04:14,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:14,856 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 14]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:04:15,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:04:15,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:04:15,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:04:15,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:04:15,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:04:15,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:04:15,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:04:16,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:04:16,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:04:16,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:04:16,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:04:16,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:04:16,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:04:16,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:04:16,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:04:16,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:04:16,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:04:16,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:04:16,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:04:16,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:04:16,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:04:16,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:04:16,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:04:16,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:04:16,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:04:16,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:04:16,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:04:16,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:04:16,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:04:16,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:04:16,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:04:16,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:04:16,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:04:16,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:04:16,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:04:16,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:04:16,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:04:16,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:04:16,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:04:16,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:04:16,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 20:04:16,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:04:16,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:04:16,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:04:16,032 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:04:16,032 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:04:16,032 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:04:16,032 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:04:16,033 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:04:16,033 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:04:16,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:04:16,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:04:16,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:04:16,034 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:04:16,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:04:16,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:04:16,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:04:16,036 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:04:16,037 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:04:16,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:04:16,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:04:16,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:04:16,037 INFO L138 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/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2019-12-07 20:04:16,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:04:16,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:04:16,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:04:16,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:04:16,217 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:04:16,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 20:04:16,263 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/6b4db8521/1e61d194e45749ccab4bb9f331a8c374/FLAGc3002e58f [2019-12-07 20:04:16,596 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:04:16,596 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 20:04:16,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/6b4db8521/1e61d194e45749ccab4bb9f331a8c374/FLAGc3002e58f [2019-12-07 20:04:16,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/data/6b4db8521/1e61d194e45749ccab4bb9f331a8c374 [2019-12-07 20:04:16,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:04:16,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:04:16,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:16,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:04:16,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:04:16,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8402c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16, skipping insertion in model container [2019-12-07 20:04:16,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:04:16,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:04:16,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:16,744 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 20:04:16,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:04:16,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:16,752 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:04:16,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:16,805 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:04:16,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16 WrapperNode [2019-12-07 20:04:16,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:16,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:04:16,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:04:16,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:04:16,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:04:16,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:04:16,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:04:16,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:04:16,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... [2019-12-07 20:04:16,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:04:16,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:04:16,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:04:16,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:04:16,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-12-07 20:04:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:04:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:04:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:04:16,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:04:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:04:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:04:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:04:17,044 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:04:17,044 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 20:04:17,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:04:17 BoogieIcfgContainer [2019-12-07 20:04:17,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:04:17,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:04:17,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:04:17,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:04:17,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:04:16" (1/3) ... [2019-12-07 20:04:17,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3981faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:04:17, skipping insertion in model container [2019-12-07 20:04:17,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:16" (2/3) ... [2019-12-07 20:04:17,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3981faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:04:17, skipping insertion in model container [2019-12-07 20:04:17,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:04:17" (3/3) ... [2019-12-07 20:04:17,050 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-12-07 20:04:17,056 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:04:17,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:04:17,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:04:17,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:04:17,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:04:17,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:04:17,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:04:17,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:04:17,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:04:17,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:04:17,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:04:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-12-07 20:04:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:04:17,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:17,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:17,099 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-12-07 20:04:17,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:17,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340729197] [2019-12-07 20:04:17,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:17,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 20:04:17,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,164 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340729197] [2019-12-07 20:04:17,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:17,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:04:17,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036314137] [2019-12-07 20:04:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 20:04:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 20:04:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:04:17,182 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-12-07 20:04:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:17,193 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-12-07 20:04:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:04:17,194 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 20:04:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:17,200 INFO L225 Difference]: With dead ends: 36 [2019-12-07 20:04:17,200 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 20:04:17,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:04:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 20:04:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 20:04:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 20:04:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 20:04:17,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-12-07 20:04:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:17,223 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 20:04:17,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 20:04:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-12-07 20:04:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:04:17,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:17,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:17,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:04:17,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-12-07 20:04:17,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:17,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952701002] [2019-12-07 20:04:17,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:17,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:04:17,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952701002] [2019-12-07 20:04:17,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:17,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 20:04:17,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461653484] [2019-12-07 20:04:17,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:17,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:17,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:04:17,576 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 4 states. [2019-12-07 20:04:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:17,607 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-12-07 20:04:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:17,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 20:04:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:17,608 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:04:17,608 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 20:04:17,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:04:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 20:04:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 20:04:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 20:04:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-12-07 20:04:17,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-12-07 20:04:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:17,612 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-12-07 20:04:17,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-12-07 20:04:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:04:17,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:17,613 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:17,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:04:17,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1315497119, now seen corresponding path program 1 times [2019-12-07 20:04:17,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:17,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878920158] [2019-12-07 20:04:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:17,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:04:17,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,908 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:17,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878920158] [2019-12-07 20:04:17,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [81240835] [2019-12-07 20:04:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:18,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:04:18,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:18,071 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238911219] [2019-12-07 20:04:18,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:18,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:04:18,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:04:18,137 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:04:18,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 20:04:18,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5, 5, 5] total 10 [2019-12-07 20:04:18,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828413871] [2019-12-07 20:04:18,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:18,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:04:18,154 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-12-07 20:04:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:18,190 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-12-07 20:04:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:18,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 20:04:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:18,191 INFO L225 Difference]: With dead ends: 39 [2019-12-07 20:04:18,191 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 20:04:18,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:04:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 20:04:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-07 20:04:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 20:04:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-12-07 20:04:18,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2019-12-07 20:04:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:18,197 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-12-07 20:04:18,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-12-07 20:04:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:04:18,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:18,198 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:18,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:18,800 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2030845279, now seen corresponding path program 1 times [2019-12-07 20:04:18,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:18,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010096068] [2019-12-07 20:04:18,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:18,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:04:18,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:18,872 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010096068] [2019-12-07 20:04:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [699853857] [2019-12-07 20:04:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:18,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:04:18,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:04:18,990 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:04:19,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:04:19,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5] total 10 [2019-12-07 20:04:19,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127217116] [2019-12-07 20:04:19,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:19,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:04:19,006 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2019-12-07 20:04:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:19,019 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-12-07 20:04:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:19,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 20:04:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:19,020 INFO L225 Difference]: With dead ends: 42 [2019-12-07 20:04:19,020 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 20:04:19,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:04:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 20:04:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 20:04:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 20:04:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 20:04:19,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2019-12-07 20:04:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:19,024 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 20:04:19,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-12-07 20:04:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:04:19,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:19,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:19,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:19,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2139127327, now seen corresponding path program 1 times [2019-12-07 20:04:19,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:19,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590942777] [2019-12-07 20:04:19,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:19,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:04:19,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:19,540 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:19,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590942777] [2019-12-07 20:04:19,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [169978962] [2019-12-07 20:04:19,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:19,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:04:19,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:19,674 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:04:19,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269487624] [2019-12-07 20:04:19,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:19,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:04:19,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:19,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:04:19,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:19,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:20,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:20,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-12-07 20:04:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:20,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:20,004 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 20:04:20,005 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:20,013 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:20,015 INFO L377 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 12 treesize of output 4 [2019-12-07 20:04:20,015 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:20,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:20,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:04:20,017 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:7 [2019-12-07 20:04:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:04:20,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:04:20,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 9, 7] total 20 [2019-12-07 20:04:20,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324419908] [2019-12-07 20:04:20,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 20:04:20,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 20:04:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:04:20,039 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states. [2019-12-07 20:04:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:20,801 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-12-07 20:04:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:04:20,801 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-12-07 20:04:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:20,802 INFO L225 Difference]: With dead ends: 54 [2019-12-07 20:04:20,802 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 20:04:20,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:04:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 20:04:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-12-07 20:04:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:04:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-12-07 20:04:20,810 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-12-07 20:04:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:20,811 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-12-07 20:04:20,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 20:04:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-12-07 20:04:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:04:20,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:20,812 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:21,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:21,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash 225697560, now seen corresponding path program 1 times [2019-12-07 20:04:21,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:21,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132922039] [2019-12-07 20:04:21,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:21,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:04:21,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:04:21,548 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:04:21,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132922039] [2019-12-07 20:04:21,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [751771153] [2019-12-07 20:04:21,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:21,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:04:21,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:04:21,943 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:04:21,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675355338] [2019-12-07 20:04:21,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:21,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:04:21,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:22,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 20:04:22,296 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:22,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:22,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:22,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 20:04:22,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:22,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:24,718 INFO L377 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 12 treesize of output 4 [2019-12-07 20:04:24,718 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:30,813 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 19 [2019-12-07 20:04:30,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:30,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:30,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 20:04:30,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:30,827 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:30,828 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 20:04:30,828 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:30,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:30,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:04:30,830 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:9 [2019-12-07 20:04:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 20:04:30,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:04:30,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 11, 10] total 33 [2019-12-07 20:04:30,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470004733] [2019-12-07 20:04:30,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 20:04:30,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 20:04:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 20:04:30,902 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 33 states. [2019-12-07 20:04:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:32,810 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 20:04:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 20:04:32,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-12-07 20:04:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:32,811 INFO L225 Difference]: With dead ends: 80 [2019-12-07 20:04:32,811 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 20:04:32,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=407, Invalid=2349, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 20:04:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 20:04:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-12-07 20:04:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 20:04:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-12-07 20:04:32,820 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 33 [2019-12-07 20:04:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:32,820 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-12-07 20:04:32,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 20:04:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-12-07 20:04:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:04:32,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:32,822 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:33,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 20:04:33,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash -403676583, now seen corresponding path program 2 times [2019-12-07 20:04:33,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:33,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46996645] [2019-12-07 20:04:33,426 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:33,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:04:33,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:04:33,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:04:33,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 20:04:33,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 20:04:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46996645] [2019-12-07 20:04:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [300120046] [2019-12-07 20:04:34,798 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:34,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:04:34,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:04:34,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:04:34,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 20:04:34,969 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 20:04:34,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668128658] [2019-12-07 20:04:34,976 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:35,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:04:35,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:04:35,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:04:35,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 20:04:35,154 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 20:04:35,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:04:35,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 17, 5, 5] total 38 [2019-12-07 20:04:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959026580] [2019-12-07 20:04:35,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 20:04:35,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:04:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 20:04:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 20:04:35,332 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 38 states. [2019-12-07 20:04:36,315 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 20:04:36,789 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 20:04:37,252 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 20:04:37,672 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 20:04:38,026 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 20:04:38,382 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 20:04:38,710 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 20:04:39,015 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 20:04:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:40,477 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2019-12-07 20:04:40,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 20:04:40,477 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-12-07 20:04:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:40,479 INFO L225 Difference]: With dead ends: 147 [2019-12-07 20:04:40,479 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 20:04:40,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=771, Invalid=2091, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 20:04:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 20:04:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2019-12-07 20:04:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 20:04:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-12-07 20:04:40,491 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 54 [2019-12-07 20:04:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:40,491 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-12-07 20:04:40,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 20:04:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-12-07 20:04:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 20:04:40,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:40,493 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:41,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:41,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 333100921, now seen corresponding path program 3 times [2019-12-07 20:04:41,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:04:41,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226690002] [2019-12-07 20:04:41,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 20:04:41,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:04:41,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:04:41,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:04:41,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:41,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-12-07 20:04:41,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:41,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:41,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:04:41,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-12-07 20:04:41,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:41,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 20:04:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:41,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 20:04:41,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:41,361 INFO L534 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. [2019-12-07 20:04:41,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 20:04:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:04:41,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:41,935 INFO L377 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 50 treesize of output 42 [2019-12-07 20:04:41,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 20:04:42,040 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 20:04:42,041 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 20:04:42,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:42,044 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:04:42,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 20:04:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:42,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:42,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:43,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:43,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:43,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:44,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:44,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:44,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:44,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:45,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:45,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:45,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:46,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:46,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:47,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:48,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:49,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:49,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:50,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:50,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:50,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:50,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:51,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:51,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:51,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:51,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:52,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:52,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:52,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:52,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:52,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:53,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:53,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:54,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:54,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:54,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:04:55,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226690002] [2019-12-07 20:04:55,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120224529] [2019-12-07 20:04:55,175 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:04:55,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:04:55,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:04:55,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:04:55,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:55,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-12-07 20:04:55,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:55,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:55,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:04:55,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-12-07 20:04:55,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:55,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 20:04:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 20:04:55,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:55,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,369 INFO L534 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. [2019-12-07 20:04:55,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 20:04:55,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:04:55,408 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:55,427 INFO L377 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 50 treesize of output 42 [2019-12-07 20:04:55,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 20:04:55,534 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 20:04:55,535 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 20:04:55,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,537 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:04:55,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 20:04:55,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:55,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:56,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:56,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:56,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:57,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:57,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:57,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:57,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:57,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:58,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:58,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:58,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:59,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:59,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:00,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:00,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:01,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:01,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:01,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:01,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:02,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:02,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:02,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:02,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:02,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:03,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:04,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:05,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:05,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:06,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:06,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:06,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:07,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:07,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:05:08,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085100947] [2019-12-07 20:05:08,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:08,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:05:08,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:05:08,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:05:08,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:08,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-12-07 20:05:08,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:05:08,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:05:08,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:05:08,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-12-07 20:05:08,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:05:08,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 20:05:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 20:05:08,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:05:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,628 INFO L534 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. [2019-12-07 20:05:08,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 20:05:08,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:05:08,666 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:08,683 INFO L377 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 50 treesize of output 42 [2019-12-07 20:05:08,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 20:05:08,803 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 20:05:08,804 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 20:05:08,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:05:08,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 20:05:08,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:08,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:09,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:09,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:09,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:09,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:10,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:10,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:10,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:11,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:11,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:11,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:11,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:12,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:12,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:12,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:12,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:14,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:14,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:15,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:16,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:16,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:16,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:17,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:17,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:18,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:18,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:18,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:18,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:19,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:19,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:19,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:19,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:20,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:20,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:20,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:21,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:21,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:05:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 20:05:21,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:05:21,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 16 [2019-12-07 20:05:21,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404987548] [2019-12-07 20:05:21,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:05:21,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:05:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:05:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:05:21,637 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 16 states. [2019-12-07 20:05:22,388 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-07 20:05:22,932 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 20:05:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:22,965 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-12-07 20:05:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:05:22,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 98 [2019-12-07 20:05:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:22,967 INFO L225 Difference]: With dead ends: 99 [2019-12-07 20:05:22,967 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:05:22,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 394 SyntacticMatches, 174 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:05:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:05:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:05:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:05:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:05:22,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-12-07 20:05:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:22,968 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:05:22,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 20:05:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:05:22,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:05:23,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:05:23,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:05:24,490 WARN L192 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 20:05:24,600 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-12-07 20:05:24,602 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-12-07 20:05:24,602 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (not (= (_ bv0 32) ULTIMATE.start_main_~flag~0)) [2019-12-07 20:05:24,602 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-12-07 20:05:24,602 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-12-07 20:05:24,602 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 20:05:24,602 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:05:24,602 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|))) (let ((.cse1 (= ULTIMATE.start_init_~a.base |ULTIMATE.start_main_~#a~0.base|)) (.cse4 (= ULTIMATE.start_init_~a.offset |ULTIMATE.start_main_~#a~0.offset|)) (.cse5 (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) ULTIMATE.start_init_~size)) (.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~#a~0.offset|)) (.cse7 (= (select .cse10 |ULTIMATE.start_main_~#a~0.offset|) (_ bv0 32))) (.cse8 (= (select .cse12 |ULTIMATE.start_main_~#a~0.offset|) (_ bv0 32))) (.cse2 (exists ((ULTIMATE.start_init_~i~0 (_ BitVec 32))) (and (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) (_ bv100000 32)) (not (bvslt ULTIMATE.start_init_~i~0 (_ bv100000 32))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32)))))) (.cse3 (= (bvadd ULTIMATE.start_init_~size (_ bv4294867296 32)) (_ bv0 32))) (.cse9 (bvadd ULTIMATE.start_main_~i~1 (_ bv4294967295 32))) (.cse6 (not (= (select .cse10 (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv0 32) ULTIMATE.start_main_~i~1) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse4 (= .cse9 (_ bv0 32)) .cse5 .cse6) (let ((.cse11 (bvadd |ULTIMATE.start_main_~#a~0.offset| (_ bv4 32)))) (and .cse1 .cse4 (exists ((ULTIMATE.start_init_~i~0 (_ BitVec 32))) (and (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) (_ bv100000 32)) (not (bvslt ULTIMATE.start_init_~i~0 (_ bv100000 32))) (not (= (bvmul ULTIMATE.start_main_~i~1 (_ bv4 32)) (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)))))) (= (select .cse10 .cse11) (_ bv0 32)) .cse5 .cse0 (= (_ bv0 32) (select .cse12 .cse11)) .cse7 .cse8 .cse2 .cse3 (bvslt .cse9 (_ bv100000 32)) .cse6)) (= (_ bv1 32) ULTIMATE.start_main_~flag~0)))) [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~#a~0.offset|)) (.cse1 (= ULTIMATE.start_init_~a.base |ULTIMATE.start_main_~#a~0.base|)) (.cse2 (= (bvadd ULTIMATE.start_init_~size (_ bv4294867296 32)) (_ bv0 32))) (.cse3 (= ULTIMATE.start_init_~a.offset |ULTIMATE.start_main_~#a~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) ULTIMATE.start_init_~size) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32)))) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv0 32) ULTIMATE.start_init_~i~0)))) [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-12-07 20:05:24,603 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:05:24,604 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-12-07 20:05:24,604 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-12-07 20:05:24,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,612 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,612 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,629 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,631 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,631 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:05:24 BoogieIcfgContainer [2019-12-07 20:05:24,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:05:24,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:05:24,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:05:24,633 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:05:24,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:04:17" (3/4) ... [2019-12-07 20:05:24,636 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:05:24,642 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 20:05:24,643 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 20:05:24,643 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:05:24,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == a && a == a) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && 0bv32 == i) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || (((((((((0bv32 == a && a == a) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && ~bvadd64(i, 4294967295bv32) == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || ((((((((((((a == a && a == a) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(~bvmul32(i, 4bv32) == ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32)))) && #memory_$Pointer$[a][~bvadd64(a, 4bv32)] == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && 0bv32 == a) && 0bv32 == #memory_$Pointer$[a][~bvadd64(a, 4bv32)]) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || 1bv32 == flag [2019-12-07 20:05:24,669 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cdac294f-c4cd-4693-8848-dcb19f6040ce/bin/utaipan/witness.graphml [2019-12-07 20:05:24,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:05:24,670 INFO L168 Benchmark]: Toolchain (without parser) took 68059.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.2 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -97.0 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:05:24,671 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:05:24,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:05:24,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.04 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. [2019-12-07 20:05:24,671 INFO L168 Benchmark]: Boogie Preprocessor took 18.70 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:05:24,672 INFO L168 Benchmark]: RCFGBuilder took 194.90 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:05:24,672 INFO L168 Benchmark]: TraceAbstraction took 67586.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 156.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:05:24,672 INFO L168 Benchmark]: Witness Printer took 36.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:05:24,673 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.04 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 18.70 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.90 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67586.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 156.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 20:05:24,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,682 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,682 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,682 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 20:05:24,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((0bv32 == a && a == a) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && 0bv32 == i) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || (((((((((0bv32 == a && a == a) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && ~bvadd64(i, 4294967295bv32) == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || ((((((((((((a == a && a == a) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(~bvmul32(i, 4bv32) == ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32)))) && #memory_$Pointer$[a][~bvadd64(a, 4bv32)] == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && 0bv32 == a) && 0bv32 == #memory_$Pointer$[a][~bvadd64(a, 4bv32)]) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 100000bv32) && !~bvslt32(ULTIMATE.start_init_~i~0, 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvadd64(size, 4294867296bv32) == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), 100000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || 1bv32 == flag - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: !(0bv32 == flag) - InvariantResult [Line: 12]: Loop Invariant [2019-12-07 20:05:24,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 20:05:24,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 20:05:24,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((0bv32 == a && a == a) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || ((((0bv32 == a && a == a) && ~bvadd64(size, 4294867296bv32) == 0bv32) && a == a) && 0bv32 == i) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 66.4s, OverallIterations: 8, TraceHistogramMax: 30, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 123 SDtfs, 290 SDslu, 596 SDs, 0 SdLazy, 1787 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1105 SyntacticMatches, 174 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 48.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 46 NumberOfFragments, 310 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2205 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 51.9s InterpolantComputationTime, 717 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1396 ConstructedInterpolants, 294 QuantifiedInterpolants, 1287672 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 5970/7422 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...