./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/list-ext2-properties/simple_and_skiplist_2lvl-1.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 6a10fd260c2f708e346588150444ddfe9656de05 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:03:18,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:03:18,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:03:18,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:03:18,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:03:18,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:03:18,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:03:18,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:03:18,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:03:18,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:03:18,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:03:18,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:03:18,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:03:18,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:03:18,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:03:18,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:03:18,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:03:18,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:03:18,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:03:18,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:03:18,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:03:18,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:03:18,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:03:18,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:03:18,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:03:18,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:03:18,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:03:18,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:03:18,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:03:18,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:03:18,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:03:18,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:03:18,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:03:18,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:03:18,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:03:18,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:03:18,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:03:18,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:03:18,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:03:18,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:03:18,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:03:18,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:03:18,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:03:18,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:03:18,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:03:18,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:03:18,629 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:03:18,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:03:18,630 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:03:18,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:03:18,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:03:18,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:03:18,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:03:18,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:03:18,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:03:18,633 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:03:18,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:03:18,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:03:18,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:03:18,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:03:18,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:03:18,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:03:18,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:03:18,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:03:18,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:03:18,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:03:18,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:03:18,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:03:18,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:03:18,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:03:18,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:03:18,638 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 -> 6a10fd260c2f708e346588150444ddfe9656de05 [2020-07-28 18:03:18,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:03:18,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:03:18,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:03:18,964 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:03:18,965 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:03:18,966 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2020-07-28 18:03:19,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decaf6be7/e635af8c34364b059f6a54ec93436f0f/FLAGd9643b25b [2020-07-28 18:03:19,510 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:03:19,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2020-07-28 18:03:19,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decaf6be7/e635af8c34364b059f6a54ec93436f0f/FLAGd9643b25b [2020-07-28 18:03:19,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decaf6be7/e635af8c34364b059f6a54ec93436f0f [2020-07-28 18:03:19,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:03:19,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:03:19,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:03:19,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:03:19,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:03:19,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:03:19" (1/1) ... [2020-07-28 18:03:19,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b822c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:19, skipping insertion in model container [2020-07-28 18:03:19,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:03:19" (1/1) ... [2020-07-28 18:03:19,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:03:19,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:03:20,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:03:20,399 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:03:20,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:03:20,518 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:03:20,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20 WrapperNode [2020-07-28 18:03:20,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:03:20,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:03:20,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:03:20,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:03:20,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:03:20,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:03:20,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:03:20,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:03:20,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (1/1) ... [2020-07-28 18:03:20,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:03:20,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:03:20,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:03:20,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:03:20,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (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 [2020-07-28 18:03:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:03:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:03:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 18:03:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 18:03:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 18:03:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:03:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:03:20,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:03:21,510 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:03:21,510 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-07-28 18:03:21,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:21 BoogieIcfgContainer [2020-07-28 18:03:21,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:03:21,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:03:21,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:03:21,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:03:21,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:03:19" (1/3) ... [2020-07-28 18:03:21,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729e58b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:03:21, skipping insertion in model container [2020-07-28 18:03:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:20" (2/3) ... [2020-07-28 18:03:21,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729e58b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:03:21, skipping insertion in model container [2020-07-28 18:03:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:21" (3/3) ... [2020-07-28 18:03:21,526 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-1.i [2020-07-28 18:03:21,537 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:03:21,545 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:03:21,560 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:03:21,583 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:03:21,583 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:03:21,584 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:03:21,584 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:03:21,584 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:03:21,585 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:03:21,585 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:03:21,585 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:03:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-28 18:03:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:03:21,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:21,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:21,610 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2114193284, now seen corresponding path program 1 times [2020-07-28 18:03:21,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:21,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289730819] [2020-07-28 18:03:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:21,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {40#true} is VALID [2020-07-28 18:03:21,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} havoc main_#res;havoc main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem34, main_#t~mem35.base, main_#t~mem35.offset, main_#t~ret36.base, main_#t~ret36.offset, main_#t~nondet37, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~sl~1.base, main_~sl~1.offset;call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; {40#true} is VALID [2020-07-28 18:03:21,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {40#true} is VALID [2020-07-28 18:03:21,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {40#true} havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;call write~int(2, main_~a~0.base, main_~a~0.offset, 4); {40#true} is VALID [2020-07-28 18:03:21,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-28 18:03:21,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#false} call write~int(2, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {41#false} is VALID [2020-07-28 18:03:21,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#false} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {41#false} is VALID [2020-07-28 18:03:21,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#false} assume 2 != main_#t~mem34;havoc main_#t~mem34; {41#false} is VALID [2020-07-28 18:03:21,797 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-28 18:03:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:21,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289730819] [2020-07-28 18:03:21,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:03:21,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:03:21,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694451724] [2020-07-28 18:03:21,812 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 18:03:21,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:21,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:03:21,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:03:21,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:03:21,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:03:21,853 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-28 18:03:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:21,970 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2020-07-28 18:03:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:03:21,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 18:03:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:03:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2020-07-28 18:03:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:03:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2020-07-28 18:03:21,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2020-07-28 18:03:22,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:22,228 INFO L225 Difference]: With dead ends: 64 [2020-07-28 18:03:22,229 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 18:03:22,235 INFO L675 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 [2020-07-28 18:03:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 18:03:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 18:03:22,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:22,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 18:03:22,268 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:03:22,268 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:03:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:22,271 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 18:03:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 18:03:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:22,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:22,272 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:03:22,273 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:03:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:22,274 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 18:03:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 18:03:22,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:22,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:22,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:22,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:03:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-28 18:03:22,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2020-07-28 18:03:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:22,280 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-28 18:03:22,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:03:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 18:03:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:03:22,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:22,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:22,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:03:22,282 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash 672844787, now seen corresponding path program 1 times [2020-07-28 18:03:22,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:22,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999669487] [2020-07-28 18:03:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:22,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {169#true} is VALID [2020-07-28 18:03:22,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem34, main_#t~mem35.base, main_#t~mem35.offset, main_#t~ret36.base, main_#t~ret36.offset, main_#t~nondet37, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~sl~1.base, main_~sl~1.offset;call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; {169#true} is VALID [2020-07-28 18:03:22,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {169#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {169#true} is VALID [2020-07-28 18:03:22,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {169#true} havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;call write~int(2, main_~a~0.base, main_~a~0.offset, 4); {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet31 && main_#t~nondet31 <= 2147483647; {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet31);havoc main_#t~nondet31; {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {171#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(2, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {172#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 2)} is VALID [2020-07-28 18:03:22,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 2)} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {173#(= 2 |ULTIMATE.start_main_#t~mem34|)} is VALID [2020-07-28 18:03:22,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#(= 2 |ULTIMATE.start_main_#t~mem34|)} assume 2 != main_#t~mem34;havoc main_#t~mem34; {170#false} is VALID [2020-07-28 18:03:22,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2020-07-28 18:03:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:22,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999669487] [2020-07-28 18:03:22,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:03:22,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:03:22,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298852804] [2020-07-28 18:03:22,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 18:03:22,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:22,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:03:22,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:22,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:03:22,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:03:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:03:22,440 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2020-07-28 18:03:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:22,670 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 18:03:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:03:22,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 18:03:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:03:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 18:03:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:03:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 18:03:22,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-28 18:03:22,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:22,728 INFO L225 Difference]: With dead ends: 29 [2020-07-28 18:03:22,728 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 18:03:22,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:03:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 18:03:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2020-07-28 18:03:22,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:22,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 19 states. [2020-07-28 18:03:22,740 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 19 states. [2020-07-28 18:03:22,740 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 19 states. [2020-07-28 18:03:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:22,743 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 18:03:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 18:03:22,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:22,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:22,744 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 27 states. [2020-07-28 18:03:22,745 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 27 states. [2020-07-28 18:03:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:22,747 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 18:03:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 18:03:22,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:22,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:22,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:22,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:03:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 18:03:22,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2020-07-28 18:03:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:22,751 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 18:03:22,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:03:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 18:03:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:03:22,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:22,753 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:22,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:03:22,753 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash 111486456, now seen corresponding path program 1 times [2020-07-28 18:03:22,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:22,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806585990] [2020-07-28 18:03:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:22,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-28 18:03:22,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} havoc main_#res;havoc main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem34, main_#t~mem35.base, main_#t~mem35.offset, main_#t~ret36.base, main_#t~ret36.offset, main_#t~nondet37, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~sl~1.base, main_~sl~1.offset;call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; {293#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 18:03:22,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {293#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {293#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 18:03:22,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {293#(= 0 ULTIMATE.start_main_~a~0.offset)} havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;call write~int(2, main_~a~0.base, main_~a~0.offset, 4); {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,969 INFO L280 TraceCheckUtils]: 4: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet31 && main_#t~nondet31 <= 2147483647; {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,971 INFO L280 TraceCheckUtils]: 5: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet31);havoc main_#t~nondet31; {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(2, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:22,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:22,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} assume !(2 != main_#t~mem34);havoc main_#t~mem34; {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:22,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} call main_#t~mem35.base, main_#t~mem35.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem35.base, main_#t~mem35.offset;havoc main_#t~mem35.base, main_#t~mem35.offset; {296#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:22,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {296#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~p~0.base))} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {292#false} is VALID [2020-07-28 18:03:22,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume 2 != main_#t~mem34;havoc main_#t~mem34; {292#false} is VALID [2020-07-28 18:03:22,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-28 18:03:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:22,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806585990] [2020-07-28 18:03:22,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685163403] [2020-07-28 18:03:22,985 INFO L95 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 [2020-07-28 18:03:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:23,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 18:03:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:23,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:03:23,228 INFO L384 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 [2020-07-28 18:03:23,229 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,241 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:03:23,248 INFO L384 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 [2020-07-28 18:03:23,248 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,257 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:03:23,258 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,258 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-28 18:03:23,332 INFO L384 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 [2020-07-28 18:03:23,334 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,342 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:03:23,347 INFO L384 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 [2020-07-28 18:03:23,348 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,355 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:03:23,356 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 18:03:23,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-28 18:03:23,360 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 18:03:23,360 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_ULTIMATE.start_main_~p~0.base_13, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~p~0.base_13) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| v_ULTIMATE.start_main_~p~0.base_13) 4))) (and (= .cse0 0) (= .cse1 ULTIMATE.start_main_~p~0.offset) (= .cse0 ULTIMATE.start_main_~p~0.base) (= 0 .cse1))) [2020-07-28 18:03:23,361 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~p~0.base)) [2020-07-28 18:03:23,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-28 18:03:23,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} havoc main_#res;havoc main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem34, main_#t~mem35.base, main_#t~mem35.offset, main_#t~ret36.base, main_#t~ret36.offset, main_#t~nondet37, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~sl~1.base, main_~sl~1.offset;call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; {293#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 18:03:23,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {293#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {293#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 18:03:23,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {293#(= 0 ULTIMATE.start_main_~a~0.offset)} havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;call write~int(2, main_~a~0.base, main_~a~0.offset, 4); {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:23,371 INFO L280 TraceCheckUtils]: 4: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet31 && main_#t~nondet31 <= 2147483647; {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:23,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet31);havoc main_#t~nondet31; {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:23,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {294#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(2, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:23,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:23,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} assume !(2 != main_#t~mem34);havoc main_#t~mem34; {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} is VALID [2020-07-28 18:03:23,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {295#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~p~0.base) (+ ULTIMATE.start_main_~p~0.offset 4))))} call main_#t~mem35.base, main_#t~mem35.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem35.base, main_#t~mem35.offset;havoc main_#t~mem35.base, main_#t~mem35.offset; {296#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 18:03:23,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {296#(and (= 0 ULTIMATE.start_main_~p~0.offset) (= 0 ULTIMATE.start_main_~p~0.base))} assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem34 := read~int(main_~p~0.base, main_~p~0.offset, 4); {292#false} is VALID [2020-07-28 18:03:23,383 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume 2 != main_#t~mem34;havoc main_#t~mem34; {292#false} is VALID [2020-07-28 18:03:23,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-28 18:03:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:23,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:03:23,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-28 18:03:23,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077053160] [2020-07-28 18:03:23,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 18:03:23,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:23,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:03:23,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:23,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:03:23,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:23,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:03:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:03:23,417 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2020-07-28 18:03:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:23,624 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-28 18:03:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:03:23,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 18:03:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:03:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-28 18:03:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:03:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-28 18:03:23,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-28 18:03:23,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:23,683 INFO L225 Difference]: With dead ends: 33 [2020-07-28 18:03:23,683 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 18:03:23,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:03:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 18:03:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2020-07-28 18:03:23,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:23,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 16 states. [2020-07-28 18:03:23,695 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 16 states. [2020-07-28 18:03:23,695 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 16 states. [2020-07-28 18:03:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:23,697 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 18:03:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 18:03:23,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:23,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:23,698 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 23 states. [2020-07-28 18:03:23,698 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 23 states. [2020-07-28 18:03:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:23,700 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 18:03:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 18:03:23,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:23,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:23,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:23,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:03:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-07-28 18:03:23,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2020-07-28 18:03:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:23,703 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-28 18:03:23,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:03:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 18:03:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:03:23,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:23,704 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:23,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:03:23,917 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1682540518, now seen corresponding path program 1 times [2020-07-28 18:03:23,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:23,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140353126] [2020-07-28 18:03:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:03:23,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:03:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:03:24,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:03:24,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:03:24,047 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:03:24,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 18:03:24,097 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:03:24,097 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:03:24,098 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-28 18:03:24,098 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-28 18:03:24,098 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 18:03:24,099 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2020-07-28 18:03:24,099 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-28 18:03:24,099 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-28 18:03:24,099 WARN L170 areAnnotationChecker]: L590-4 has no Hoare annotation [2020-07-28 18:03:24,099 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-28 18:03:24,100 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-28 18:03:24,100 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-28 18:03:24,100 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-28 18:03:24,100 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-28 18:03:24,101 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-28 18:03:24,101 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-28 18:03:24,101 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-28 18:03:24,101 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2020-07-28 18:03:24,101 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2020-07-28 18:03:24,102 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-28 18:03:24,102 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-28 18:03:24,102 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2020-07-28 18:03:24,102 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2020-07-28 18:03:24,103 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2020-07-28 18:03:24,103 WARN L170 areAnnotationChecker]: L601-2 has no Hoare annotation [2020-07-28 18:03:24,103 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2020-07-28 18:03:24,103 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2020-07-28 18:03:24,104 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-28 18:03:24,104 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-28 18:03:24,104 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-28 18:03:24,104 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2020-07-28 18:03:24,104 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2020-07-28 18:03:24,105 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-28 18:03:24,105 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-28 18:03:24,105 WARN L170 areAnnotationChecker]: L570-4 has no Hoare annotation [2020-07-28 18:03:24,105 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-28 18:03:24,106 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-28 18:03:24,106 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-28 18:03:24,106 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-28 18:03:24,106 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-28 18:03:24,106 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-28 18:03:24,107 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2020-07-28 18:03:24,107 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2020-07-28 18:03:24,107 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-28 18:03:24,107 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-28 18:03:24,108 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2020-07-28 18:03:24,108 WARN L170 areAnnotationChecker]: L557-6 has no Hoare annotation [2020-07-28 18:03:24,108 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2020-07-28 18:03:24,108 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2020-07-28 18:03:24,109 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:03:24,109 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2020-07-28 18:03:24,109 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2020-07-28 18:03:24,109 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2020-07-28 18:03:24,109 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2020-07-28 18:03:24,110 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:03:24,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:03:24 BoogieIcfgContainer [2020-07-28 18:03:24,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:03:24,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:03:24,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:03:24,115 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:03:24,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:21" (3/4) ... [2020-07-28 18:03:24,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:03:24,191 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:03:24,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:03:24,194 INFO L168 Benchmark]: Toolchain (without parser) took 4314.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.2 MB in the beginning and 829.1 MB in the end (delta: 123.1 MB). Peak memory consumption was 260.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,195 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:03:24,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.98 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. [2020-07-28 18:03:24,197 INFO L168 Benchmark]: Boogie Preprocessor took 44.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,197 INFO L168 Benchmark]: RCFGBuilder took 880.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,198 INFO L168 Benchmark]: TraceAbstraction took 2597.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 835.7 MB in the end (delta: 213.2 MB). Peak memory consumption was 213.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,199 INFO L168 Benchmark]: Witness Printer took 77.81 ms. Allocated memory is still 1.2 GB. Free memory was 835.7 MB in the beginning and 829.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:24,202 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 637.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.98 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 44.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 880.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2597.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 835.7 MB in the end (delta: 213.2 MB). Peak memory consumption was 213.2 MB. Max. memory is 11.5 GB. * Witness Printer took 77.81 ms. Allocated memory is still 1.2 GB. Free memory was 835.7 MB in the beginning and 829.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L585] List a = (List) malloc(sizeof(struct node)); [L586] COND FALSE !(a == 0) [L587] List t; [L588] List p = a; [L589] a->h = 2 [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) [L593] COND FALSE !(t == 0) [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a [L600] COND TRUE p!=0 [L601] EXPR p->h [L601] COND TRUE p->h != 2 [L602] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 SDtfs, 39 SDslu, 47 SDs, 0 SdLazy, 58 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, 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, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 3067 SizeOfPredicates, 7 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...