./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.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-91b1670 [2018-11-28 18:05:42,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:05:42,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:05:42,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:05:42,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:05:42,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:05:42,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:05:42,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:05:42,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:05:42,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:05:42,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:05:42,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:05:42,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:05:42,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:05:42,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:05:42,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:05:42,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:05:42,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:05:42,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:05:42,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:05:42,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:05:42,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:05:42,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:05:42,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:05:42,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:05:42,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:05:42,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:05:42,527 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:05:42,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:05:42,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:05:42,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:05:42,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:05:42,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:05:42,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:05:42,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:05:42,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:05:42,534 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:05:42,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:05:42,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:05:42,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:05:42,552 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:05:42,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:05:42,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:05:42,553 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:05:42,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:05:42,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:05:42,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:05:42,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:05:42,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:05:42,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:05:42,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:05:42,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:05:42,557 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:05:42,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:05:42,557 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:05:42,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:05:42,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:05:42,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:05:42,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:05:42,560 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:05:42,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:05:42,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:05:42,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:05:42,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:05:42,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:05:42,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:05:42,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:05:42,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 [2018-11-28 18:05:42,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:05:42,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:05:42,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:05:42,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:05:42,650 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:05:42,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:05:42,717 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f022c4173/9977ab1aa4324009b5280a7a8fb75d5f/FLAG490825c4e [2018-11-28 18:05:43,270 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:05:43,271 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:05:43,288 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f022c4173/9977ab1aa4324009b5280a7a8fb75d5f/FLAG490825c4e [2018-11-28 18:05:43,570 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f022c4173/9977ab1aa4324009b5280a7a8fb75d5f [2018-11-28 18:05:43,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:05:43,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:05:43,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:05:43,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:05:43,580 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:05:43,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:43" (1/1) ... [2018-11-28 18:05:43,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549c5244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:43, skipping insertion in model container [2018-11-28 18:05:43,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:43" (1/1) ... [2018-11-28 18:05:43,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:05:43,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:05:44,064 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:05:44,075 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:05:44,224 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:05:44,293 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:05:44,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44 WrapperNode [2018-11-28 18:05:44,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:05:44,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:05:44,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:05:44,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:05:44,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:05:44,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:05:44,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:05:44,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:05:44,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (1/1) ... [2018-11-28 18:05:44,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:05:44,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:05:44,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:05:44,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:05:44,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (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 [2018-11-28 18:05:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-11-28 18:05:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-11-28 18:05:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-11-28 18:05:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-11-28 18:05:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:05:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:05:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-11-28 18:05:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-11-28 18:05:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-28 18:05:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-28 18:05:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:05:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:05:44,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:05:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-11-28 18:05:44,463 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-11-28 18:05:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:05:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:05:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:05:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:05:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-11-28 18:05:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-11-28 18:05:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:05:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:05:44,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:05:45,615 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:05:45,615 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-11-28 18:05:45,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:45 BoogieIcfgContainer [2018-11-28 18:05:45,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:05:45,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:05:45,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:05:45,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:05:45,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:05:43" (1/3) ... [2018-11-28 18:05:45,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472327e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:45, skipping insertion in model container [2018-11-28 18:05:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:44" (2/3) ... [2018-11-28 18:05:45,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472327e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:45, skipping insertion in model container [2018-11-28 18:05:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:45" (3/3) ... [2018-11-28 18:05:45,624 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:05:45,634 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:05:45,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:05:45,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:05:45,697 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:05:45,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:05:45,698 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:05:45,698 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:05:45,698 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:05:45,698 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:05:45,698 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:05:45,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:05:45,698 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:05:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-11-28 18:05:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:05:45,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:45,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:05:45,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:45,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash 533567477, now seen corresponding path program 1 times [2018-11-28 18:05:45,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:45,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:45,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:45,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:05:45,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:05:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:05:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:05:45,911 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-11-28 18:05:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:45,965 INFO L93 Difference]: Finished difference Result 222 states and 373 transitions. [2018-11-28 18:05:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:05:45,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-28 18:05:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:45,987 INFO L225 Difference]: With dead ends: 222 [2018-11-28 18:05:45,988 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 18:05:45,996 INFO L631 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 [2018-11-28 18:05:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 18:05:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-28 18:05:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 18:05:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2018-11-28 18:05:46,071 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2018-11-28 18:05:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:46,072 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2018-11-28 18:05:46,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:05:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2018-11-28 18:05:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:05:46,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:46,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:05:46,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:46,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1718675266, now seen corresponding path program 1 times [2018-11-28 18:05:46,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:46,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:46,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:46,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:46,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:46,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:05:46,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:05:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:05:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:05:46,254 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 3 states. [2018-11-28 18:05:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:46,366 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2018-11-28 18:05:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:05:46,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 18:05:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:46,369 INFO L225 Difference]: With dead ends: 200 [2018-11-28 18:05:46,370 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 18:05:46,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:05:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 18:05:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-28 18:05:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 18:05:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2018-11-28 18:05:46,386 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2018-11-28 18:05:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:46,387 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2018-11-28 18:05:46,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:05:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2018-11-28 18:05:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:05:46,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:46,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:05:46,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:46,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -107362549, now seen corresponding path program 1 times [2018-11-28 18:05:46,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:46,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:46,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:46,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:46,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:46,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:05:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:05:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:05:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:05:46,541 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 6 states. [2018-11-28 18:05:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:46,925 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2018-11-28 18:05:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:05:46,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 18:05:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:46,929 INFO L225 Difference]: With dead ends: 151 [2018-11-28 18:05:46,929 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 18:05:46,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:05:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 18:05:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2018-11-28 18:05:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 18:05:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-11-28 18:05:46,960 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2018-11-28 18:05:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:46,960 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-11-28 18:05:46,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:05:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-11-28 18:05:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:05:46,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:46,962 INFO L402 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, 1] [2018-11-28 18:05:46,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:46,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1290121333, now seen corresponding path program 1 times [2018-11-28 18:05:46,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:46,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:46,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:05:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:05:47,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:05:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:05:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:05:47,136 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 5 states. [2018-11-28 18:05:47,431 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 18:05:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:47,909 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-11-28 18:05:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:05:47,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:05:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:47,916 INFO L225 Difference]: With dead ends: 110 [2018-11-28 18:05:47,916 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 18:05:47,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:05:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 18:05:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 18:05:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 18:05:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-11-28 18:05:47,941 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2018-11-28 18:05:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:47,942 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-11-28 18:05:47,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:05:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-28 18:05:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:05:47,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:47,943 INFO L402 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, 1] [2018-11-28 18:05:47,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:47,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1615537323, now seen corresponding path program 1 times [2018-11-28 18:05:47,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:47,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:47,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:47,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:05:48,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:48,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:05:48,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:05:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:05:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:05:48,238 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 5 states. [2018-11-28 18:05:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:48,505 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-11-28 18:05:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:05:48,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:05:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:48,508 INFO L225 Difference]: With dead ends: 109 [2018-11-28 18:05:48,508 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 18:05:48,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:05:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 18:05:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-28 18:05:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 18:05:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-11-28 18:05:48,524 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2018-11-28 18:05:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:48,524 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2018-11-28 18:05:48,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:05:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2018-11-28 18:05:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:05:48,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:48,526 INFO L402 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, 1, 1, 1, 1] [2018-11-28 18:05:48,526 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:48,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1872008122, now seen corresponding path program 1 times [2018-11-28 18:05:48,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:48,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:05:48,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:05:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:05:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:05:48,699 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 7 states. [2018-11-28 18:05:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:49,276 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-11-28 18:05:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:05:49,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-28 18:05:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:49,281 INFO L225 Difference]: With dead ends: 141 [2018-11-28 18:05:49,281 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 18:05:49,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:05:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 18:05:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2018-11-28 18:05:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 18:05:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-11-28 18:05:49,295 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2018-11-28 18:05:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:49,295 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-28 18:05:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:05:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-11-28 18:05:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:05:49,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:49,297 INFO L402 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, 1, 1, 1, 1] [2018-11-28 18:05:49,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:49,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1085071641, now seen corresponding path program 1 times [2018-11-28 18:05:49,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:49,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:49,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:49,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:05:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:05:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:05:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:05:49,494 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 7 states. [2018-11-28 18:05:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:49,839 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2018-11-28 18:05:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:05:49,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-28 18:05:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:49,844 INFO L225 Difference]: With dead ends: 140 [2018-11-28 18:05:49,844 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 18:05:49,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:05:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 18:05:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-11-28 18:05:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 18:05:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-28 18:05:49,856 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2018-11-28 18:05:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-28 18:05:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:05:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-28 18:05:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:05:49,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:49,858 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:05:49,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:49,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 956444098, now seen corresponding path program 1 times [2018-11-28 18:05:49,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:50,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:05:50,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:05:50,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:50,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:05:50,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 18:05:50,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 18:05:50,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-28 18:05:50,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 18:05:50,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 18:05:50,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-28 18:05:50,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2018-11-28 18:05:50,717 INFO L478 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 11 [2018-11-28 18:05:50,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:05:50,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,781 INFO L478 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 11 [2018-11-28 18:05:50,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:05:50,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:50,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-28 18:05:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:50,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:05:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 18:05:50,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:05:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:05:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:05:50,891 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 11 states. [2018-11-28 18:05:51,191 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 18:05:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:51,678 INFO L93 Difference]: Finished difference Result 241 states and 286 transitions. [2018-11-28 18:05:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:05:51,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-28 18:05:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:51,683 INFO L225 Difference]: With dead ends: 241 [2018-11-28 18:05:51,683 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 18:05:51,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:05:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 18:05:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-11-28 18:05:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-28 18:05:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-11-28 18:05:51,697 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 33 [2018-11-28 18:05:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-11-28 18:05:51,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:05:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-11-28 18:05:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:05:51,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:51,699 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:05:51,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:51,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1584953832, now seen corresponding path program 1 times [2018-11-28 18:05:51,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:51,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:51,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:51,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:05:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:05:51,757 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:05:51,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:05:51 BoogieIcfgContainer [2018-11-28 18:05:51,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:05:51,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:05:51,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:05:51,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:05:51,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:45" (3/4) ... [2018-11-28 18:05:51,809 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:05:51,889 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:05:51,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:05:51,890 INFO L168 Benchmark]: Toolchain (without parser) took 8316.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:05:51,891 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:05:51,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:05:51,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.91 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. [2018-11-28 18:05:51,894 INFO L168 Benchmark]: Boogie Preprocessor took 60.90 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:05:51,894 INFO L168 Benchmark]: RCFGBuilder took 1214.20 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:05:51,896 INFO L168 Benchmark]: TraceAbstraction took 6187.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:05:51,897 INFO L168 Benchmark]: Witness Printer took 83.95 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. [2018-11-28 18:05:51,901 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.91 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 60.90 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1214.20 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6187.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 83.95 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. * 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); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L605] shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L612] EXPR shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}, shape->slist->next={14:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 115 locations, 1 error locations. UNSAFE Result, 6.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 918 SDtfs, 391 SDslu, 2420 SDs, 0 SdLazy, 819 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 34662 SizeOfPredicates, 11 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...