./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 64bit -------------------------------------------------------------------------------- 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-64bit-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 64bit --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 12:13:04,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:13:04,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:13:04,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:13:04,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:13:04,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:13:04,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:13:04,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:13:04,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:13:04,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:13:04,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:13:04,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:13:04,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:13:04,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:13:04,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:13:04,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:13:04,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:13:04,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:13:04,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:13:04,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:13:04,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:13:04,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:13:04,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:13:04,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:13:04,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:13:04,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:13:04,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:13:04,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:13:04,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:13:04,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:13:04,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:13:04,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:13:04,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:13:04,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:13:04,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:13:04,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:13:04,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:13:04,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:13:04,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:13:04,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:13:04,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:13:04,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf [2019-11-21 12:13:04,191 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:13:04,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:13:04,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:13:04,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:13:04,196 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:13:04,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:13:04,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:13:04,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:13:04,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:13:04,197 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:13:04,197 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:13:04,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:13:04,200 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:13:04,200 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:13:04,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:13:04,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:13:04,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:13:04,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:13:04,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:13:04,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:13:04,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:13:04,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:13:04,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:13:04,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:13:04,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:13:04,206 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 -> 64bit 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 12:13:04,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:13:04,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:13:04,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:13:04,533 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:13:04,533 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:13:04,534 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 12:13:04,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf164e9f1/31df485dbd66472ea34065836841402d/FLAGe7ce71b19 [2019-11-21 12:13:05,060 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:13:05,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2019-11-21 12:13:05,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf164e9f1/31df485dbd66472ea34065836841402d/FLAGe7ce71b19 [2019-11-21 12:13:05,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf164e9f1/31df485dbd66472ea34065836841402d [2019-11-21 12:13:05,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:13:05,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:13:05,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:13:05,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:13:05,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:13:05,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33339763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05, skipping insertion in model container [2019-11-21 12:13:05,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:13:05,502 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:13:05,679 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 12:13:05,679 INFO L969 CHandler]: at location: C: (struct node *)malloc(sizeof(struct node)) [22] [2019-11-21 12:13:05,680 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:13:05,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:13:05,716 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:13:05,720 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:13:05,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:13:05,742 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:13:05,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:13:05,853 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:13:05,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05 WrapperNode [2019-11-21 12:13:05,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:13:05,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:13:05,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:13:05,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:13:05,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (1/1) ... [2019-11-21 12:13:05,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:13:05,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:13:05,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:13:05,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:13:05,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (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 12:13:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:13:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:13:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 12:13:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2019-11-21 12:13:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-11-21 12:13:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-21 12:13:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2019-11-21 12:13:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:13:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:13:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:13:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:13:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-21 12:13:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:13:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure task [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:13:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:13:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:13:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:13:06,482 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:13:06,482 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-21 12:13:06,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:13:06 BoogieIcfgContainer [2019-11-21 12:13:06,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:13:06,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:13:06,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:13:06,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:13:06,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:13:05" (1/3) ... [2019-11-21 12:13:06,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7934594d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:13:06, skipping insertion in model container [2019-11-21 12:13:06,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:13:05" (2/3) ... [2019-11-21 12:13:06,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7934594d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:13:06, skipping insertion in model container [2019-11-21 12:13:06,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:13:06" (3/3) ... [2019-11-21 12:13:06,492 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max.c [2019-11-21 12:13:06,500 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:13:06,506 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-21 12:13:06,518 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-21 12:13:06,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:13:06,539 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:13:06,539 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:13:06,539 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:13:06,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:13:06,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:13:06,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:13:06,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:13:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-21 12:13:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:13:06,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:06,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:13:06,570 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 12:13:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -43420141, now seen corresponding path program 1 times [2019-11-21 12:13:06,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:06,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [976098912] [2019-11-21 12:13:06,589 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 12:13:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:06,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 12:13:06,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:06,785 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 12:13:06,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:06,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:06,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:13:06,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:13:06,807 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 12:13:06,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:06,821 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 12:13:06,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [976098912] [2019-11-21 12:13:06,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:06,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:13:06,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4396427] [2019-11-21 12:13:06,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:13:06,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:13:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:13:06,848 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-21 12:13:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:07,009 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-11-21 12:13:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:13:07,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 12:13:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:07,025 INFO L225 Difference]: With dead ends: 81 [2019-11-21 12:13:07,025 INFO L226 Difference]: Without dead ends: 78 [2019-11-21 12:13:07,027 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 12:13:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-21 12:13:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-21 12:13:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-21 12:13:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-21 12:13:07,078 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 8 [2019-11-21 12:13:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:07,079 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-21 12:13:07,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:13:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-21 12:13:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:13:07,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:07,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:13:07,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:07,291 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 12:13:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash -43420140, now seen corresponding path program 1 times [2019-11-21 12:13:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1938091141] [2019-11-21 12:13:07,292 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 12:13:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:07,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:13:07,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:07,393 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 12:13:07,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:07,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:07,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:13:07,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:13:07,420 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 12:13:07,420 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:07,464 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 12:13:07,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1938091141] [2019-11-21 12:13:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:13:07,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324413518] [2019-11-21 12:13:07,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:13:07,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:13:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:13:07,470 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 4 states. [2019-11-21 12:13:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:07,732 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-21 12:13:07,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:13:07,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-21 12:13:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:07,738 INFO L225 Difference]: With dead ends: 75 [2019-11-21 12:13:07,739 INFO L226 Difference]: Without dead ends: 75 [2019-11-21 12:13:07,740 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 12:13:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-21 12:13:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-21 12:13:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-21 12:13:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-11-21 12:13:07,759 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 8 [2019-11-21 12:13:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:07,760 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-11-21 12:13:07,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:13:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-11-21 12:13:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 12:13:07,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:07,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:13:07,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:07,967 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 12:13:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 217008753, now seen corresponding path program 1 times [2019-11-21 12:13:07,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:07,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1107731398] [2019-11-21 12:13:07,970 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 12:13:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:08,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 12:13:08,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:08,165 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 12:13:08,166 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:08,226 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 12:13:08,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1107731398] [2019-11-21 12:13:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:08,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-21 12:13:08,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906224965] [2019-11-21 12:13:08,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:13:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:13:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:13:08,229 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 8 states. [2019-11-21 12:13:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:08,393 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2019-11-21 12:13:08,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:13:08,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-21 12:13:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:08,395 INFO L225 Difference]: With dead ends: 91 [2019-11-21 12:13:08,396 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 12:13:08,396 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 12:13:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 12:13:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-11-21 12:13:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 12:13:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2019-11-21 12:13:08,411 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 15 [2019-11-21 12:13:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:08,412 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2019-11-21 12:13:08,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:13:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2019-11-21 12:13:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-21 12:13:08,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:08,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:13:08,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:08,624 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 12:13:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1938775108, now seen corresponding path program 1 times [2019-11-21 12:13:08,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:08,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1702998607] [2019-11-21 12:13:08,625 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 12:13:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:08,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:13:08,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:08,745 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 12:13:08,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:08,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:08,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:13:08,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:13:08,776 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 12:13:08,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:08,828 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 12:13:08,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1702998607] [2019-11-21 12:13:08,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:08,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:13:08,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234504134] [2019-11-21 12:13:08,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:13:08,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:13:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:13:08,831 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand 5 states. [2019-11-21 12:13:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:09,222 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-21 12:13:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:13:09,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-21 12:13:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:09,225 INFO L225 Difference]: With dead ends: 88 [2019-11-21 12:13:09,225 INFO L226 Difference]: Without dead ends: 84 [2019-11-21 12:13:09,226 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 12:13:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-21 12:13:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-21 12:13:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 12:13:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2019-11-21 12:13:09,237 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 14 [2019-11-21 12:13:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:09,238 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2019-11-21 12:13:09,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:13:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2019-11-21 12:13:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-21 12:13:09,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:09,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:13:09,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:09,441 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 12:13:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1938775109, now seen corresponding path program 1 times [2019-11-21 12:13:09,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:09,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [850553173] [2019-11-21 12:13:09,444 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 12:13:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:09,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:13:09,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:09,561 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 12:13:09,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:09,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:09,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:13:09,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:13:09,589 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 12:13:09,590 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:09,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:09,683 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 12:13:09,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850553173] [2019-11-21 12:13:09,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:09,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 12:13:09,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33609833] [2019-11-21 12:13:09,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:13:09,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:13:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:13:09,686 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand 6 states. [2019-11-21 12:13:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:10,309 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2019-11-21 12:13:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:13:10,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-21 12:13:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:10,313 INFO L225 Difference]: With dead ends: 96 [2019-11-21 12:13:10,313 INFO L226 Difference]: Without dead ends: 96 [2019-11-21 12:13:10,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:13:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-21 12:13:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-11-21 12:13:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 12:13:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-21 12:13:10,324 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 14 [2019-11-21 12:13:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:10,325 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-21 12:13:10,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:13:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-11-21 12:13:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:13:10,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:10,326 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 12:13:10,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:10,530 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 12:13:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash 28453509, now seen corresponding path program 1 times [2019-11-21 12:13:10,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:10,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [107985113] [2019-11-21 12:13:10,532 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 12:13:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:10,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 12:13:10,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:10,726 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 12:13:10,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:10,791 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 12:13:10,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107985113] [2019-11-21 12:13:10,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:13:10,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-21 12:13:10,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686845334] [2019-11-21 12:13:10,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:13:10,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:13:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:13:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:13:10,794 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 8 states. [2019-11-21 12:13:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:13:10,922 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-11-21 12:13:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:13:10,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-21 12:13:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:13:10,924 INFO L225 Difference]: With dead ends: 94 [2019-11-21 12:13:10,924 INFO L226 Difference]: Without dead ends: 81 [2019-11-21 12:13:10,925 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 12:13:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-21 12:13:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-21 12:13:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 12:13:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2019-11-21 12:13:10,934 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 21 [2019-11-21 12:13:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:13:10,935 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2019-11-21 12:13:10,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:13:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2019-11-21 12:13:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 12:13:10,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:13:10,936 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 12:13:11,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:11,143 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 12:13:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:13:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -979358506, now seen corresponding path program 1 times [2019-11-21 12:13:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:13:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [74762352] [2019-11-21 12:13:11,144 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 12:13:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:13:11,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 12:13:11,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:13:11,558 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 12:13:11,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:11,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:11,576 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 12:13:11,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:11,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:11,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:13:11,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:13:11,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:13:11,748 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 12:13:11,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:11,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:11,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:11,776 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 12:13:11,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:13:11,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:11,794 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 12:13:11,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-21 12:13:11,829 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 12:13:11,829 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:13:11,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:13:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:13:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:13:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:13:16,835 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-11-21 12:13:16,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:13:16,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-21 12:13:16,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 12:13:16,914 INFO L392 ElimStorePlain]: Different costs {3=[|v_old(#length)_BEFORE_CALL_3|], 6=[|v_old(#valid)_BEFORE_CALL_3|]} [2019-11-21 12:13:17,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:17,125 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 12:13:17,130 INFO L168 Benchmark]: Toolchain (without parser) took 11662.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:17,131 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:13:17,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:17,132 INFO L168 Benchmark]: Boogie Preprocessor took 46.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:13:17,133 INFO L168 Benchmark]: RCFGBuilder took 582.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:17,133 INFO L168 Benchmark]: TraceAbstraction took 10643.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.5 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:17,137 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 582.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10643.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.5 MB). Peak memory consumption was 28.9 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...