./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1105d102f382446f080488a8ecb609878e241e6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1105d102f382446f080488a8ecb609878e241e6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:01:54,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:01:54,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:01:54,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:01:54,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:01:54,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:01:54,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:01:54,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:01:54,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:01:54,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:01:54,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:01:54,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:01:54,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:01:54,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:01:54,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:01:54,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:01:54,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:01:54,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:01:54,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:01:54,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:01:54,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:01:54,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:01:54,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:01:54,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:01:54,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:01:54,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:01:54,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:01:54,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:01:54,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:01:54,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:01:54,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:01:54,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:01:54,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:01:54,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:01:54,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:01:54,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:01:54,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:01:54,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:01:54,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:01:54,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:01:54,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:01:54,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:01:54,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:01:54,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:01:54,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:01:54,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:01:54,684 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:01:54,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:01:54,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:01:54,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:01:54,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:01:54,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:01:54,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:01:54,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:01:54,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:01:54,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:01:54,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:01:54,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:01:54,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:01:54,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:01:54,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:01:54,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:01:54,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:01:54,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:01:54,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:01:54,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:01:54,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:01:54,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:01:54,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:01:54,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:01:54,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:01:54,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! call(__VERIFIER_error())) ) 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 -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-28 17:01:55,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:01:55,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:01:55,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:01:55,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:01:55,036 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:01:55,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2019-11-28 17:01:55,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0873661e/f5e328a80b4d4d1fb50ab2ecae9b0126/FLAG4c444d76b [2019-11-28 17:01:55,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:01:55,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2019-11-28 17:01:55,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0873661e/f5e328a80b4d4d1fb50ab2ecae9b0126/FLAG4c444d76b [2019-11-28 17:01:55,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0873661e/f5e328a80b4d4d1fb50ab2ecae9b0126 [2019-11-28 17:01:55,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:01:55,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:01:55,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:01:55,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:01:55,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:01:55,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:55" (1/1) ... [2019-11-28 17:01:55,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170cd080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:55, skipping insertion in model container [2019-11-28 17:01:55,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:55" (1/1) ... [2019-11-28 17:01:55,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:01:56,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:01:56,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:01:56,426 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:01:56,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:01:56,544 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:01:56,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56 WrapperNode [2019-11-28 17:01:56,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:01:56,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:01:56,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:01:56,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:01:56,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:01:56,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:01:56,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:01:56,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:01:56,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (1/1) ... [2019-11-28 17:01:56,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:01:56,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:01:56,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:01:56,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:01:56,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (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-28 17:01:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:01:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:01:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:01:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:01:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:01:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:01:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:01:57,038 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:01:57,038 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 17:01:57,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:57 BoogieIcfgContainer [2019-11-28 17:01:57,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:01:57,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:01:57,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:01:57,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:01:57,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:01:55" (1/3) ... [2019-11-28 17:01:57,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d7c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:57, skipping insertion in model container [2019-11-28 17:01:57,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:56" (2/3) ... [2019-11-28 17:01:57,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d7c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:57, skipping insertion in model container [2019-11-28 17:01:57,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:57" (3/3) ... [2019-11-28 17:01:57,053 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-28 17:01:57,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:01:57,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:01:57,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:01:57,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:01:57,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:01:57,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:01:57,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:01:57,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:01:57,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:01:57,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:01:57,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:01:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-28 17:01:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:01:57,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:57,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:57,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2019-11-28 17:01:57,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:57,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321562021] [2019-11-28 17:01:57,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:57,255 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-28 17:01:57,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321562021] [2019-11-28 17:01:57,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:01:57,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:01:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032413742] [2019-11-28 17:01:57,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:01:57,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:01:57,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:01:57,281 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-28 17:01:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:57,301 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-28 17:01:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:01:57,303 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 17:01:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:57,315 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:01:57,316 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:01:57,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:01:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:01:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:01:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:01:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-28 17:01:57,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2019-11-28 17:01:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:57,361 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 17:01:57,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:01:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-11-28 17:01:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:01:57,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:57,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:57,363 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2019-11-28 17:01:57,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:57,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196237742] [2019-11-28 17:01:57,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:57,548 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-28 17:01:57,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196237742] [2019-11-28 17:01:57,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:01:57,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:01:57,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794218617] [2019-11-28 17:01:57,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:01:57,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:01:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:01:57,554 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2019-11-28 17:01:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:57,650 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-11-28 17:01:57,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:01:57,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 17:01:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:57,652 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:01:57,652 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 17:01:57,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:01:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 17:01:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 17:01:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 17:01:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 17:01:57,659 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-11-28 17:01:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 17:01:57,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:01:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-28 17:01:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:01:57,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:57,661 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:57,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2019-11-28 17:01:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:57,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826803396] [2019-11-28 17:01:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:01:57,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826803396] [2019-11-28 17:01:57,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:01:57,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:01:57,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211206125] [2019-11-28 17:01:57,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:01:57,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:01:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:01:57,735 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2019-11-28 17:01:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:57,809 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-28 17:01:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:01:57,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 17:01:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:57,810 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:01:57,810 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 17:01:57,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:01:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 17:01:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-11-28 17:01:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 17:01:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-28 17:01:57,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-11-28 17:01:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:57,818 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 17:01:57,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:01:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-28 17:01:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 17:01:57,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:57,819 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:57,819 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2019-11-28 17:01:57,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:57,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323597469] [2019-11-28 17:01:57,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:01:57,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323597469] [2019-11-28 17:01:57,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:01:57,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:01:57,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17213975] [2019-11-28 17:01:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:01:57,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:01:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:01:57,881 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2019-11-28 17:01:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:57,905 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-28 17:01:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:01:57,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 17:01:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:57,908 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:01:57,908 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 17:01:57,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:01:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 17:01:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 17:01:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 17:01:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-28 17:01:57,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-11-28 17:01:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:57,920 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-28 17:01:57,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:01:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-28 17:01:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 17:01:57,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:57,921 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:57,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2019-11-28 17:01:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:57,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954743136] [2019-11-28 17:01:57,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:01:58,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954743136] [2019-11-28 17:01:58,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662298533] [2019-11-28 17:01:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:01:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:58,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 17:01:58,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:01:58,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:01:58,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-28 17:01:58,553 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 19 treesize of output 18 [2019-11-28 17:01:58,554 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:01:58,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:58,569 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:01:58,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:58,583 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:01:58,583 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2019-11-28 17:01:58,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:58,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-28 17:01:58,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:01:58,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:58,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:01:58,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-28 17:01:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:01:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:01:58,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 17:01:58,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735145712] [2019-11-28 17:01:58,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:01:58,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:01:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:01:58,649 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2019-11-28 17:01:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:58,991 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-11-28 17:01:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:01:58,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 17:01:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:58,993 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:01:58,993 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 17:01:58,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:01:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 17:01:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-28 17:01:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:01:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-28 17:01:59,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2019-11-28 17:01:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:59,005 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-28 17:01:59,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:01:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-11-28 17:01:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:01:59,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:59,007 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:59,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:01:59,212 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2019-11-28 17:01:59,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:59,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617143239] [2019-11-28 17:01:59,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:01:59,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617143239] [2019-11-28 17:01:59,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989745701] [2019-11-28 17:01:59,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:01:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:01:59,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 17:01:59,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:01:59,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-28 17:01:59,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:01:59,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:59,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:01:59,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-28 17:01:59,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:01:59,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:01:59,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:59,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:01:59,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:01:59,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:01:59,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:01:59,486 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-28 17:01:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:01:59,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:01:59,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 17:01:59,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320979190] [2019-11-28 17:01:59,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:01:59,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:01:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:01:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:01:59,496 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 7 states. [2019-11-28 17:01:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:01:59,685 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-11-28 17:01:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:01:59,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-28 17:01:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:01:59,687 INFO L225 Difference]: With dead ends: 52 [2019-11-28 17:01:59,687 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 17:01:59,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:01:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 17:01:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-28 17:01:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:01:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-28 17:01:59,701 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 23 [2019-11-28 17:01:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:01:59,702 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-28 17:01:59,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:01:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-28 17:01:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:01:59,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:01:59,704 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:01:59,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:01:59,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:01:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:01:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2019-11-28 17:01:59,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:01:59,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416885721] [2019-11-28 17:01:59,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:01:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:00,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416885721] [2019-11-28 17:02:00,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339611384] [2019-11-28 17:02:00,082 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:00,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:02:00,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:00,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 17:02:00,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:00,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:00,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:00,186 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-28 17:02:00,233 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:00,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-28 17:02:00,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 17:02:00,320 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 17:02:00,349 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:00,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 17:02:00,369 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:02:00,389 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:00,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:00,394 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-28 17:02:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:00,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:00,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:02:00,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687351669] [2019-11-28 17:02:00,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:02:00,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:00,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:02:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:00,403 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 8 states. [2019-11-28 17:02:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:00,589 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-28 17:02:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:02:00,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 17:02:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:00,591 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:02:00,591 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 17:02:00,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:02:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 17:02:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 17:02:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 17:02:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-28 17:02:00,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 24 [2019-11-28 17:02:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:00,598 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-28 17:02:00,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:02:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2019-11-28 17:02:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:02:00,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:00,600 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:00,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:00,804 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2019-11-28 17:02:00,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:00,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825822327] [2019-11-28 17:02:00,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:01,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825822327] [2019-11-28 17:02:01,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359938120] [2019-11-28 17:02:01,164 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:01,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:02:01,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:01,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 17:02:01,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:01,271 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-28 17:02:01,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 17:02:01,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,289 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-28 17:02:01,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:01,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,305 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:8 [2019-11-28 17:02:01,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:01,395 INFO L430 ElimStorePlain]: Different costs {1=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.base_17|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_16|]} [2019-11-28 17:02:01,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2019-11-28 17:02:01,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,415 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 27 treesize of output 22 [2019-11-28 17:02:01,416 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,421 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-11-28 17:02:01,448 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,462 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:01,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-28 17:02:01,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:01,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-28 17:02:01,484 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,486 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:01,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:01,494 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2019-11-28 17:02:01,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-28 17:02:01,552 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-28 17:02:01,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-28 17:02:01,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:01,557 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-28 17:02:01,561 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2d84af3a [2019-11-28 17:02:01,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:02:01,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-28 17:02:01,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439342186] [2019-11-28 17:02:01,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:02:01,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:02:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:02:01,563 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 11 states. [2019-11-28 17:02:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:02:01,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:01,765 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2d84af3a at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-28 17:02:01,771 INFO L168 Benchmark]: Toolchain (without parser) took 5815.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:01,771 INFO L168 Benchmark]: CDTParser took 0.87 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-28 17:02:01,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:01,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.70 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:01,773 INFO L168 Benchmark]: Boogie Preprocessor took 29.03 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-28 17:02:01,773 INFO L168 Benchmark]: RCFGBuilder took 414.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:01,774 INFO L168 Benchmark]: TraceAbstraction took 4728.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.6 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:01,777 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.87 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 589.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.70 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.03 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 414.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4728.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.6 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2d84af3a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2d84af3a: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 17:02:03,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:02:03,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:02:03,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:02:03,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:02:03,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:02:03,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:02:03,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:02:03,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:02:03,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:02:03,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:02:03,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:02:03,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:02:03,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:02:03,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:02:03,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:02:03,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:02:03,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:02:03,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:02:03,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:02:03,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:02:03,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:02:03,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:02:03,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:02:03,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:02:03,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:02:03,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:02:03,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:02:03,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:02:03,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:02:03,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:02:03,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:02:03,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:02:03,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:02:03,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:02:03,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:02:03,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:02:03,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:02:03,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:02:03,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:02:03,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:02:03,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 17:02:03,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:02:03,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:02:03,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:02:03,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:02:03,709 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:02:03,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:02:03,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:02:03,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:02:03,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:02:03,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:02:03,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:02:03,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:02:03,711 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 17:02:03,712 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 17:02:03,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:02:03,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:02:03,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:02:03,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:02:03,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:02:03,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:02:03,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:02:03,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:02:03,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:02:03,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:02:03,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:02:03,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:02:03,715 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 17:02:03,716 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 17:02:03,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:02:03,716 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:02:03,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 17:02:03,717 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 ! call(__VERIFIER_error())) ) 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 -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-28 17:02:04,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:02:04,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:02:04,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:02:04,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:02:04,053 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:02:04,054 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2019-11-28 17:02:04,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e771f486b/3b286da22d2a4ec591306cd2215030cc/FLAG5204d6c5d [2019-11-28 17:02:04,574 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:02:04,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2019-11-28 17:02:04,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e771f486b/3b286da22d2a4ec591306cd2215030cc/FLAG5204d6c5d [2019-11-28 17:02:04,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e771f486b/3b286da22d2a4ec591306cd2215030cc [2019-11-28 17:02:04,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:02:04,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:02:04,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:04,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:02:04,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:02:04,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:04" (1/1) ... [2019-11-28 17:02:04,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29271dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:04, skipping insertion in model container [2019-11-28 17:02:04,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:04" (1/1) ... [2019-11-28 17:02:04,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:02:04,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:02:05,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:05,457 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:02:05,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:05,580 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:02:05,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05 WrapperNode [2019-11-28 17:02:05,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:05,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:05,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:02:05,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:02:05,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:05,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:02:05,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:02:05,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:02:05,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (1/1) ... [2019-11-28 17:02:05,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:02:05,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:02:05,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:02:05,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:02:05,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02: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-28 17:02:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 17:02:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:02:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:02:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:02:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 17:02:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:02:05,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:02:06,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:02:06,132 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 17:02:06,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:06 BoogieIcfgContainer [2019-11-28 17:02:06,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:02:06,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:02:06,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:02:06,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:02:06,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:02:04" (1/3) ... [2019-11-28 17:02:06,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6844ee5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:06, skipping insertion in model container [2019-11-28 17:02:06,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:05" (2/3) ... [2019-11-28 17:02:06,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6844ee5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:06, skipping insertion in model container [2019-11-28 17:02:06,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:06" (3/3) ... [2019-11-28 17:02:06,142 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-28 17:02:06,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:02:06,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:02:06,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:02:06,205 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:02:06,205 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:02:06,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:02:06,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:02:06,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:02:06,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:02:06,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:02:06,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:02:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 17:02:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:02:06,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:06,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:06,230 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1597928625, now seen corresponding path program 1 times [2019-11-28 17:02:06,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:06,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076392763] [2019-11-28 17:02:06,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:06,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 17:02:06,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:06,358 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-28 17:02:06,358 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:06,362 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-28 17:02:06,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076392763] [2019-11-28 17:02:06,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:06,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 17:02:06,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147727564] [2019-11-28 17:02:06,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:02:06,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:02:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:02:06,388 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-28 17:02:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:06,408 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2019-11-28 17:02:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:02:06,409 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 17:02:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:06,420 INFO L225 Difference]: With dead ends: 33 [2019-11-28 17:02:06,421 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 17:02:06,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:02:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 17:02:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 17:02:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 17:02:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 17:02:06,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2019-11-28 17:02:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:06,461 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 17:02:06,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:02:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-11-28 17:02:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:02:06,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:06,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:06,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 17:02:06,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:06,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1565257307, now seen corresponding path program 1 times [2019-11-28 17:02:06,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:06,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136426567] [2019-11-28 17:02:06,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:06,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:02:06,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:06,801 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-28 17:02:06,804 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02: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-28 17:02:06,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136426567] [2019-11-28 17:02:06,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:06,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 17:02:06,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563492606] [2019-11-28 17:02:06,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:02:06,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:02:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:02:06,828 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 4 states. [2019-11-28 17:02:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:07,058 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-28 17:02:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:02:07,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 17:02:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:07,060 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:02:07,060 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 17:02:07,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:02:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 17:02:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 17:02:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 17:02:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-28 17:02:07,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-11-28 17:02:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:07,074 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 17:02:07,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:02:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-11-28 17:02:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:02:07,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:07,079 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:07,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 17:02:07,287 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2088599158, now seen corresponding path program 1 times [2019-11-28 17:02:07,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:07,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701217434] [2019-11-28 17:02:07,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:07,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:02:07,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:07,382 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:07,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701217434] [2019-11-28 17:02:07,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:07,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 17:02:07,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733767676] [2019-11-28 17:02:07,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:02:07,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:02:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:02:07,390 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 4 states. [2019-11-28 17:02:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:07,545 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2019-11-28 17:02:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:02:07,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 17:02:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:07,547 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:02:07,548 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:02:07,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:02:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:02:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-28 17:02:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:02:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 17:02:07,555 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-28 17:02:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:07,555 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 17:02:07,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:02:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-28 17:02:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:02:07,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:07,557 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:07,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 17:02:07,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1311378947, now seen corresponding path program 1 times [2019-11-28 17:02:07,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:07,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904135685] [2019-11-28 17:02:07,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:07,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 17:02:07,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:02:07,851 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:02:07,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904135685] [2019-11-28 17:02:07,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:07,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 17:02:07,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619809916] [2019-11-28 17:02:07,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:02:07,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:02:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:02:07,856 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-28 17:02:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:07,888 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-11-28 17:02:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:02:07,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 17:02:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:07,892 INFO L225 Difference]: With dead ends: 35 [2019-11-28 17:02:07,892 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 17:02:07,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-28 17:02:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 17:02:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 17:02:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 17:02:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-28 17:02:07,899 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2019-11-28 17:02:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:07,899 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 17:02:07,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:02:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-28 17:02:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:02:07,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:07,901 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:08,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 17:02:08,112 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash 502032321, now seen corresponding path program 1 times [2019-11-28 17:02:08,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:08,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008530077] [2019-11-28 17:02:08,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:08,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 17:02:08,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:08,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-11-28 17:02:08,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:08,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-11-28 17:02:08,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-11-28 17:02:08,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:08,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-28 17:02:08,566 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:08,582 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,617 INFO L614 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-11-28 17:02:08,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,620 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:30 [2019-11-28 17:02:08,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:08,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2019-11-28 17:02:08,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:08,728 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:08,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-11-28 17:02:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:08,774 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:09,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:09,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:02:09,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008530077] [2019-11-28 17:02:09,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:09,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 17:02:09,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452138741] [2019-11-28 17:02:09,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 17:02:09,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 17:02:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:02:09,391 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 15 states. [2019-11-28 17:02:10,365 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-28 17:02:11,010 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 17:02:11,231 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-11-28 17:02:11,449 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-11-28 17:02:11,931 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:02:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:12,324 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-28 17:02:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:02:12,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-28 17:02:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:12,330 INFO L225 Difference]: With dead ends: 49 [2019-11-28 17:02:12,330 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:02:12,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:02:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:02:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-11-28 17:02:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:02:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-28 17:02:12,340 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2019-11-28 17:02:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:12,340 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-28 17:02:12,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 17:02:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-11-28 17:02:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:02:12,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:12,341 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:12,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 17:02:12,554 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 972646004, now seen corresponding path program 1 times [2019-11-28 17:02:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:12,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984167309] [2019-11-28 17:02:12,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:12,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:02:12,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:12,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:02:12,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:12,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:12,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:02:12,730 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:12,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:12,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:12,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-28 17:02:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:02:12,752 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:12,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:12,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-28 17:02:12,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:12,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:12,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 19 [2019-11-28 17:02:12,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:12,822 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 17:02:12,851 INFO L614 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-11-28 17:02:12,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-28 17:02:12,856 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:12,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:12,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 17:02:12,864 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:7 [2019-11-28 17:02:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:02:12,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984167309] [2019-11-28 17:02:12,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:12,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 17:02:12,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448477589] [2019-11-28 17:02:12,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:02:12,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:02:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:12,870 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 8 states. [2019-11-28 17:02:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:13,388 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-11-28 17:02:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:02:13,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 17:02:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:13,393 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:02:13,393 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:02:13,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:02:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:02:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-11-28 17:02:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:02:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-28 17:02:13,416 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2019-11-28 17:02:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:13,417 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-28 17:02:13,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:02:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2019-11-28 17:02:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:02:13,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:13,419 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:13,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 17:02:13,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash 803189644, now seen corresponding path program 2 times [2019-11-28 17:02:13,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:13,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341871796] [2019-11-28 17:02:13,637 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:13,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:02:13,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:13,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:02:13,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:13,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:13,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:13,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:13,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:13,838 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:13,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:13,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:13,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-28 17:02:13,890 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:13,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:13,984 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,056 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-28 17:02:14,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:14,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:14,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:14,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:14,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:14,114 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,116 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,147 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-28 17:02:14,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 126 [2019-11-28 17:02:14,177 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-28 17:02:14,205 INFO L614 ElimStorePlain]: treesize reduction 119, result has 2.5 percent of original size [2019-11-28 17:02:14,205 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,210 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-28 17:02:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:14,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:14,247 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,252 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,381 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-28 17:02:14,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,393 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,399 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,456 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,462 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,493 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:14,506 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:14,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:14,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-28 17:02:14,531 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:177, output treesize:35 [2019-11-28 17:02:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:14,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341871796] [2019-11-28 17:02:14,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:14,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 17:02:14,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213317380] [2019-11-28 17:02:14,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:02:14,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:02:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:02:14,548 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand 6 states. [2019-11-28 17:02:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:15,003 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-11-28 17:02:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:02:15,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:02:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:15,004 INFO L225 Difference]: With dead ends: 64 [2019-11-28 17:02:15,004 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 17:02:15,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:02:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 17:02:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 17:02:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 17:02:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-11-28 17:02:15,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2019-11-28 17:02:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:15,013 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-11-28 17:02:15,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:02:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2019-11-28 17:02:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:02:15,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:15,015 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:15,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 17:02:15,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash 349213841, now seen corresponding path program 3 times [2019-11-28 17:02:15,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:15,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782205291] [2019-11-28 17:02:15,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 17:02:15,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:02:15,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:15,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 17:02:15,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:15,435 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-28 17:02:15,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 17:02:15,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,468 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 13 treesize of output 17 [2019-11-28 17:02:15,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:15,527 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-11-28 17:02:15,572 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,592 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,593 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:56, output treesize:31 [2019-11-28 17:02:15,787 INFO L430 ElimStorePlain]: Different costs {1=[|v_#memory_int_20|], 2=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|]} [2019-11-28 17:02:15,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-11-28 17:02:15,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:15,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-28 17:02:15,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:15,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:15,850 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:16,008 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-28 17:02:16,009 INFO L614 ElimStorePlain]: treesize reduction 10, result has 88.9 percent of original size [2019-11-28 17:02:16,014 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:16,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:16,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:16,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-11-28 17:02:16,060 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:16,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:16,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-28 17:02:16,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:16,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:16,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-28 17:02:16,105 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:16,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:16,109 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:16,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:16,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:16,126 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:119, output treesize:34 [2019-11-28 17:02:16,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-28 17:02:16,248 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-28 17:02:16,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-28 17:02:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:16,256 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-28 17:02:16,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782205291] [2019-11-28 17:02:16,263 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57f5d9e2 [2019-11-28 17:02:16,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1258069812] [2019-11-28 17:02:16,263 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-28 17:02:16,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:02:16,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:16,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 17:02:16,568 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57f5d9e2 [2019-11-28 17:02:16,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141167988] [2019-11-28 17:02:16,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:16,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:02:16,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:16,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 17:02:16,996 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@57f5d9e2 [2019-11-28 17:02:16,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:16,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-11-28 17:02:16,999 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-11-28 17:02:16,999 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:02:17,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:17,649 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-11-28 17:02:17,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:02:17 BoogieIcfgContainer [2019-11-28 17:02:17,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:02:17,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:02:17,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:02:17,651 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:02:17,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:06" (3/4) ... [2019-11-28 17:02:17,655 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 17:02:17,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:02:17,657 INFO L168 Benchmark]: Toolchain (without parser) took 12775.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 960.4 MB in the beginning and 971.0 MB in the end (delta: -10.7 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:17,657 INFO L168 Benchmark]: CDTParser took 0.28 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-28 17:02:17,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:17,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.31 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-28 17:02:17,658 INFO L168 Benchmark]: Boogie Preprocessor took 35.72 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-28 17:02:17,659 INFO L168 Benchmark]: RCFGBuilder took 458.09 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:17,659 INFO L168 Benchmark]: TraceAbstraction took 11515.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:17,659 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.2 GB. Free memory is still 971.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:17,662 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.28 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 699.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.72 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 458.09 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11515.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.2 GB. Free memory is still 971.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 585]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L563] Node *l = ((void *)0); [L564] COND TRUE __VERIFIER_nondet_int() [L565] int stock = __VERIFIER_nondet_int(); [L566] COND FALSE !(stock < 0) [L568] Node *p = malloc(sizeof(*p)); [L569] p->stock = stock [L570] p->order = 0 [L571] p->next=l [L571] l=p [L564] COND TRUE __VERIFIER_nondet_int() [L565] int stock = __VERIFIER_nondet_int(); [L566] COND FALSE !(stock < 0) [L568] Node *p = malloc(sizeof(*p)); [L569] p->stock = stock [L570] p->order = 0 [L571] p->next=l [L571] l=p [L564] COND FALSE !(__VERIFIER_nondet_int()) [L573] Node *i = l; [L574] COND TRUE i != ((void *)0) [L575] int order = __VERIFIER_nondet_int(); [L576] order < 0 || i->stock < order [L576] EXPR i->stock [L576] order < 0 || i->stock < order [L576] COND FALSE !(order < 0 || i->stock < order) [L578] i->order = order [L579] EXPR i->stock [L579] i->stock = i->stock [L580] EXPR i->next [L580] i = i->next [L574] COND TRUE i != ((void *)0) [L575] int order = __VERIFIER_nondet_int(); [L576] order < 0 || i->stock < order [L576] EXPR i->stock [L576] order < 0 || i->stock < order [L576] COND FALSE !(order < 0 || i->stock < order) [L578] i->order = order [L579] EXPR i->stock [L579] i->stock = i->stock [L580] EXPR i->next [L580] i = i->next [L574] COND FALSE !(i != ((void *)0)) [L582] i = l [L583] COND TRUE i != ((void *)0) [L584] EXPR i->order [L584] EXPR i->stock [L584] COND TRUE i->order > i->stock [L585] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Result: UNKNOWN, OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 128 SDslu, 315 SDs, 0 SdLazy, 292 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 212 ConstructedInterpolants, 2 QuantifiedInterpolants, 27202 SizeOfPredicates, 34 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 34/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...