./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/tree_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 937f48f52d5f1e5180502021b53b09e27d2211af --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 13:29:53,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:29:53,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:29:53,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:29:53,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:29:53,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:29:53,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:29:53,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:29:53,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:29:53,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:29:53,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:29:53,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:29:53,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:29:53,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:29:53,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:29:53,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:29:53,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:29:53,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:29:53,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:29:53,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:29:53,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:29:53,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:29:53,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:29:53,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:29:53,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:29:53,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:29:53,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:29:53,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:29:53,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:29:53,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:29:53,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:29:53,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:29:53,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:29:53,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:29:53,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:29:53,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:29:53,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:29:53,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:29:53,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:29:53,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:29:53,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:29:53,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-21 13:29:53,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:29:53,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:29:53,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:29:53,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:29:53,805 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:29:53,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:29:53,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:29:53,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:29:53,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:29:53,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:29:53,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:29:53,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:29:53,809 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:29:53,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:29:53,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:29:53,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:29:53,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:29:53,810 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:29:53,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:29:53,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:29:53,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:29:53,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:29:53,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:29:53,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:29:53,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:29:53,813 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:29:53,813 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:29:53,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:29:53,814 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 937f48f52d5f1e5180502021b53b09e27d2211af Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:29:54,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:29:54,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:29:54,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:29:54,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:29:54,123 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:29:54,125 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2019-11-21 13:29:54,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03438c15f/183a8870a6a74d73a6c3a39a8b7b0a33/FLAG9d10d7a21 [2019-11-21 13:29:54,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:29:54,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2019-11-21 13:29:54,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03438c15f/183a8870a6a74d73a6c3a39a8b7b0a33/FLAG9d10d7a21 [2019-11-21 13:29:55,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03438c15f/183a8870a6a74d73a6c3a39a8b7b0a33 [2019-11-21 13:29:55,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:29:55,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:29:55,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:29:55,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:29:55,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:29:55,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfd43cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55, skipping insertion in model container [2019-11-21 13:29:55,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:29:55,127 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:29:55,306 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:29:55,313 INFO L969 CHandler]: at location: C: (struct node *)malloc(sizeof(struct node)) [22] [2019-11-21 13:29:55,313 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:29:55,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:29:55,359 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:29:55,363 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:29:55,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:29:55,390 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:29:55,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:29:55,495 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:29:55,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55 WrapperNode [2019-11-21 13:29:55,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:29:55,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:29:55,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:29:55,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:29:55,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... [2019-11-21 13:29:55,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:29:55,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:29:55,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:29:55,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:29:55,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:55,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:29:55,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:29:55,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 13:29:55,607 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2019-11-21 13:29:55,607 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-11-21 13:29:55,608 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-21 13:29:55,608 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2019-11-21 13:29:55,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:29:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:29:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:29:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2019-11-21 13:29:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-21 13:29:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure task [2019-11-21 13:29:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:29:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:29:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:29:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:29:56,154 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:29:56,154 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-21 13:29:56,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:29:56 BoogieIcfgContainer [2019-11-21 13:29:56,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:29:56,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:29:56,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:29:56,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:29:56,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:29:55" (1/3) ... [2019-11-21 13:29:56,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a983ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:29:56, skipping insertion in model container [2019-11-21 13:29:56,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:29:55" (2/3) ... [2019-11-21 13:29:56,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a983ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:29:56, skipping insertion in model container [2019-11-21 13:29:56,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:29:56" (3/3) ... [2019-11-21 13:29:56,168 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max.c [2019-11-21 13:29:56,176 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:29:56,183 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-21 13:29:56,195 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-21 13:29:56,214 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:29:56,214 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:29:56,214 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:29:56,214 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:29:56,215 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:29:56,215 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:29:56,215 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:29:56,215 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:29:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-21 13:29:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 13:29:56,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:56,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:56,241 INFO L410 AbstractCegarLoop]: === Iteration 1 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:29:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -43420141, now seen corresponding path program 1 times [2019-11-21 13:29:56,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:56,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [280302281] [2019-11-21 13:29:56,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:29:56,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 13:29:56,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:56,447 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-21 13:29:56,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:56,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:56,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:56,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:29:56,474 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-21 13:29:56,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:56,491 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-21 13:29:56,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280302281] [2019-11-21 13:29:56,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:29:56,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 13:29:56,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980866230] [2019-11-21 13:29:56,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 13:29:56,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:29:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 13:29:56,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:29:56,515 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-21 13:29:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:29:56,672 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-11-21 13:29:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:29:56,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 13:29:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:29:56,687 INFO L225 Difference]: With dead ends: 81 [2019-11-21 13:29:56,688 INFO L226 Difference]: Without dead ends: 78 [2019-11-21 13:29:56,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-21 13:29:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-21 13:29:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-21 13:29:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-21 13:29:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-21 13:29:56,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 8 [2019-11-21 13:29:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:29:56,744 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-21 13:29:56,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 13:29:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-21 13:29:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 13:29:56,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:56,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:56,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:56,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:29:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -43420140, now seen corresponding path program 1 times [2019-11-21 13:29:56,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:56,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1890016639] [2019-11-21 13:29:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:29:57,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:29:57,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:57,053 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-21 13:29:57,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:57,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:57,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:57,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:29:57,072 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-21 13:29:57,073 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:57,122 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-21 13:29:57,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1890016639] [2019-11-21 13:29:57,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:29:57,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 13:29:57,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806466342] [2019-11-21 13:29:57,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:29:57,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:29:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:29:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:29:57,126 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 4 states. [2019-11-21 13:29:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:29:57,395 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-21 13:29:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:29:57,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-21 13:29:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:29:57,399 INFO L225 Difference]: With dead ends: 75 [2019-11-21 13:29:57,399 INFO L226 Difference]: Without dead ends: 75 [2019-11-21 13:29:57,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-21 13:29:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-21 13:29:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-21 13:29:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-21 13:29:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-11-21 13:29:57,413 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 8 [2019-11-21 13:29:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:29:57,414 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-11-21 13:29:57,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:29:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-11-21 13:29:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 13:29:57,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:57,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:57,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:57,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:29:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 217008753, now seen corresponding path program 1 times [2019-11-21 13:29:57,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:57,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [16368146] [2019-11-21 13:29:57,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:29:57,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 13:29:57,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:57,814 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-21 13:29:57,814 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:57,880 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-21 13:29:57,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [16368146] [2019-11-21 13:29:57,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:29:57,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-21 13:29:57,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221424388] [2019-11-21 13:29:57,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:29:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:29:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:29:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:29:57,883 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 8 states. [2019-11-21 13:29:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:29:58,055 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2019-11-21 13:29:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:29:58,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-21 13:29:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:29:58,058 INFO L225 Difference]: With dead ends: 91 [2019-11-21 13:29:58,058 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 13:29:58,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:29:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 13:29:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-11-21 13:29:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 13:29:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2019-11-21 13:29:58,073 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 15 [2019-11-21 13:29:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:29:58,073 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2019-11-21 13:29:58,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:29:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2019-11-21 13:29:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-21 13:29:58,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:58,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:58,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:58,277 INFO L410 AbstractCegarLoop]: === Iteration 4 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:29:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1938775108, now seen corresponding path program 1 times [2019-11-21 13:29:58,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:58,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1649599604] [2019-11-21 13:29:58,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:29:58,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:29:58,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:58,420 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-21 13:29:58,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:58,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:58,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:58,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:29:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:29:58,456 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:29:58,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649599604] [2019-11-21 13:29:58,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:29:58,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 13:29:58,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737937896] [2019-11-21 13:29:58,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:29:58,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:29:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:29:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:29:58,522 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand 5 states. [2019-11-21 13:29:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:29:58,933 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-21 13:29:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:29:58,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-21 13:29:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:29:58,936 INFO L225 Difference]: With dead ends: 88 [2019-11-21 13:29:58,936 INFO L226 Difference]: Without dead ends: 84 [2019-11-21 13:29:58,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:29:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-21 13:29:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-21 13:29:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 13:29:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2019-11-21 13:29:58,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 14 [2019-11-21 13:29:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:29:58,948 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2019-11-21 13:29:58,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:29:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2019-11-21 13:29:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-21 13:29:58,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:58,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:59,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:59,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:29:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1938775109, now seen corresponding path program 1 times [2019-11-21 13:29:59,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:59,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [442086829] [2019-11-21 13:29:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:29:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:29:59,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:29:59,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:59,270 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-21 13:29:59,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:59,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:59,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:59,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:29:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:29:59,296 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:59,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:29:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:29:59,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [442086829] [2019-11-21 13:29:59,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:29:59,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 13:29:59,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271802067] [2019-11-21 13:29:59,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 13:29:59,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:29:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 13:29:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:29:59,448 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand 6 states. [2019-11-21 13:30:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:30:00,110 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2019-11-21 13:30:00,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:30:00,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-21 13:30:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:30:00,114 INFO L225 Difference]: With dead ends: 96 [2019-11-21 13:30:00,114 INFO L226 Difference]: Without dead ends: 96 [2019-11-21 13:30:00,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:30:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-21 13:30:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-11-21 13:30:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 13:30:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-21 13:30:00,136 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 14 [2019-11-21 13:30:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:30:00,136 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-21 13:30:00,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 13:30:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-11-21 13:30:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 13:30:00,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:30:00,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:30:00,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:30:00,339 INFO L410 AbstractCegarLoop]: === Iteration 6 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:30:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:30:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash 28453509, now seen corresponding path program 1 times [2019-11-21 13:30:00,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:30:00,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [493779146] [2019-11-21 13:30:00,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-21 13:30:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:30:00,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 13:30:00,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:30:00,515 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-21 13:30:00,516 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:30:00,589 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-21 13:30:00,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493779146] [2019-11-21 13:30:00,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:30:00,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-21 13:30:00,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052238471] [2019-11-21 13:30:00,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:30:00,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:30:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:30:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:30:00,591 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 8 states. [2019-11-21 13:30:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:30:00,710 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-11-21 13:30:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:30:00,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-21 13:30:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:30:00,713 INFO L225 Difference]: With dead ends: 94 [2019-11-21 13:30:00,713 INFO L226 Difference]: Without dead ends: 81 [2019-11-21 13:30:00,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:30:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-21 13:30:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-21 13:30:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 13:30:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2019-11-21 13:30:00,729 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 21 [2019-11-21 13:30:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:30:00,730 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2019-11-21 13:30:00,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:30:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2019-11-21 13:30:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 13:30:00,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:30:00,732 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:30:00,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:30:00,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [nondet_treeErr1REQUIRES_VIOLATION, nondet_treeErr0REQUIRES_VIOLATION, nondet_treeErr5REQUIRES_VIOLATION, nondet_treeErr4REQUIRES_VIOLATION, nondet_treeErr3REQUIRES_VIOLATION, nondet_treeErr2REQUIRES_VIOLATION, maxErr1REQUIRES_VIOLATION, maxErr0REQUIRES_VIOLATION, maxErr5REQUIRES_VIOLATION, maxErr4REQUIRES_VIOLATION, maxErr3REQUIRES_VIOLATION, maxErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION]=== [2019-11-21 13:30:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:30:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -979358506, now seen corresponding path program 1 times [2019-11-21 13:30:00,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:30:00,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1792000322] [2019-11-21 13:30:00,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:30:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:30:01,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 13:30:01,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:30:01,386 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-21 13:30:01,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:30:01,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:30:01,400 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-21 13:30:01,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:30:01,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:30:01,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:30:01,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:30:01,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:30:01,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 13:30:01,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:30:01,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:30:01,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:30:01,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 13:30:01,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:30:01,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:30:01,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:30:01,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-21 13:30:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 13:30:01,591 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:30:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:30:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:30:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:30:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:30:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:30:01,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:30:01,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:30:01,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:30:05,934 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-11-21 13:30:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:30:05,992 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-21 13:30:06,015 INFO L392 ElimStorePlain]: Different costs {3=[|v_old(#length)_BEFORE_CALL_3|], 6=[|v_old(#valid)_BEFORE_CALL_3|]} [2019-11-21 13:30:06,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:30:06,217 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) 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-21 13:30:06,223 INFO L168 Benchmark]: Toolchain (without parser) took 11137.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-21 13:30:06,224 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:30:06,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 13:30:06,228 INFO L168 Benchmark]: Boogie Preprocessor took 46.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:30:06,228 INFO L168 Benchmark]: RCFGBuilder took 612.30 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:30:06,229 INFO L168 Benchmark]: TraceAbstraction took 10062.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.6 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-11-21 13:30:06,241 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 612.30 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10062.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.6 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...