./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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 e6399ca05df7547b7620299987a8a06e9e2c006b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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 e6399ca05df7547b7620299987a8a06e9e2c006b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:30,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:30,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:30,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:30,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:30,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:30,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:30,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:30,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:30,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:30,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:30,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:30,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:30,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:30,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:30,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:30,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:30,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:30,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:30,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:30,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:30,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:30,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:30,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:30,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:30,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:30,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:30,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:30,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:30,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:30,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:30,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:30,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:30,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:30,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:30,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:30,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:30,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:30,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:30,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:30,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:30,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:30,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:30,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:30,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:30,672 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:30,672 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:30,673 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:30,673 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:30,673 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:30,673 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:30,674 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:30,674 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:30,674 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:30,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:30,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:30,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:30,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:30,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:30,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:30,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:30,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:30,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:30,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:30,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:30,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:30,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:30,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:30,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:30,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:30,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:30,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:30,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:30,679 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:30,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:30,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:30,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:30,680 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/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2019-10-22 11:24:30,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:30,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:30,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:30,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:30,725 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:30,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-10-22 11:24:30,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/d3a83fc1e/283c763387b441dea5e3a0623f10032c/FLAG361aff3b8 [2019-10-22 11:24:31,227 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:31,228 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-10-22 11:24:31,245 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/d3a83fc1e/283c763387b441dea5e3a0623f10032c/FLAG361aff3b8 [2019-10-22 11:24:31,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/d3a83fc1e/283c763387b441dea5e3a0623f10032c [2019-10-22 11:24:31,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:31,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:31,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:31,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:31,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:31,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebe0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31, skipping insertion in model container [2019-10-22 11:24:31,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:31,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:32,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:32,322 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:32,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:32,455 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:32,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32 WrapperNode [2019-10-22 11:24:32,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:32,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:32,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:32,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:32,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:32,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:32,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:32,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:32,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... [2019-10-22 11:24:32,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:32,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:32,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:32,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:32,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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-10-22 11:24:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:32,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:33,294 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:33,294 INFO L284 CfgBuilder]: Removed 75 assume(true) statements. [2019-10-22 11:24:33,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:33 BoogieIcfgContainer [2019-10-22 11:24:33,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:33,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:33,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:33,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:33,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:31" (1/3) ... [2019-10-22 11:24:33,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4cd499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:33, skipping insertion in model container [2019-10-22 11:24:33,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:32" (2/3) ... [2019-10-22 11:24:33,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4cd499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:33, skipping insertion in model container [2019-10-22 11:24:33,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:33" (3/3) ... [2019-10-22 11:24:33,304 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-22 11:24:33,315 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:33,323 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-22 11:24:33,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-22 11:24:33,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:33,362 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:33,362 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:33,362 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:33,362 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:33,362 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:33,362 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:33,363 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-10-22 11:24:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:33,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:33,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 890218827, now seen corresponding path program 1 times [2019-10-22 11:24:33,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016935838] [2019-10-22 11:24:33,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:33,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016935838] [2019-10-22 11:24:33,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:33,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396668107] [2019-10-22 11:24:33,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:33,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:33,559 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2019-10-22 11:24:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,590 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2019-10-22 11:24:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:33,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:24:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,602 INFO L225 Difference]: With dead ends: 196 [2019-10-22 11:24:33,602 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 11:24:33,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-22 11:24:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 11:24:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-22 11:24:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:24:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-10-22 11:24:33,649 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2019-10-22 11:24:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,650 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-10-22 11:24:33,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-10-22 11:24:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:24:33,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:33,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865150, now seen corresponding path program 1 times [2019-10-22 11:24:33,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145208389] [2019-10-22 11:24:33,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:33,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145208389] [2019-10-22 11:24:33,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:33,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133201207] [2019-10-22 11:24:33,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:33,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:33,702 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 3 states. [2019-10-22 11:24:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,733 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2019-10-22 11:24:33,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:33,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-22 11:24:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,735 INFO L225 Difference]: With dead ends: 182 [2019-10-22 11:24:33,735 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 11:24:33,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 11:24:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-10-22 11:24:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-22 11:24:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-10-22 11:24:33,746 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2019-10-22 11:24:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,746 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-10-22 11:24:33,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-10-22 11:24:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:33,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,747 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:33,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,748 INFO L82 PathProgramCache]: Analyzing trace with hash 663763925, now seen corresponding path program 1 times [2019-10-22 11:24:33,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221422336] [2019-10-22 11:24:33,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:33,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221422336] [2019-10-22 11:24:33,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:33,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307549183] [2019-10-22 11:24:33,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:33,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:33,891 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 5 states. [2019-10-22 11:24:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,068 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2019-10-22 11:24:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:34,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:24:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,071 INFO L225 Difference]: With dead ends: 253 [2019-10-22 11:24:34,071 INFO L226 Difference]: Without dead ends: 247 [2019-10-22 11:24:34,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-22 11:24:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 96. [2019-10-22 11:24:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 11:24:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-10-22 11:24:34,084 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2019-10-22 11:24:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,084 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-10-22 11:24:34,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-10-22 11:24:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:34,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,086 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:34,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2036062252, now seen corresponding path program 1 times [2019-10-22 11:24:34,087 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179633077] [2019-10-22 11:24:34,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:34,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179633077] [2019-10-22 11:24:34,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:34,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307909958] [2019-10-22 11:24:34,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:34,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:34,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:34,193 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states. [2019-10-22 11:24:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,473 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-10-22 11:24:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:34,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-22 11:24:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,476 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:24:34,476 INFO L226 Difference]: Without dead ends: 123 [2019-10-22 11:24:34,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-22 11:24:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-10-22 11:24:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-22 11:24:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-10-22 11:24:34,495 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2019-10-22 11:24:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,495 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-10-22 11:24:34,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-10-22 11:24:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:34,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,497 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:34,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2014113239, now seen corresponding path program 1 times [2019-10-22 11:24:34,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684112083] [2019-10-22 11:24:34,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:34,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684112083] [2019-10-22 11:24:34,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:34,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371580751] [2019-10-22 11:24:34,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:34,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:34,623 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 5 states. [2019-10-22 11:24:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,869 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-10-22 11:24:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:34,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-22 11:24:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,871 INFO L225 Difference]: With dead ends: 94 [2019-10-22 11:24:34,871 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 11:24:34,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 11:24:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-22 11:24:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:24:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-10-22 11:24:34,892 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 20 [2019-10-22 11:24:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,892 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-10-22 11:24:34,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-10-22 11:24:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:34,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,894 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:34,894 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1486605840, now seen corresponding path program 1 times [2019-10-22 11:24:34,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:34,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081029935] [2019-10-22 11:24:34,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:35,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081029935] [2019-10-22 11:24:35,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:35,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:35,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050295276] [2019-10-22 11:24:35,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:35,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:35,046 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2019-10-22 11:24:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:35,421 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2019-10-22 11:24:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:35,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 11:24:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:35,424 INFO L225 Difference]: With dead ends: 210 [2019-10-22 11:24:35,424 INFO L226 Difference]: Without dead ends: 208 [2019-10-22 11:24:35,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-22 11:24:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 98. [2019-10-22 11:24:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-22 11:24:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-10-22 11:24:35,446 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 23 [2019-10-22 11:24:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:35,447 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-10-22 11:24:35,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-10-22 11:24:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:35,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:35,448 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:35,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1760261746, now seen corresponding path program 1 times [2019-10-22 11:24:35,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:35,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153899632] [2019-10-22 11:24:35,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:35,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153899632] [2019-10-22 11:24:35,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:35,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:35,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632299789] [2019-10-22 11:24:35,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:35,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:35,550 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 6 states. [2019-10-22 11:24:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:35,895 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2019-10-22 11:24:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:35,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 11:24:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:35,897 INFO L225 Difference]: With dead ends: 208 [2019-10-22 11:24:35,897 INFO L226 Difference]: Without dead ends: 206 [2019-10-22 11:24:35,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-22 11:24:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2019-10-22 11:24:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-22 11:24:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-10-22 11:24:35,910 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 23 [2019-10-22 11:24:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:35,910 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-10-22 11:24:35,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-10-22 11:24:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:35,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:35,911 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:35,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2060804288, now seen corresponding path program 1 times [2019-10-22 11:24:35,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:35,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718271655] [2019-10-22 11:24:35,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:36,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718271655] [2019-10-22 11:24:36,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:36,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:36,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020265930] [2019-10-22 11:24:36,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:36,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:36,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:36,043 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 7 states. [2019-10-22 11:24:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:36,709 INFO L93 Difference]: Finished difference Result 281 states and 317 transitions. [2019-10-22 11:24:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:36,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-22 11:24:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:36,711 INFO L225 Difference]: With dead ends: 281 [2019-10-22 11:24:36,711 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 11:24:36,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 11:24:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 107. [2019-10-22 11:24:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:24:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-10-22 11:24:36,721 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 26 [2019-10-22 11:24:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:36,722 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-10-22 11:24:36,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-10-22 11:24:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:36,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:36,723 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:36,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1587105397, now seen corresponding path program 1 times [2019-10-22 11:24:36,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:36,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5595658] [2019-10-22 11:24:36,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:36,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:36,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:36,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5595658] [2019-10-22 11:24:36,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:36,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:36,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166961263] [2019-10-22 11:24:36,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:36,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:36,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:36,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:36,853 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 7 states. [2019-10-22 11:24:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:37,496 INFO L93 Difference]: Finished difference Result 279 states and 315 transitions. [2019-10-22 11:24:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:37,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-22 11:24:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:37,498 INFO L225 Difference]: With dead ends: 279 [2019-10-22 11:24:37,498 INFO L226 Difference]: Without dead ends: 277 [2019-10-22 11:24:37,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-22 11:24:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 110. [2019-10-22 11:24:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:24:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-10-22 11:24:37,507 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 26 [2019-10-22 11:24:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:37,508 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-10-22 11:24:37,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-10-22 11:24:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:37,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:37,509 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:37,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1023061451, now seen corresponding path program 1 times [2019-10-22 11:24:37,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:37,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146053594] [2019-10-22 11:24:37,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:37,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146053594] [2019-10-22 11:24:37,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:37,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:37,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482335744] [2019-10-22 11:24:37,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:37,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:37,577 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 5 states. [2019-10-22 11:24:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:37,648 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2019-10-22 11:24:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:37,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:24:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:37,649 INFO L225 Difference]: With dead ends: 152 [2019-10-22 11:24:37,650 INFO L226 Difference]: Without dead ends: 150 [2019-10-22 11:24:37,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-22 11:24:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2019-10-22 11:24:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:24:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-10-22 11:24:37,658 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 31 [2019-10-22 11:24:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:37,658 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-10-22 11:24:37,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-10-22 11:24:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:37,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:37,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:37,660 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1739082713, now seen corresponding path program 1 times [2019-10-22 11:24:37,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:37,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842562056] [2019-10-22 11:24:37,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:37,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842562056] [2019-10-22 11:24:37,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672875126] [2019-10-22 11:24:37,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:24:37,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:37,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:37,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-10-22 11:24:37,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:37,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-10-22 11:24:37,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:37,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:37,915 INFO L375 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 14 treesize of output 8 [2019-10-22 11:24:37,916 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:37,918 INFO L375 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 20 treesize of output 8 [2019-10-22 11:24:37,919 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:37,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:37,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:24:37,924 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:9 [2019-10-22 11:24:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:37,929 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:37,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2026050852] [2019-10-22 11:24:37,969 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-22 11:24:38,013 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:24:38,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:24:38,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:38,289 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:24:38,295 INFO L168 Benchmark]: Toolchain (without parser) took 6536.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 882.3 MB in the end (delta: 62.2 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,295 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,297 INFO L168 Benchmark]: Boogie Preprocessor took 56.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,298 INFO L168 Benchmark]: RCFGBuilder took 707.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,298 INFO L168 Benchmark]: TraceAbstraction took 4996.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,301 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 707.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4996.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:40,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:40,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:40,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:40,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:40,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:40,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:40,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:40,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:40,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:40,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:40,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:40,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:40,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:40,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:40,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:40,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:40,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:40,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:40,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:40,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:40,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:40,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:40,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:40,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:40,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:40,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:40,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:40,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:40,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:40,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:40,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:40,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:40,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:40,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:40,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:40,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:40,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:40,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:40,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:40,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:40,782 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:40,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:40,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:40,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:40,801 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:40,802 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:40,802 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:40,802 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:40,802 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:40,802 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:40,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:40,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:40,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:40,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:40,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:40,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:40,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:40,815 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:40,815 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:40,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:40,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:40,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:40,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:40,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:40,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:40,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:40,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:40,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:40,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:40,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:40,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:40,817 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:40,818 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:40,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:40,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:40,818 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/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2019-10-22 11:24:40,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:40,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:40,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:40,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:40,881 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:40,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-10-22 11:24:40,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/168748dbc/9d009038fa514edebf272468dca948ab/FLAGc26cb2750 [2019-10-22 11:24:41,452 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:41,453 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-10-22 11:24:41,468 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/168748dbc/9d009038fa514edebf272468dca948ab/FLAGc26cb2750 [2019-10-22 11:24:41,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/data/168748dbc/9d009038fa514edebf272468dca948ab [2019-10-22 11:24:41,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:41,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:41,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:41,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:41,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:41,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:41" (1/1) ... [2019-10-22 11:24:41,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40974ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:41, skipping insertion in model container [2019-10-22 11:24:41,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:41" (1/1) ... [2019-10-22 11:24:41,750 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:41,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:42,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:42,331 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:42,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:42,492 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:42,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42 WrapperNode [2019-10-22 11:24:42,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:42,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:42,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:42,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:42,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:42,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:42,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:42,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:42,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... [2019-10-22 11:24:42,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:42,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:42,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:42,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:42,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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-10-22 11:24:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:24:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:43,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:43,795 INFO L284 CfgBuilder]: Removed 75 assume(true) statements. [2019-10-22 11:24:43,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:43 BoogieIcfgContainer [2019-10-22 11:24:43,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:43,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:43,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:43,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:43,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:41" (1/3) ... [2019-10-22 11:24:43,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa193eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:43, skipping insertion in model container [2019-10-22 11:24:43,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:42" (2/3) ... [2019-10-22 11:24:43,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa193eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:43, skipping insertion in model container [2019-10-22 11:24:43,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:43" (3/3) ... [2019-10-22 11:24:43,811 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-22 11:24:43,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:43,832 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-22 11:24:43,845 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-22 11:24:43,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:43,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:43,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:43,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:43,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:43,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:43,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:43,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-10-22 11:24:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:43,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:43,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:43,902 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 889651805, now seen corresponding path program 1 times [2019-10-22 11:24:43,921 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:43,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1419625013] [2019-10-22 11:24:43,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:44,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:44,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:44,113 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:44,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419625013] [2019-10-22 11:24:44,120 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:44,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:44,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808132091] [2019-10-22 11:24:44,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:44,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:44,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:44,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:44,148 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2019-10-22 11:24:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:44,234 INFO L93 Difference]: Finished difference Result 203 states and 327 transitions. [2019-10-22 11:24:44,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:44,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:24:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:44,245 INFO L225 Difference]: With dead ends: 203 [2019-10-22 11:24:44,246 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 11:24:44,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 11:24:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-10-22 11:24:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:24:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-10-22 11:24:44,295 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2019-10-22 11:24:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:44,295 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-10-22 11:24:44,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-10-22 11:24:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:44,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:44,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:44,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:44,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1373855962, now seen corresponding path program 1 times [2019-10-22 11:24:44,500 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:44,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1804091310] [2019-10-22 11:24:44,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:44,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 11:24:44,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:44,643 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:44,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804091310] [2019-10-22 11:24:44,662 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:44,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-10-22 11:24:44,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117341036] [2019-10-22 11:24:44,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:44,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:44,665 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 5 states. [2019-10-22 11:24:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:44,968 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2019-10-22 11:24:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:44,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:24:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:44,974 INFO L225 Difference]: With dead ends: 251 [2019-10-22 11:24:44,974 INFO L226 Difference]: Without dead ends: 245 [2019-10-22 11:24:44,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-22 11:24:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 94. [2019-10-22 11:24:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-22 11:24:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-10-22 11:24:45,006 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 11 [2019-10-22 11:24:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:45,006 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-10-22 11:24:45,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-10-22 11:24:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:45,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:45,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:45,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:45,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2034213914, now seen corresponding path program 1 times [2019-10-22 11:24:45,211 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:45,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1127947346] [2019-10-22 11:24:45,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:45,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:24:45,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:45,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-22 11:24:45,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:45,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:45,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-22 11:24:45,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:45,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:45,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:45,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-10-22 11:24:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:45,503 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:45,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1127947346] [2019-10-22 11:24:45,550 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:45,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-10-22 11:24:45,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596084379] [2019-10-22 11:24:45,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:45,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:45,552 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 6 states. [2019-10-22 11:24:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:46,865 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-10-22 11:24:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:46,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:24:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:46,874 INFO L225 Difference]: With dead ends: 123 [2019-10-22 11:24:46,874 INFO L226 Difference]: Without dead ends: 121 [2019-10-22 11:24:46,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-22 11:24:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2019-10-22 11:24:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:24:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-10-22 11:24:46,887 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 18 [2019-10-22 11:24:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:46,887 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-10-22 11:24:46,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-10-22 11:24:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:46,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:46,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:47,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:47,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2012264901, now seen corresponding path program 1 times [2019-10-22 11:24:47,092 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:47,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2101450939] [2019-10-22 11:24:47,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/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-10-22 11:24:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:47,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:24:47,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:47,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:47,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-10-22 11:24:47,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:47,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-10-22 11:24:47,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:47,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:47,327 INFO L375 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 14 treesize of output 8 [2019-10-22 11:24:47,328 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:47,339 INFO L375 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 20 treesize of output 8 [2019-10-22 11:24:47,340 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:47,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:47,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:24:47,347 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:9 [2019-10-22 11:24:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:47,364 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:47,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2101450939] [2019-10-22 11:24:47,409 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:47,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-10-22 11:24:47,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785967582] [2019-10-22 11:24:47,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:47,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:47,410 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2019-10-22 11:24:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:48,737 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-10-22 11:24:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:48,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:24:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:48,738 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:24:48,738 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 11:24:48,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 11:24:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-22 11:24:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:24:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-10-22 11:24:48,747 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2019-10-22 11:24:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:48,748 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-10-22 11:24:48,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-10-22 11:24:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:48,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:48,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:48,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:48,950 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:48,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash -715869343, now seen corresponding path program 1 times [2019-10-22 11:24:48,951 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:48,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1452849247] [2019-10-22 11:24:48,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 11:24:49,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:49,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:49,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:24:49,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:49,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:12 [2019-10-22 11:24:49,175 INFO L375 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 16 treesize of output 8 [2019-10-22 11:24:49,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:49,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-22 11:24:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:49,199 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:49,240 INFO L375 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 16 treesize of output 14 [2019-10-22 11:24:49,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,253 INFO L567 ElimStorePlain]: treesize reduction 17, result has 19.0 percent of original size [2019-10-22 11:24:49,253 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:49,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:49,255 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-22 11:24:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:49,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452849247] [2019-10-22 11:24:49,259 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-10-22 11:24:49,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111876873] [2019-10-22 11:24:49,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:49,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:49,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:49,261 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 9 states. [2019-10-22 11:24:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,328 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2019-10-22 11:24:53,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:53,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 11:24:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,329 INFO L225 Difference]: With dead ends: 208 [2019-10-22 11:24:53,329 INFO L226 Difference]: Without dead ends: 206 [2019-10-22 11:24:53,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-22 11:24:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 96. [2019-10-22 11:24:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 11:24:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-10-22 11:24:53,339 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 21 [2019-10-22 11:24:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,340 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-10-22 11:24:53,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-10-22 11:24:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:53,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:53,542 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1763969053, now seen corresponding path program 1 times [2019-10-22 11:24:53,543 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:53,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [476630667] [2019-10-22 11:24:53,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 11:24:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:53,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:53,703 INFO L375 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 16 treesize of output 17 [2019-10-22 11:24:53,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:53,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:53,723 INFO L375 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 16 treesize of output 17 [2019-10-22 11:24:53,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:53,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:22 [2019-10-22 11:24:53,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 11:24:53,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:53,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 11:24:53,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:53,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-22 11:24:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:53,806 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:53,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [476630667] [2019-10-22 11:24:53,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100918134] [2019-10-22 11:24:53,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 11:24:53,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:53,974 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-22 11:24:53,974 INFO L375 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 1 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:24:53,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:53,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:53,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:8 [2019-10-22 11:24:54,026 INFO L375 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 16 treesize of output 8 [2019-10-22 11:24:54,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:54,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:54,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:54,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-22 11:24:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:54,050 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:54,064 INFO L375 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 16 treesize of output 14 [2019-10-22 11:24:54,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:54,074 INFO L567 ElimStorePlain]: treesize reduction 17, result has 19.0 percent of original size [2019-10-22 11:24:54,075 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:54,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:54,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:54,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:16, output treesize:4 [2019-10-22 11:24:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:54,078 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-10-22 11:24:54,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7, 6] total 13 [2019-10-22 11:24:54,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966105778] [2019-10-22 11:24:54,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:54,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:54,080 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2019-10-22 11:24:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:55,189 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2019-10-22 11:24:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:55,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-22 11:24:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:55,191 INFO L225 Difference]: With dead ends: 206 [2019-10-22 11:24:55,191 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 11:24:55,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:24:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 11:24:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 102. [2019-10-22 11:24:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 11:24:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-10-22 11:24:55,204 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 21 [2019-10-22 11:24:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:55,204 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-10-22 11:24:55,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-10-22 11:24:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:55,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:55,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:55,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:55,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1944987570, now seen corresponding path program 1 times [2019-10-22 11:24:55,607 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:55,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1411326804] [2019-10-22 11:24:55,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d446c5-5ac4-491b-a701-3ea08f2e05ef/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:55,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 11:24:55,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:55,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:24:55,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:24:55,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2019-10-22 11:24:55,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:55,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:24:55,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:55,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:24:55,854 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,873 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:63, output treesize:25 [2019-10-22 11:24:55,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:55,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-22 11:24:55,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:55,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-22 11:24:55,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:55,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:55,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:41 [2019-10-22 11:24:56,059 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-22 11:24:56,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2019-10-22 11:24:56,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:56,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:56,062 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:56,100 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-10-22 11:24:56,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:56,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-22 11:24:56,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:56,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:56,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:56,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2019-10-22 11:24:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:56,144 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:56,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:56,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:56,534 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:24:56,539 INFO L168 Benchmark]: Toolchain (without parser) took 14806.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 947.0 MB in the beginning and 960.5 MB in the end (delta: -13.6 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:56,540 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:56,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:56,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:56,541 INFO L168 Benchmark]: Boogie Preprocessor took 76.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:56,542 INFO L168 Benchmark]: RCFGBuilder took 1152.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:56,542 INFO L168 Benchmark]: TraceAbstraction took 12737.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 105.1 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:56,545 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 759.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1152.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12737.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 105.1 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...