./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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-manipulation/merge_sort-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 534681b11e8e68e6058985d885b01f2cbfa43e5b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-27 23:52:07,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:52:07,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:52:07,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:52:07,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:52:07,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:52:07,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:52:07,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:52:07,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:52:07,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:52:07,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:52:07,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:52:07,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:52:07,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:52:07,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:52:07,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:52:07,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:52:07,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:52:07,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:52:07,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:52:07,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:52:07,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:52:07,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:52:07,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:52:07,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:52:07,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:52:07,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:52:07,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:52:07,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:52:07,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:52:07,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:52:07,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:52:07,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:52:07,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:52:07,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:52:07,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:52:07,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:52:07,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:52:07,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:52:07,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:52:07,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:52:07,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:52:07,774 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:52:07,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:52:07,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:52:07,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:52:07,783 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:52:07,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:52:07,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:52:07,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:52:07,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:52:07,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:52:07,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:52:07,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:52:07,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:52:07,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:52:07,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:52:07,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:52:07,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:52:07,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:52:07,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:52:07,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:52:07,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:52:07,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:52:07,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:52:07,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:52:07,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:52:07,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:52:07,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:52:07,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:52:07,791 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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-27 23:52:08,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:52:08,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:52:08,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:52:08,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:52:08,115 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:52:08,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-27 23:52:08,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f62a57/e12edac078e743c388a590084b8af504/FLAG433b74206 [2019-11-27 23:52:08,789 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:52:08,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-27 23:52:08,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f62a57/e12edac078e743c388a590084b8af504/FLAG433b74206 [2019-11-27 23:52:09,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f62a57/e12edac078e743c388a590084b8af504 [2019-11-27 23:52:09,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:52:09,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:52:09,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:09,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:52:09,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:52:09,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551f8d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09, skipping insertion in model container [2019-11-27 23:52:09,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:52:09,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:52:09,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:09,500 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:52:09,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:09,679 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:52:09,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09 WrapperNode [2019-11-27 23:52:09,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:09,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:09,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:52:09,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:52:09,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:09,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:52:09,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:52:09,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:52:09,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (1/1) ... [2019-11-27 23:52:09,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:52:09,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:52:09,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:52:09,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:52:09,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (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-27 23:52:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:52:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:52:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:52:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:52:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:52:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:52:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:52:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:52:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:52:10,572 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:52:10,573 INFO L297 CfgBuilder]: Removed 75 assume(true) statements. [2019-11-27 23:52:10,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:10 BoogieIcfgContainer [2019-11-27 23:52:10,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:52:10,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:52:10,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:52:10,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:52:10,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:52:09" (1/3) ... [2019-11-27 23:52:10,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53326b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:10, skipping insertion in model container [2019-11-27 23:52:10,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:09" (2/3) ... [2019-11-27 23:52:10,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53326b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:10, skipping insertion in model container [2019-11-27 23:52:10,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:10" (3/3) ... [2019-11-27 23:52:10,585 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-27 23:52:10,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:52:10,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-27 23:52:10,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-27 23:52:10,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:52:10,657 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:52:10,657 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:52:10,657 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:52:10,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:52:10,658 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:52:10,658 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:52:10,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:52:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-27 23:52:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 23:52:10,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:10,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 23:52:10,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 890218827, now seen corresponding path program 1 times [2019-11-27 23:52:10,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:10,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936915983] [2019-11-27 23:52:10,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:10,850 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-27 23:52:10,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936915983] [2019-11-27 23:52:10,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:10,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:52:10,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33662535] [2019-11-27 23:52:10,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:52:10,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:52:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:52:10,877 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2019-11-27 23:52:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:10,909 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2019-11-27 23:52:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:52:10,911 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-27 23:52:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:10,923 INFO L225 Difference]: With dead ends: 196 [2019-11-27 23:52:10,923 INFO L226 Difference]: Without dead ends: 92 [2019-11-27 23:52:10,927 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-27 23:52:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-27 23:52:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-27 23:52:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-27 23:52:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-11-27 23:52:10,973 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2019-11-27 23:52:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:10,973 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-11-27 23:52:10,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:52:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-11-27 23:52:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-27 23:52:10,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:10,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:10,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865150, now seen corresponding path program 1 times [2019-11-27 23:52:10,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:10,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476594678] [2019-11-27 23:52:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:11,030 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-27 23:52:11,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476594678] [2019-11-27 23:52:11,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:11,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:52:11,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795612042] [2019-11-27 23:52:11,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:52:11,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:52:11,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:52:11,035 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 3 states. [2019-11-27 23:52:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:11,080 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2019-11-27 23:52:11,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:52:11,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-27 23:52:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:11,084 INFO L225 Difference]: With dead ends: 182 [2019-11-27 23:52:11,085 INFO L226 Difference]: Without dead ends: 98 [2019-11-27 23:52:11,087 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-27 23:52:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-27 23:52:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-11-27 23:52:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-27 23:52:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-27 23:52:11,110 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2019-11-27 23:52:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:11,111 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-27 23:52:11,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:52:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-27 23:52:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:52:11,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:11,118 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:11,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 663763925, now seen corresponding path program 1 times [2019-11-27 23:52:11,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:11,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704178259] [2019-11-27 23:52:11,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:11,247 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-27 23:52:11,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704178259] [2019-11-27 23:52:11,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:11,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:11,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758459472] [2019-11-27 23:52:11,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:11,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:11,250 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 5 states. [2019-11-27 23:52:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:11,468 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2019-11-27 23:52:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:52:11,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-27 23:52:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:11,474 INFO L225 Difference]: With dead ends: 253 [2019-11-27 23:52:11,477 INFO L226 Difference]: Without dead ends: 247 [2019-11-27 23:52:11,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:52:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-27 23:52:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 96. [2019-11-27 23:52:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 23:52:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-11-27 23:52:11,511 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2019-11-27 23:52:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:11,514 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-11-27 23:52:11,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-11-27 23:52:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:52:11,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:11,516 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:11,517 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2036062252, now seen corresponding path program 1 times [2019-11-27 23:52:11,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:11,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201039759] [2019-11-27 23:52:11,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:52:11,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201039759] [2019-11-27 23:52:11,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:11,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:11,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055881243] [2019-11-27 23:52:11,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:11,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:11,665 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states. [2019-11-27 23:52:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:11,920 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-27 23:52:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:52:11,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-27 23:52:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:11,923 INFO L225 Difference]: With dead ends: 125 [2019-11-27 23:52:11,923 INFO L226 Difference]: Without dead ends: 123 [2019-11-27 23:52:11,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:52:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-27 23:52:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-11-27 23:52:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-27 23:52:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-27 23:52:11,936 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2019-11-27 23:52:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:11,936 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-27 23:52:11,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-27 23:52:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:52:11,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:11,937 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:11,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2014113239, now seen corresponding path program 1 times [2019-11-27 23:52:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885279006] [2019-11-27 23:52:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:52:12,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885279006] [2019-11-27 23:52:12,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:12,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:12,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113924485] [2019-11-27 23:52:12,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:12,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:12,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:12,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:12,024 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 5 states. [2019-11-27 23:52:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:12,225 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-27 23:52:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:52:12,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-27 23:52:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:12,227 INFO L225 Difference]: With dead ends: 94 [2019-11-27 23:52:12,227 INFO L226 Difference]: Without dead ends: 92 [2019-11-27 23:52:12,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:52:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-27 23:52:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-27 23:52:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-27 23:52:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-27 23:52:12,236 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 20 [2019-11-27 23:52:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-27 23:52:12,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-27 23:52:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:52:12,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:12,238 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:12,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1486605840, now seen corresponding path program 1 times [2019-11-27 23:52:12,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:12,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566323079] [2019-11-27 23:52:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:12,404 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-27 23:52:12,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566323079] [2019-11-27 23:52:12,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:12,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:52:12,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976006388] [2019-11-27 23:52:12,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:52:12,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:52:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:52:12,409 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2019-11-27 23:52:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:12,755 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2019-11-27 23:52:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:52:12,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-27 23:52:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:12,757 INFO L225 Difference]: With dead ends: 210 [2019-11-27 23:52:12,757 INFO L226 Difference]: Without dead ends: 208 [2019-11-27 23:52:12,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:52:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-27 23:52:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 98. [2019-11-27 23:52:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-27 23:52:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-27 23:52:12,767 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 23 [2019-11-27 23:52:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:12,768 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-27 23:52:12,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:52:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-27 23:52:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:52:12,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:12,769 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:12,769 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1760261746, now seen corresponding path program 1 times [2019-11-27 23:52:12,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:12,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520099595] [2019-11-27 23:52:12,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:12,827 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-27 23:52:12,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520099595] [2019-11-27 23:52:12,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:12,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:52:12,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011062903] [2019-11-27 23:52:12,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:52:12,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:52:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:52:12,829 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 6 states. [2019-11-27 23:52:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:13,183 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2019-11-27 23:52:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:52:13,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-27 23:52:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:13,186 INFO L225 Difference]: With dead ends: 208 [2019-11-27 23:52:13,186 INFO L226 Difference]: Without dead ends: 206 [2019-11-27 23:52:13,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:52:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-27 23:52:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2019-11-27 23:52:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-27 23:52:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-11-27 23:52:13,210 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 23 [2019-11-27 23:52:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-11-27 23:52:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:52:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-11-27 23:52:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:52:13,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:13,212 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:13,213 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:13,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:13,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2060804288, now seen corresponding path program 1 times [2019-11-27 23:52:13,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:13,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120499640] [2019-11-27 23:52:13,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:13,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:52:13,313 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:52:13,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:52:13 BoogieIcfgContainer [2019-11-27 23:52:13,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:52:13,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:52:13,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:52:13,361 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:52:13,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:10" (3/4) ... [2019-11-27 23:52:13,364 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:52:13,420 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:52:13,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:52:13,422 INFO L168 Benchmark]: Toolchain (without parser) took 4381.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 955.0 MB in the beginning and 860.0 MB in the end (delta: 95.0 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,423 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:13,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,425 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,426 INFO L168 Benchmark]: RCFGBuilder took 761.67 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,427 INFO L168 Benchmark]: TraceAbstraction took 2784.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.0 MB in the end (delta: 199.1 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:13,427 INFO L168 Benchmark]: Witness Printer took 58.76 ms. Allocated memory is still 1.2 GB. Free memory is still 860.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:13,431 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.84 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 761.67 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2784.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.0 MB in the end (delta: 199.1 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. * Witness Printer took 58.76 ms. Allocated memory is still 1.2 GB. Free memory is still 860.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] item->slist = node [L638] item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L604] COND FALSE !(!(shape)) [L605] shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L612] EXPR shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 13 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 606 SDtfs, 1418 SDslu, 979 SDs, 0 SdLazy, 502 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 396 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 9999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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 proved your program to be incorrect! Received shutdown request...