./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7716826f9b443d6310df8de2d829a4d2f71b85a7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memtrack) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:12:17,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:12:17,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:12:17,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:12:17,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:12:17,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:12:17,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:12:17,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:12:17,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:12:17,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:12:17,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:12:17,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:12:17,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:12:17,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:12:17,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:12:17,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:12:17,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:12:17,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:12:17,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:12:17,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:12:17,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:12:17,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:12:17,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:12:17,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:12:17,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:12:17,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:12:17,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:12:17,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:12:17,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:12:17,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:12:17,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:12:17,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:12:17,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:12:17,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:12:17,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:12:17,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:12:17,693 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-02 14:12:17,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:12:17,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:12:17,705 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:12:17,705 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:12:17,706 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:12:17,706 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:12:17,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:12:17,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:12:17,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:12:17,707 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 14:12:17,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:12:17,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:12:17,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:12:17,709 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:12:17,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:12:17,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:12:17,710 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan 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 valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 7716826f9b443d6310df8de2d829a4d2f71b85a7 [2018-12-02 14:12:17,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:12:17,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:12:17,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:12:17,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:12:17,745 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:12:17,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-12-02 14:12:17,790 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/data/38ba690eb/239beabd0e7d45198c942c1af8bf9d60/FLAGc27a7e337 [2018-12-02 14:12:18,215 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:12:18,216 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-12-02 14:12:18,221 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/data/38ba690eb/239beabd0e7d45198c942c1af8bf9d60/FLAGc27a7e337 [2018-12-02 14:12:18,229 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/data/38ba690eb/239beabd0e7d45198c942c1af8bf9d60 [2018-12-02 14:12:18,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:12:18,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:12:18,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:12:18,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:12:18,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:12:18,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fe4f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18, skipping insertion in model container [2018-12-02 14:12:18,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:12:18,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:12:18,394 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:12:18,400 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:12:18,453 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:12:18,473 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:12:18,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18 WrapperNode [2018-12-02 14:12:18,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:12:18,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:12:18,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:12:18,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:12:18,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:12:18,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:12:18,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:12:18,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:12:18,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... [2018-12-02 14:12:18,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:12:18,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:12:18,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:12:18,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:12:18,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/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-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 14:12:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:12:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:12:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 14:12:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 14:12:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:12:18,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:12:18,710 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:12:18,710 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 14:12:18,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18 BoogieIcfgContainer [2018-12-02 14:12:18,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:12:18,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:12:18,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:12:18,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:12:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:12:18" (1/3) ... [2018-12-02 14:12:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6274a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:12:18, skipping insertion in model container [2018-12-02 14:12:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:18" (2/3) ... [2018-12-02 14:12:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6274a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:12:18, skipping insertion in model container [2018-12-02 14:12:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18" (3/3) ... [2018-12-02 14:12:18,715 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2018-12-02 14:12:18,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:12:18,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-02 14:12:18,735 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-02 14:12:18,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:12:18,750 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 14:12:18,750 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:12:18,750 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:12:18,750 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:12:18,750 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:12:18,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:12:18,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:12:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-12-02 14:12:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 14:12:18,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:18,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:18,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:18,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash -375591005, now seen corresponding path program 1 times [2018-12-02 14:12:18,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:18,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:12:18,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:12:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:12:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:12:18,876 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2018-12-02 14:12:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:18,933 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-12-02 14:12:18,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:12:18,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-02 14:12:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:18,939 INFO L225 Difference]: With dead ends: 51 [2018-12-02 14:12:18,939 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:12:18,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:12:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:12:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 14:12:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:12:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-02 14:12:18,961 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 9 [2018-12-02 14:12:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:18,961 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-02 14:12:18,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:12:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-02 14:12:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 14:12:18,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:18,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:18,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:18,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash -375591004, now seen corresponding path program 1 times [2018-12-02 14:12:18,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:18,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:18,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:12:19,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:12:19,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:12:19,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:12:19,006 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 3 states. [2018-12-02 14:12:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,028 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-02 14:12:19,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:12:19,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-02 14:12:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,029 INFO L225 Difference]: With dead ends: 42 [2018-12-02 14:12:19,029 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 14:12:19,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:12:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 14:12:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 14:12:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 14:12:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 14:12:19,032 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 9 [2018-12-02 14:12:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,032 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 14:12:19,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:12:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-02 14:12:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:12:19,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:19,033 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash -841827727, now seen corresponding path program 1 times [2018-12-02 14:12:19,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:12:19,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:12:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:12:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:12:19,065 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-12-02 14:12:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,155 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-02 14:12:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:12:19,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-02 14:12:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,156 INFO L225 Difference]: With dead ends: 71 [2018-12-02 14:12:19,156 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 14:12:19,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:12:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 14:12:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-12-02 14:12:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 14:12:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-02 14:12:19,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 12 [2018-12-02 14:12:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,162 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-02 14:12:19,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:12:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-02 14:12:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:12:19,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:19,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -841827726, now seen corresponding path program 1 times [2018-12-02 14:12:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:12:19,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:12:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:12:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:12:19,205 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-12-02 14:12:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,261 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-02 14:12:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:12:19,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-02 14:12:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,262 INFO L225 Difference]: With dead ends: 60 [2018-12-02 14:12:19,262 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 14:12:19,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:12:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 14:12:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-12-02 14:12:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 14:12:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-02 14:12:19,265 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2018-12-02 14:12:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,265 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-02 14:12:19,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:12:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-02 14:12:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 14:12:19,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:19,266 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash 757154897, now seen corresponding path program 1 times [2018-12-02 14:12:19,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:12:19,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:12:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:12:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:12:19,287 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 4 states. [2018-12-02 14:12:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,321 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-02 14:12:19,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:12:19,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 14:12:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,322 INFO L225 Difference]: With dead ends: 57 [2018-12-02 14:12:19,322 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 14:12:19,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:12:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 14:12:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-12-02 14:12:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 14:12:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-12-02 14:12:19,325 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 17 [2018-12-02 14:12:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,325 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-12-02 14:12:19,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:12:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-12-02 14:12:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:12:19,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,325 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:19,325 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 705100004, now seen corresponding path program 1 times [2018-12-02 14:12:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:12:19,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:12:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:12:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:12:19,358 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-12-02 14:12:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,444 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-02 14:12:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:12:19,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 14:12:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,445 INFO L225 Difference]: With dead ends: 65 [2018-12-02 14:12:19,445 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 14:12:19,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:12:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 14:12:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-12-02 14:12:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 14:12:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-02 14:12:19,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-12-02 14:12:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,448 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-02 14:12:19,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:12:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-02 14:12:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:12:19,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,448 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:12:19,449 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 705100005, now seen corresponding path program 1 times [2018-12-02 14:12:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:12:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:12:19,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:12:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:12:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:12:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:12:19,508 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 6 states. [2018-12-02 14:12:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:19,627 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-02 14:12:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:12:19,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 14:12:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:19,628 INFO L225 Difference]: With dead ends: 61 [2018-12-02 14:12:19,628 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 14:12:19,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:12:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 14:12:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-12-02 14:12:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 14:12:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-12-02 14:12:19,632 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-12-02 14:12:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:19,632 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-12-02 14:12:19,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:12:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-12-02 14:12:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:12:19,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:19,633 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] [2018-12-02 14:12:19,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:19,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1040938401, now seen corresponding path program 1 times [2018-12-02 14:12:19,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:19,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:12:19,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:12:19,726 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 14:12:19,728 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [19], [26], [29], [53], [56], [59], [68], [69], [70], [78], [80], [83], [90], [91], [92] [2018-12-02 14:12:19,748 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:12:19,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:12:19,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:12:19,852 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Performed 192 root evaluator evaluations with a maximum evaluation depth of 3. Performed 192 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-12-02 14:12:19,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:19,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:12:19,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:12:19,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/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-12-02 14:12:19,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:19,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:12:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:19,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:12:19,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 14:12:19,949 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-12-02 14:12:19,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 14:12:19,959 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-12-02 14:12:19,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-02 14:12:19,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 14:12:19,997 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-12-02 14:12:19,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:19,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 14:12:20,006 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-12-02 14:12:20,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 14:12:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:20,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:12:20,116 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 19 treesize of output 17 [2018-12-02 14:12:20,118 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 7 treesize of output 3 [2018-12-02 14:12:20,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,123 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 19 treesize of output 17 [2018-12-02 14:12:20,125 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 7 treesize of output 3 [2018-12-02 14:12:20,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,156 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 19 treesize of output 17 [2018-12-02 14:12:20,158 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 7 treesize of output 3 [2018-12-02 14:12:20,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,163 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 19 treesize of output 17 [2018-12-02 14:12:20,165 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 7 treesize of output 3 [2018-12-02 14:12:20,165 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:12:20,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:12:20,187 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:53, output treesize:24 [2018-12-02 14:12:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:12:20,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:12:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2018-12-02 14:12:20,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:12:20,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:12:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:12:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:12:20,252 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2018-12-02 14:12:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:12:20,386 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-02 14:12:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:12:20,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-02 14:12:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:12:20,386 INFO L225 Difference]: With dead ends: 57 [2018-12-02 14:12:20,386 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 14:12:20,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:12:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 14:12:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-12-02 14:12:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 14:12:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-02 14:12:20,389 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 21 [2018-12-02 14:12:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:12:20,389 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-02 14:12:20,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:12:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-02 14:12:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:12:20,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:12:20,389 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, 1, 1] [2018-12-02 14:12:20,389 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2018-12-02 14:12:20,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2090646631, now seen corresponding path program 1 times [2018-12-02 14:12:20,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:12:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:12:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:12:20,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:12:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:12:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:12:20,414 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:12:20,422 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 14:12:20,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:12:20 BoogieIcfgContainer [2018-12-02 14:12:20,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:12:20,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:12:20,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:12:20,432 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:12:20,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:18" (3/4) ... [2018-12-02 14:12:20,434 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:12:20,436 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 14:12:20,460 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9de6ba12-4f8e-4e8e-aced-a4641065e36d/bin-2019/utaipan/witness.graphml [2018-12-02 14:12:20,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:12:20,460 INFO L168 Benchmark]: Toolchain (without parser) took 2229.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -245.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:12:20,461 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:12:20,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:12:20,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.14 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-12-02 14:12:20,462 INFO L168 Benchmark]: Boogie Preprocessor took 17.17 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-12-02 14:12:20,462 INFO L168 Benchmark]: RCFGBuilder took 202.06 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:12:20,462 INFO L168 Benchmark]: TraceAbstraction took 1720.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:12:20,462 INFO L168 Benchmark]: Witness Printer took 27.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:12:20,464 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.17 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 202.06 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1720.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 27.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L628] COND FALSE !(a == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L629] List t; [L630] List p = a; VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L631] a->h = 2 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L640] p->n = 0 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L641] p = a VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L642] COND TRUE p!=0 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L643] EXPR p->h VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2] [L643] COND FALSE !(p->h != 2) [L646] EXPR p->n VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->n={0:0}] [L646] p = p->n [L642] COND FALSE !(p!=0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={0:0}] [L648] return 0; VAL [\result=0, a={14:0}, malloc(sizeof(struct node))={14:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 17 error locations. UNSAFE Result, 1.6s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 419 SDslu, 292 SDs, 0 SdLazy, 519 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 152 ConstructedInterpolants, 1 QuantifiedInterpolants, 17472 SizeOfPredicates, 14 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 7/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...