./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.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/tree_false-unreach-call_false-valid-deref.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 b50a14aaadb91f0d2171e26e1cac3b7310be0682 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:05:45,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:05:45,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:05:45,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:05:45,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:05:45,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:05:45,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:05:45,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:05:45,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:05:45,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:05:45,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:05:45,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:05:45,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:05:45,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:05:45,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:05:45,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:05:45,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:05:45,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:05:45,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:05:45,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:05:45,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:05:45,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:05:45,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:05:45,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:05:45,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:05:45,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:05:45,452 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:05:45,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:05:45,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:05:45,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:05:45,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:05:45,455 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:05:45,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:05:45,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:05:45,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:05:45,458 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:45,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:05:45,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:05:45,485 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:05:45,486 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:05:45,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:05:45,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:05:45,487 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:05:45,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:05:45,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:05:45,489 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:05:45,489 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:05:45,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:05:45,489 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:05:45,489 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:05:45,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:05:45,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:05:45,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:05:45,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:05:45,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:05:45,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:05:45,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:05:45,491 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:05:45,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:05:45,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:05:45,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:05:45,492 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 -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2018-11-28 18:05:45,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:05:45,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:05:45,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:05:45,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:05:45,586 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:05:45,587 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-28 18:05:45,652 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8503fafa9/9215098061a54e97b706e2d47bc9db2a/FLAG7946264cf [2018-11-28 18:05:46,159 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:05:46,160 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-28 18:05:46,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8503fafa9/9215098061a54e97b706e2d47bc9db2a/FLAG7946264cf [2018-11-28 18:05:46,447 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8503fafa9/9215098061a54e97b706e2d47bc9db2a [2018-11-28 18:05:46,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:05:46,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:05:46,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:05:46,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:05:46,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:05:46,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:46" (1/1) ... [2018-11-28 18:05:46,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abd2de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:46, skipping insertion in model container [2018-11-28 18:05:46,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:46" (1/1) ... [2018-11-28 18:05:46,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:05:46,544 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:05:46,964 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:05:46,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:05:47,058 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:05:47,195 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:05:47,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:47 WrapperNode [2018-11-28 18:05:47,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:05:47,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:05:47,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:05:47,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:05:47,208 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:47" (1/1) ... [2018-11-28 18:05:47,232 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:47" (1/1) ... [2018-11-28 18:05:47,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:05:47,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:05:47,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:05:47,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:05:47,254 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:47" (1/1) ... [2018-11-28 18:05:47,254 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:47" (1/1) ... [2018-11-28 18:05:47,258 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:47" (1/1) ... [2018-11-28 18:05:47,259 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:47" (1/1) ... [2018-11-28 18:05:47,279 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:47" (1/1) ... [2018-11-28 18:05:47,295 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:47" (1/1) ... [2018-11-28 18:05:47,298 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:47" (1/1) ... [2018-11-28 18:05:47,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:05:47,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:05:47,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:05:47,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:05:47,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:47" (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:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:05:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:05:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-28 18:05:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-28 18:05:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:05:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:05:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:05:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:05:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:05:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:05:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-28 18:05:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-28 18:05:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:05:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-28 18:05:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-28 18:05:47,365 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-28 18:05:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-28 18:05:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:05:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:05:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:05:48,081 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:05:48,082 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 18:05:48,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:48 BoogieIcfgContainer [2018-11-28 18:05:48,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:05:48,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:05:48,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:05:48,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:05:48,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:05:46" (1/3) ... [2018-11-28 18:05:48,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd8a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:48, skipping insertion in model container [2018-11-28 18:05:48,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:47" (2/3) ... [2018-11-28 18:05:48,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd8a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:48, skipping insertion in model container [2018-11-28 18:05:48,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:48" (3/3) ... [2018-11-28 18:05:48,090 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-28 18:05:48,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:05:48,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:05:48,128 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:05:48,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:05:48,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:05:48,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:05:48,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:05:48,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:05:48,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:05:48,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:05:48,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:05:48,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:05:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-28 18:05:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:05:48,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:48,193 INFO L402 BasicCegarLoop]: trace histogram [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,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:48,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1943492660, now seen corresponding path program 1 times [2018-11-28 18:05:48,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:48,345 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:48,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:48,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:05:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:05:48,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:05:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:05:48,371 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-28 18:05:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:48,407 INFO L93 Difference]: Finished difference Result 111 states and 170 transitions. [2018-11-28 18:05:48,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:05:48,409 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-28 18:05:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:48,424 INFO L225 Difference]: With dead ends: 111 [2018-11-28 18:05:48,425 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:05:48,431 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:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:05:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:05:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:05:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-28 18:05:48,484 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2018-11-28 18:05:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:48,485 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-28 18:05:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:05:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-28 18:05:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:05:48,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:48,486 INFO L402 BasicCegarLoop]: trace histogram [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,486 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:48,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash -882886878, now seen corresponding path program 1 times [2018-11-28 18:05:48,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:48,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:48,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:48,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:48,884 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:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:05:48,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:05:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:05:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:05:48,888 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2018-11-28 18:05:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:49,032 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-28 18:05:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:05:49,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 18:05:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:49,036 INFO L225 Difference]: With dead ends: 85 [2018-11-28 18:05:49,036 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 18:05:49,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:05:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 18:05:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 18:05:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:05:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-28 18:05:49,046 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 20 [2018-11-28 18:05:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:49,047 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-28 18:05:49,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:05:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-28 18:05:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:05:49,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:49,048 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] [2018-11-28 18:05:49,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:49,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1543057703, now seen corresponding path program 1 times [2018-11-28 18:05:49,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:49,153 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,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:49,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:05:49,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:05:49,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:05:49,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:05:49,154 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 3 states. [2018-11-28 18:05:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:49,233 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-28 18:05:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:05:49,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 18:05:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:49,236 INFO L225 Difference]: With dead ends: 70 [2018-11-28 18:05:49,236 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 18:05:49,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:05:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 18:05:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-28 18:05:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:05:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-28 18:05:49,244 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 26 [2018-11-28 18:05:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-28 18:05:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:05:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-28 18:05:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 18:05:49,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:49,246 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] [2018-11-28 18:05:49,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:49,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2140294891, now seen corresponding path program 1 times [2018-11-28 18:05:49,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:49,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:05:49,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:05:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 18:05:49,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:05:49,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:05:49,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:05:49,631 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 9 states. [2018-11-28 18:05:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:50,420 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-11-28 18:05:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:05:50,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-28 18:05:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:50,423 INFO L225 Difference]: With dead ends: 91 [2018-11-28 18:05:50,423 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 18:05:50,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:05:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 18:05:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-28 18:05:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:05:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 18:05:50,449 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 29 [2018-11-28 18:05:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 18:05:50,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:05:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 18:05:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:05:50,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:50,451 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, 1] [2018-11-28 18:05:50,451 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:50,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1369121938, now seen corresponding path program 1 times [2018-11-28 18:05:50,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:50,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:50,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:51,239 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2018-11-28 18:05:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:05:51,477 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:51,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:51,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:05:51,597 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:05:51,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:05:51,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:51,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:51,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 18:05:51,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:05:51,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 18:05:51,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:05:51,825 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 18:05:51,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:51,880 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-11-28 18:05:52,841 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2018-11-28 18:05:52,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 550 [2018-11-28 18:05:52,913 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 25 treesize of output 28 [2018-11-28 18:05:52,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:52,948 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 28 treesize of output 47 [2018-11-28 18:05:52,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:52,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,070 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:05:53,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 549 treesize of output 549 [2018-11-28 18:05:53,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2018-11-28 18:05:53,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,353 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 87 [2018-11-28 18:05:53,359 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-28 18:05:53,360 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,379 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:05:53,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 113 [2018-11-28 18:05:53,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,418 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 73 treesize of output 123 [2018-11-28 18:05:53,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,471 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,515 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:53,530 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:53,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 965 treesize of output 268 [2018-11-28 18:05:53,766 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-11-28 18:05:53,770 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 25 treesize of output 28 [2018-11-28 18:05:53,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,777 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 28 treesize of output 47 [2018-11-28 18:05:53,778 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,795 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:53,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-11-28 18:05:53,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 94 [2018-11-28 18:05:53,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:53,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 157 [2018-11-28 18:05:53,909 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,000 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,039 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,067 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 137 [2018-11-28 18:05:54,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:54,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:54,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:54,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2018-11-28 18:05:54,136 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,198 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:54,272 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:131 [2018-11-28 18:05:54,673 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 18:05:54,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 116 [2018-11-28 18:05:54,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-11-28 18:05:54,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:55,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:55,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:55,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:55,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-11-28 18:05:55,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:55,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-11-28 18:05:55,089 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 53 treesize of output 30 [2018-11-28 18:05:55,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-28 18:05:55,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 18:05:55,146 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:55,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:55,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:148, output treesize:3 [2018-11-28 18:05:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:55,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:05:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 18:05:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:05:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:05:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:05:55,183 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 21 states. [2018-11-28 18:05:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:05:56,248 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-28 18:05:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:05:56,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-11-28 18:05:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:05:56,252 INFO L225 Difference]: With dead ends: 80 [2018-11-28 18:05:56,252 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:05:56,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-11-28 18:05:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:05:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-11-28 18:05:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:05:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-28 18:05:56,264 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 34 [2018-11-28 18:05:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:05:56,265 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-28 18:05:56,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:05:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-28 18:05:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:05:56,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:05:56,266 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, 1] [2018-11-28 18:05:56,266 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:05:56,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:05:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1388207460, now seen corresponding path program 1 times [2018-11-28 18:05:56,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:05:56,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:05:56,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:56,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:56,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:05:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:56,614 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-11-28 18:05:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:05:56,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:05:56,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:05:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:05:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:05:56,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:05:56,814 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:05:56,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:56,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:56,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:05:57,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 18:05:57,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:05:57,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 18:05:57,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2018-11-28 18:05:57,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 142 [2018-11-28 18:05:57,342 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 25 treesize of output 28 [2018-11-28 18:05:57,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,349 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 28 treesize of output 47 [2018-11-28 18:05:57,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 130 [2018-11-28 18:05:57,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 135 [2018-11-28 18:05:57,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,430 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:05:57,465 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 25 treesize of output 23 [2018-11-28 18:05:57,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-28 18:05:57,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:57,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:57,489 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 33 treesize of output 29 [2018-11-28 18:05:57,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-28 18:05:57,494 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:57,500 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:05:57,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-11-28 18:05:57,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:05:57,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 58 [2018-11-28 18:05:57,561 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-11-28 18:05:57,777 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 18:05:57,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 18:05:57,824 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:935, output treesize:137 [2018-11-28 18:05:58,352 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 18:05:59,814 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 18:06:02,074 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 18:06:02,562 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 18:06:04,783 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 18:06:04,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-11-28 18:06:04,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:06:04,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-28 18:06:04,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 18:06:05,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2018-11-28 18:06:05,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 18:06:05,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:06:05,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2018-11-28 18:06:05,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 18:06:05,104 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 18:06:05,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-11-28 18:06:05,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 18:06:05,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:06:05,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-28 18:06:05,166 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:06:05,201 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:158, output treesize:4 [2018-11-28 18:06:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:06:05,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:06:05,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 18:06:05,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:06:05,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:06:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:06:05,262 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 21 states. [2018-11-28 18:06:10,284 WARN L180 SmtUtils]: Spent 4.55 s on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 18:06:10,739 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 18:06:13,438 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 84 [2018-11-28 18:06:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:06:13,854 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-28 18:06:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:06:13,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-11-28 18:06:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:06:13,856 INFO L225 Difference]: With dead ends: 92 [2018-11-28 18:06:13,857 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 18:06:13,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-11-28 18:06:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 18:06:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-28 18:06:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:06:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 18:06:13,878 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 34 [2018-11-28 18:06:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:06:13,879 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 18:06:13,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:06:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 18:06:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 18:06:13,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:06:13,885 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, 1, 1, 1, 1] [2018-11-28 18:06:13,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:06:13,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:06:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1783043061, now seen corresponding path program 1 times [2018-11-28 18:06:13,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:06:13,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:06:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:06:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:06:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:06:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:06:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:06:14,039 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:06:14,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:06:14 BoogieIcfgContainer [2018-11-28 18:06:14,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:06:14,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:06:14,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:06:14,101 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:06:14,101 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:48" (3/4) ... [2018-11-28 18:06:14,105 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:06:14,173 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:06:14,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:06:14,177 INFO L168 Benchmark]: Toolchain (without parser) took 27725.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -273.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:06:14,181 INFO L168 Benchmark]: CDTParser took 0.41 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:06:14,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:06:14,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.73 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:06:14,185 INFO L168 Benchmark]: Boogie Preprocessor took 60.30 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:06:14,187 INFO L168 Benchmark]: RCFGBuilder took 779.54 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:06:14,188 INFO L168 Benchmark]: TraceAbstraction took 26016.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:06:14,194 INFO L168 Benchmark]: Witness Printer took 76.02 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:06:14,196 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.41 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 741.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.73 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. * Boogie Preprocessor took 60.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 779.54 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26016.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Witness Printer took 76.02 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. 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: [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L580] node->left = ((void *)0) [L581] node->right = nodelast VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={56:0}, malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={56:0}, malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={56:0}, malloc(sizeof *node)={49:0}, node={0:0}, nodelast={49:0}, value=0] [L598] return nodelast; VAL [\result={49:0}, malloc(sizeof *node)={56:0}, malloc(sizeof *node)={49:0}, node={0:0}, nodelast={49:0}, value=0] [L619] RET, EXPR create_tree() VAL [create_tree()={49:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={49:0}] [L622] CALL inspect(data) VAL [node={49:0}] [L564] COND FALSE !(!(node)) VAL [node={49:0}, node={49:0}] [L565] COND TRUE node != ((void *)0) [L566] node->left VAL [node={49:0}, node={49:0}, node->left={56:0}] [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value VAL [node={49:0}, node={49:0}, node->left={56:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={49:0}, node={49:0}, node->value=0] [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 60 locations, 1 error locations. UNSAFE Result, 25.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 238 SDtfs, 148 SDslu, 1071 SDs, 0 SdLazy, 809 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 222 ConstructedInterpolants, 11 QuantifiedInterpolants, 161265 SizeOfPredicates, 24 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 13/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...