./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:58:00,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:58:00,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:58:00,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:58:00,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:58:00,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:58:00,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:58:00,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:58:00,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:58:00,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:58:00,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:58:00,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:58:00,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:58:00,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:58:00,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:58:00,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:58:00,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:58:00,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:58:00,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:58:00,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:58:00,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:58:00,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:58:00,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:58:00,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:58:00,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:58:00,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:58:00,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:58:00,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:58:00,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:58:00,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:58:00,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:58:00,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:58:00,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:58:00,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:58:00,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:58:00,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:58:00,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:58:00,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:58:00,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:58:00,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:58:00,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:58:00,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:58:00,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:58:00,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:58:00,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:58:00,751 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:58:00,751 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:58:00,752 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:58:00,752 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:58:00,752 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:58:00,752 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:58:00,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:58:00,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:58:00,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:58:00,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:58:00,754 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:58:00,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:58:00,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:58:00,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:58:00,755 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:58:00,755 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:58:00,756 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:58:00,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:58:00,756 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:58:00,756 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:58:00,756 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:58:00,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:58:00,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:58:00,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:58:00,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:58:00,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:58:00,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:58:00,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:58:00,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:58:00,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:58:00,759 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:58:00,759 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:58:00,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:58:00,759 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc [2019-11-26 02:58:00,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:58:00,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:58:00,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:58:00,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:58:00,934 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:58:00,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-11-26 02:58:00,987 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/data/ee25979df/d87b7589643e48b683d3f010bef269b1/FLAGdb676530f [2019-11-26 02:58:01,438 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:58:01,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-11-26 02:58:01,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/data/ee25979df/d87b7589643e48b683d3f010bef269b1/FLAGdb676530f [2019-11-26 02:58:01,795 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/data/ee25979df/d87b7589643e48b683d3f010bef269b1 [2019-11-26 02:58:01,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:58:01,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:58:01,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:58:01,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:58:01,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:58:01,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:01" (1/1) ... [2019-11-26 02:58:01,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f5cb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:01, skipping insertion in model container [2019-11-26 02:58:01,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:01" (1/1) ... [2019-11-26 02:58:01,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:58:01,859 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:58:02,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:58:02,274 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:58:02,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:58:02,413 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:58:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02 WrapperNode [2019-11-26 02:58:02,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:58:02,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:58:02,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:58:02,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:58:02,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:58:02,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:58:02,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:58:02,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:58:02,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... [2019-11-26 02:58:02,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:58:02,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:58:02,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:58:02,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:58:02,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:58:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:58:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:58:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:58:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:58:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:58:02,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:58:02,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:58:03,170 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:58:03,170 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-26 02:58:03,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:58:03 BoogieIcfgContainer [2019-11-26 02:58:03,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:58:03,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:58:03,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:58:03,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:58:03,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:58:01" (1/3) ... [2019-11-26 02:58:03,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adcd2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:58:03, skipping insertion in model container [2019-11-26 02:58:03,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:02" (2/3) ... [2019-11-26 02:58:03,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adcd2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:58:03, skipping insertion in model container [2019-11-26 02:58:03,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:58:03" (3/3) ... [2019-11-26 02:58:03,180 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2019-11-26 02:58:03,188 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:58:03,193 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2019-11-26 02:58:03,204 INFO L249 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2019-11-26 02:58:03,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:58:03,220 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:58:03,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:58:03,221 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:58:03,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:58:03,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:58:03,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:58:03,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:58:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-26 02:58:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:58:03,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:03,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:58:03,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-11-26 02:58:03,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:03,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1392796131] [2019-11-26 02:58:03,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:03,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:58:03,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:03,478 INFO L377 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-11-26 02:58:03,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:03,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:03,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:03,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:58:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:03,494 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:03,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1392796131] [2019-11-26 02:58:03,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:03,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:58:03,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695299749] [2019-11-26 02:58:03,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:58:03,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:58:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:58:03,515 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-11-26 02:58:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:03,703 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-26 02:58:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:58:03,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-26 02:58:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:03,713 INFO L225 Difference]: With dead ends: 72 [2019-11-26 02:58:03,713 INFO L226 Difference]: Without dead ends: 66 [2019-11-26 02:58:03,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-26 02:58:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-26 02:58:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-11-26 02:58:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-26 02:58:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-11-26 02:58:03,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 4 [2019-11-26 02:58:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:03,746 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-11-26 02:58:03,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:58:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-11-26 02:58:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:58:03,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:03,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:58:03,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:03,957 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-11-26 02:58:03,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:03,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044095885] [2019-11-26 02:58:03,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:04,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:58:04,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:04,056 INFO L377 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-11-26 02:58:04,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:04,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:04,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:04,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:58:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:04,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:04,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044095885] [2019-11-26 02:58:04,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:04,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:58:04,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372989793] [2019-11-26 02:58:04,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:04,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:04,128 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 4 states. [2019-11-26 02:58:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:04,255 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-11-26 02:58:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:58:04,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-26 02:58:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:04,257 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:58:04,257 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:58:04,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:58:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:58:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:58:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-26 02:58:04,263 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 4 [2019-11-26 02:58:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:04,264 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-26 02:58:04,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-26 02:58:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:58:04,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:04,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:04,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:04,467 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2019-11-26 02:58:04,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:04,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1363965608] [2019-11-26 02:58:04,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:04,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:58:04,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:04,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:04,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:58:04,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:04,629 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:58:04,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:04,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-26 02:58:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:04,657 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:04,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1363965608] [2019-11-26 02:58:04,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:04,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-26 02:58:04,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548193199] [2019-11-26 02:58:04,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:04,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:04,667 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 4 states. [2019-11-26 02:58:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:04,899 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-26 02:58:04,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:58:04,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:58:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:04,901 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:58:04,901 INFO L226 Difference]: Without dead ends: 81 [2019-11-26 02:58:04,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-26 02:58:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 47. [2019-11-26 02:58:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-26 02:58:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-11-26 02:58:04,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 9 [2019-11-26 02:58:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:04,908 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-11-26 02:58:04,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-11-26 02:58:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:58:04,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:04,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:05,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:05,115 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2019-11-26 02:58:05,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:05,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [554562428] [2019-11-26 02:58:05,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:05,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:58:05,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:05,234 INFO L377 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-11-26 02:58:05,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:05,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:05,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:05,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:58:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:05,255 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:05,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [554562428] [2019-11-26 02:58:05,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:05,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:58:05,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274359598] [2019-11-26 02:58:05,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:05,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:05,287 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 4 states. [2019-11-26 02:58:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:05,516 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-11-26 02:58:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:58:05,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:58:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:05,519 INFO L225 Difference]: With dead ends: 80 [2019-11-26 02:58:05,519 INFO L226 Difference]: Without dead ends: 80 [2019-11-26 02:58:05,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-26 02:58:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 45. [2019-11-26 02:58:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:58:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-11-26 02:58:05,528 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 9 [2019-11-26 02:58:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:05,528 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-11-26 02:58:05,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-11-26 02:58:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:58:05,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:05,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:05,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:05,730 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1837803479, now seen corresponding path program 1 times [2019-11-26 02:58:05,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:05,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [726858421] [2019-11-26 02:58:05,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:05,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:58:05,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:05,850 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:05,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [726858421] [2019-11-26 02:58:05,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:05,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:58:05,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792250192] [2019-11-26 02:58:05,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:05,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:05,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:05,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:05,862 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2019-11-26 02:58:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:05,879 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-26 02:58:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:58:05,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:58:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:05,881 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:58:05,881 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:58:05,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:58:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-26 02:58:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:58:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-11-26 02:58:05,887 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 11 [2019-11-26 02:58:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:05,887 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-11-26 02:58:05,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-11-26 02:58:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:58:05,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:05,888 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:06,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:06,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash 760120087, now seen corresponding path program 1 times [2019-11-26 02:58:06,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:06,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1465385669] [2019-11-26 02:58:06,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:06,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:58:06,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:06,264 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:06,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1465385669] [2019-11-26 02:58:06,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566847808] [2019-11-26 02:58:06,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:06,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:58:06,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:06,402 INFO L377 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-11-26 02:58:06,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:06,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:06,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:06,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:58:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:06,482 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:06,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:58:06,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5] total 12 [2019-11-26 02:58:06,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687189956] [2019-11-26 02:58:06,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:58:06,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:58:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:58:06,507 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-11-26 02:58:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:06,878 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-26 02:58:06,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:58:06,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-26 02:58:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:06,880 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:58:06,880 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:58:06,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:58:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:58:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2019-11-26 02:58:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-26 02:58:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-26 02:58:06,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 21 [2019-11-26 02:58:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:06,885 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-26 02:58:06,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:58:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-26 02:58:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:58:06,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:06,886 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:07,293 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-11-26 02:58:07,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash 760120088, now seen corresponding path program 1 times [2019-11-26 02:58:07,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:07,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1552014627] [2019-11-26 02:58:07,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/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-11-26 02:58:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:07,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:58:07,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:07,457 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:07,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1552014627] [2019-11-26 02:58:07,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392457826] [2019-11-26 02:58:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:07,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:58:07,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:07,609 INFO L377 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-11-26 02:58:07,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:07,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:07,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:07,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:58:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:07,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:08,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:58:08,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 7] imperfect sequences [5, 5] total 18 [2019-11-26 02:58:08,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328280474] [2019-11-26 02:58:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:58:08,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:58:08,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:58:08,167 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 12 states. [2019-11-26 02:58:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:08,815 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-26 02:58:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:58:08,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-26 02:58:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:08,817 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:58:08,817 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:58:08,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:58:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:58:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-26 02:58:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:58:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-11-26 02:58:08,821 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 21 [2019-11-26 02:58:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:08,821 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-11-26 02:58:08,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:58:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-11-26 02:58:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:58:08,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:08,822 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:09,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:09,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1057123719, now seen corresponding path program 1 times [2019-11-26 02:58:09,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:09,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [501999214] [2019-11-26 02:58:09,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:09,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:58:09,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:09,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:09,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [501999214] [2019-11-26 02:58:09,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718726987] [2019-11-26 02:58:09,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:09,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:58:09,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:09,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:58:09,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:58:09,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2019-11-26 02:58:09,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103565033] [2019-11-26 02:58:09,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:58:09,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:58:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:58:09,658 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 10 states. [2019-11-26 02:58:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:09,806 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-26 02:58:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:58:09,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-26 02:58:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:09,807 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:58:09,808 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:58:09,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:58:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:58:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 02:58:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:58:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-26 02:58:09,813 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 27 [2019-11-26 02:58:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:09,813 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-26 02:58:09,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:58:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-26 02:58:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:58:09,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:09,815 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:10,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:10,222 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332025, now seen corresponding path program 2 times [2019-11-26 02:58:10,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:10,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [503143319] [2019-11-26 02:58:10,222 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:10,417 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-26 02:58:10,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331408391] [2019-11-26 02:58:10,418 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:10,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:58:10,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:58:10,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-26 02:58:10,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:10,678 INFO L377 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-11-26 02:58:10,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:10,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-26 02:58:10,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:10,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:58:10,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,781 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-26 02:58:10,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:20 [2019-11-26 02:58:10,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:58:10,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,845 INFO L567 ElimStorePlain]: treesize reduction 3, result has 92.9 percent of original size [2019-11-26 02:58:10,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:58:10,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:10,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:32 [2019-11-26 02:58:10,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:10,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-26 02:58:10,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:10,972 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.7 percent of original size [2019-11-26 02:58:10,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:10,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-26 02:58:10,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:30 [2019-11-26 02:58:11,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-26 02:58:11,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,163 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-11-26 02:58:11,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-26 02:58:11,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:11,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:11,200 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:11,259 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-11-26 02:58:11,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:11,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:11,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-11-26 02:58:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:11,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:11,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-11-26 02:58:11,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,593 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-11-26 02:58:11,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:11,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-26 02:58:11,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,661 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-26 02:58:11,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:11,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:49 [2019-11-26 02:58:11,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,688 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-11-26 02:58:11,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,728 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 02:58:11,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:11,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:11,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:19 [2019-11-26 02:58:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:58:11,840 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:12,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,013 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,082 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,086 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-26 02:58:12,111 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-11-26 02:58:12,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:12,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:12,463 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,473 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,538 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,547 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:12,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-26 02:58:12,585 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:71 [2019-11-26 02:58:12,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-26 02:58:12,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,705 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-11-26 02:58:12,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,744 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,754 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-26 02:58:12,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:58:12,786 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,796 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:12,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:12,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-26 02:58:12,842 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:91, output treesize:43 [2019-11-26 02:58:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:58:13,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [503143319] [2019-11-26 02:58:13,113 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:58:13,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331408391] [2019-11-26 02:58:13,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:58:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-26 02:58:13,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225820339] [2019-11-26 02:58:13,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-26 02:58:13,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:58:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-26 02:58:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:58:13,115 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 25 states. [2019-11-26 02:58:14,461 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-26 02:58:14,823 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-11-26 02:58:15,089 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-11-26 02:58:15,334 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-26 02:58:15,840 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-26 02:58:16,054 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-26 02:58:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:16,482 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-11-26 02:58:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 02:58:16,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-26 02:58:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:16,484 INFO L225 Difference]: With dead ends: 121 [2019-11-26 02:58:16,484 INFO L226 Difference]: Without dead ends: 121 [2019-11-26 02:58:16,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 02:58:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-26 02:58:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2019-11-26 02:58:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 02:58:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-11-26 02:58:16,492 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 37 [2019-11-26 02:58:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:16,492 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-11-26 02:58:16,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-26 02:58:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-11-26 02:58:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:58:16,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:16,494 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:16,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:16,699 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:58:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332024, now seen corresponding path program 1 times [2019-11-26 02:58:16,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:58:16,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [413902244] [2019-11-26 02:58:16,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b8e47d2a-ebf5-498e-a813-9dddd637bde0/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:16,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 02:58:16,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:16,977 INFO L377 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-11-26 02:58:16,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:16,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:16,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:16,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-26 02:58:17,022 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-26 02:58:17,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,047 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-26 02:58:17,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-26 02:58:17,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:58:17,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:58:17,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-11-26 02:58:17,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:17,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-26 02:58:17,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:17,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-26 02:58:17,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-11-26 02:58:17,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-26 02:58:17,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,249 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:17,303 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-11-26 02:58:17,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-26 02:58:17,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,372 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2019-11-26 02:58:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:17,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-11-26 02:58:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:17,539 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-11-26 02:58:17,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:58:17,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-26 02:58:17,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,640 INFO L567 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2019-11-26 02:58:17,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:17,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-11-26 02:58:17,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,661 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-11-26 02:58:17,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:17,705 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 02:58:17,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,753 INFO L567 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-11-26 02:58:17,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:58:17,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-11-26 02:58:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:58:17,861 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:58:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:18,168 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,174 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,181 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,192 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,199 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,206 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:18,301 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:18,306 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,315 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,320 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:18,326 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,330 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:18,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:18,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-26 02:58:18,386 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:367, output treesize:207 [2019-11-26 02:58:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:58:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:58:19,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:19,236 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,249 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,263 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:19,275 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,287 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,733 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-26 02:58:19,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:19,745 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,759 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,774 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,790 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,809 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:19,830 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:58:20,735 WARN L192 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 02:58:20,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:20,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-26 02:58:20,737 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:495, output treesize:575 [2019-11-26 02:58:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:58:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:21,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,629 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,640 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,932 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-26 02:58:21,932 INFO L567 ElimStorePlain]: treesize reduction 114, result has 78.3 percent of original size [2019-11-26 02:58:21,942 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,952 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,964 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:21,975 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 02:58:22,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:22,176 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-26 02:58:22,179 INFO L168 Benchmark]: Toolchain (without parser) took 20380.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:22,179 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:22,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:22,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.34 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:22,180 INFO L168 Benchmark]: Boogie Preprocessor took 33.80 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-11-26 02:58:22,180 INFO L168 Benchmark]: RCFGBuilder took 675.51 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:22,180 INFO L168 Benchmark]: TraceAbstraction took 19006.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.3 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:22,182 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.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.34 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.80 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 675.51 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19006.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.3 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...