./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b87efc31cc381b9fe84243511097e1307d2087b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-5842f4b [2018-11-18 17:46:10,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:46:10,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:46:10,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:46:10,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:46:10,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:46:10,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:46:10,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:46:10,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:46:10,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:46:10,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:46:10,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:46:10,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:46:10,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:46:10,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:46:10,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:46:10,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:46:10,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:46:10,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:46:10,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:46:10,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:46:10,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:46:10,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:46:10,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:46:10,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:46:10,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:46:10,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:46:10,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:46:10,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:46:10,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:46:10,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:46:10,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:46:10,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:46:10,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:46:10,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:46:10,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:46:10,592 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:46:10,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:46:10,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:46:10,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:46:10,600 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:46:10,600 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:46:10,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:46:10,601 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:46:10,602 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:46:10,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:46:10,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:46:10,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:46:10,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:46:10,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:46:10,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:46:10,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:46:10,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:46:10,605 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:46:10,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:46:10,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:46:10,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:46:10,605 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_16bcc303-9849-4d6c-b42e-f371ea349117/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 ! call(__VERIFIER_error())) ) 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 -> 8b87efc31cc381b9fe84243511097e1307d2087b [2018-11-18 17:46:10,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:46:10,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:46:10,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:46:10,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:46:10,643 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:46:10,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:46:10,689 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/data/0d8975d22/9c7040d398fb491aa98806aaf157163b/FLAG56802cf77 [2018-11-18 17:46:11,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:46:11,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:46:11,069 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/data/0d8975d22/9c7040d398fb491aa98806aaf157163b/FLAG56802cf77 [2018-11-18 17:46:11,446 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/data/0d8975d22/9c7040d398fb491aa98806aaf157163b [2018-11-18 17:46:11,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:46:11,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:46:11,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:46:11,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:46:11,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:46:11,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a883eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11, skipping insertion in model container [2018-11-18 17:46:11,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:46:11,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:46:11,672 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:46:11,679 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:46:11,712 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:46:11,784 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:46:11,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11 WrapperNode [2018-11-18 17:46:11,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:46:11,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:46:11,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:46:11,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:46:11,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:46:11,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:46:11,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:46:11,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:46:11,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... [2018-11-18 17:46:11,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:46:11,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:46:11,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:46:11,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:46:11,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/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-11-18 17:46:11,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:46:11,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:46:11,861 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:46:11,862 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:46:11,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:46:11,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 17:46:11,862 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 17:46:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:46:11,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:46:12,093 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:46:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:46:12 BoogieIcfgContainer [2018-11-18 17:46:12,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:46:12,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:46:12,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:46:12,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:46:12,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:46:11" (1/3) ... [2018-11-18 17:46:12,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c5d116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:46:12, skipping insertion in model container [2018-11-18 17:46:12,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:46:11" (2/3) ... [2018-11-18 17:46:12,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c5d116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:46:12, skipping insertion in model container [2018-11-18 17:46:12,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:46:12" (3/3) ... [2018-11-18 17:46:12,099 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:46:12,104 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:46:12,110 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:46:12,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:46:12,139 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:46:12,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:46:12,140 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:46:12,140 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:46:12,140 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:46:12,140 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:46:12,140 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:46:12,140 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:46:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-18 17:46:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 17:46:12,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:12,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:12,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:12,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1779562124, now seen corresponding path program 1 times [2018-11-18 17:46:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:12,253 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-18 17:46:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:46:12,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:46:12,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:46:12,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:46:12,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:46:12,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:46:12,269 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-18 17:46:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:12,281 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2018-11-18 17:46:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:46:12,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 17:46:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:12,291 INFO L225 Difference]: With dead ends: 67 [2018-11-18 17:46:12,291 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 17:46:12,293 INFO L604 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-18 17:46:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 17:46:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 17:46:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 17:46:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2018-11-18 17:46:12,318 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 21 [2018-11-18 17:46:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:12,318 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-18 17:46:12,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:46:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2018-11-18 17:46:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:46:12,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:12,319 INFO L375 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-11-18 17:46:12,320 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:12,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1505842030, now seen corresponding path program 1 times [2018-11-18 17:46:12,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:12,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:12,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:12,396 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-18 17:46:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:46:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:46:12,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:46:12,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:46:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:46:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:46:12,398 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 5 states. [2018-11-18 17:46:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:12,461 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-18 17:46:12,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:46:12,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 17:46:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:12,461 INFO L225 Difference]: With dead ends: 62 [2018-11-18 17:46:12,462 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 17:46:12,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:46:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 17:46:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-18 17:46:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 17:46:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-11-18 17:46:12,467 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 22 [2018-11-18 17:46:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:12,467 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-11-18 17:46:12,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:46:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-18 17:46:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:46:12,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:12,468 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:12,469 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:12,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1901485922, now seen corresponding path program 1 times [2018-11-18 17:46:12,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:12,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:12,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:12,515 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-18 17:46:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:46:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:46:12,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:46:12,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:46:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:46:12,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:46:12,516 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-11-18 17:46:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:12,536 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-18 17:46:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:46:12,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:46:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:12,537 INFO L225 Difference]: With dead ends: 70 [2018-11-18 17:46:12,537 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 17:46:12,538 INFO L604 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-11-18 17:46:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 17:46:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-18 17:46:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 17:46:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-11-18 17:46:12,542 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 30 [2018-11-18 17:46:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:12,542 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-18 17:46:12,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:46:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-18 17:46:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:46:12,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:12,543 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:12,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:12,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1372413020, now seen corresponding path program 1 times [2018-11-18 17:46:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:12,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:12,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:12,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:46:12,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-18 17:46:12,614 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [22], [24], [27], [31], [36], [38], [42], [43], [47], [49], [53], [55], [60], [65], [67], [70], [76], [113], [118], [119], [120], [122], [123] [2018-11-18 17:46:12,634 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:46:12,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:46:12,749 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:46:12,750 INFO L272 AbstractInterpreter]: Visited 17 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Performed 181 root evaluator evaluations with a maximum evaluation depth of 3. Performed 181 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-18 17:46:12,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:12,762 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:46:12,825 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.92% of their original sizes. [2018-11-18 17:46:12,825 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:46:12,874 INFO L415 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-11-18 17:46:12,875 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:46:12,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:46:12,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 17:46:12,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:46:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:46:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:46:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:46:12,876 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 9 states. [2018-11-18 17:46:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:13,182 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-18 17:46:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:46:13,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-18 17:46:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:13,183 INFO L225 Difference]: With dead ends: 72 [2018-11-18 17:46:13,183 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 17:46:13,183 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:46:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 17:46:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-18 17:46:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 17:46:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-18 17:46:13,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 30 [2018-11-18 17:46:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:13,190 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-18 17:46:13,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:46:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-18 17:46:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 17:46:13,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:13,191 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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-18 17:46:13,192 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:13,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1244865652, now seen corresponding path program 1 times [2018-11-18 17:46:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:13,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:13,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:13,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:13,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:46:13,281 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-18 17:46:13,282 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [22], [24], [27], [31], [34], [36], [38], [42], [43], [47], [49], [53], [55], [60], [65], [67], [70], [76], [113], [118], [119], [120], [122], [123] [2018-11-18 17:46:13,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:46:13,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:46:13,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:46:13,342 INFO L272 AbstractInterpreter]: Visited 30 different actions 64 times. Merged at 12 different actions 28 times. Never widened. Performed 470 root evaluator evaluations with a maximum evaluation depth of 3. Performed 470 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-18 17:46:13,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:13,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:46:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:13,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/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-11-18 17:46:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:13,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:46:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:13,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:46:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:13,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:46:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:13,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:46:13,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-18 17:46:13,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:46:13,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:46:13,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:46:13,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:46:13,577 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 7 states. [2018-11-18 17:46:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:13,638 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2018-11-18 17:46:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:46:13,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-18 17:46:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:13,640 INFO L225 Difference]: With dead ends: 95 [2018-11-18 17:46:13,640 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 17:46:13,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:46:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 17:46:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-11-18 17:46:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 17:46:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2018-11-18 17:46:13,647 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 38 [2018-11-18 17:46:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:13,648 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2018-11-18 17:46:13,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:46:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-18 17:46:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 17:46:13,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:13,649 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:13,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:13,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1790061244, now seen corresponding path program 2 times [2018-11-18 17:46:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:13,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:13,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:13,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:46:13,733 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:46:13,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:46:13,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:13,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/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-18 17:46:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:46:13,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:46:13,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 17:46:13,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:46:13,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:46:13,788 INFO L477 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 16 treesize of output 13 [2018-11-18 17:46:13,799 INFO L477 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 13 treesize of output 16 [2018-11-18 17:46:13,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:13,804 INFO L477 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 16 treesize of output 23 [2018-11-18 17:46:13,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,817 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2018-11-18 17:46:13,835 INFO L477 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 30 treesize of output 23 [2018-11-18 17:46:13,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:13,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:13,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:13,842 INFO L477 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 23 treesize of output 46 [2018-11-18 17:46:13,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:46:13,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-18 17:46:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 17:46:13,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:46:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 17:46:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:46:14,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 20 [2018-11-18 17:46:14,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:46:14,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:46:14,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:46:14,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:46:14,142 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2018-11-18 17:46:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:14,314 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2018-11-18 17:46:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:46:14,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-18 17:46:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:14,315 INFO L225 Difference]: With dead ends: 91 [2018-11-18 17:46:14,315 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 17:46:14,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-11-18 17:46:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 17:46:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-11-18 17:46:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 17:46:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-18 17:46:14,320 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 46 [2018-11-18 17:46:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:14,321 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-18 17:46:14,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:46:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-18 17:46:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 17:46:14,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:14,321 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:14,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:14,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1790063166, now seen corresponding path program 1 times [2018-11-18 17:46:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:14,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:46:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:14,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:14,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:14,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:46:14,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 17:46:14,411 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [22], [24], [27], [31], [34], [36], [38], [42], [43], [47], [49], [53], [55], [60], [65], [67], [72], [76], [113], [118], [119], [120], [122], [123] [2018-11-18 17:46:14,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:46:14,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:46:14,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:46:14,477 INFO L272 AbstractInterpreter]: Visited 30 different actions 64 times. Merged at 12 different actions 28 times. Never widened. Performed 483 root evaluator evaluations with a maximum evaluation depth of 3. Performed 483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-18 17:46:14,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:14,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:46:14,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:14,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:46:14,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:14,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:46:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:14,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:46:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:14,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:46:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:14,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:46:14,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-18 17:46:14,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:46:14,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:46:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:46:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:46:14,656 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 8 states. [2018-11-18 17:46:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:14,690 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2018-11-18 17:46:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:46:14,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-18 17:46:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:14,692 INFO L225 Difference]: With dead ends: 123 [2018-11-18 17:46:14,692 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 17:46:14,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:46:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 17:46:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-11-18 17:46:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 17:46:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-18 17:46:14,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 46 [2018-11-18 17:46:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-18 17:46:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:46:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-11-18 17:46:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 17:46:14,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:14,701 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:14,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:14,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1437421934, now seen corresponding path program 2 times [2018-11-18 17:46:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:14,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:46:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:14,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:46:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:14,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:46:14,778 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:46:14,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:46:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:46:14,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:46:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:46:14,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:46:14,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 17:46:14,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:46:14,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:46:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:14,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:46:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:46:15,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:46:15,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-11-18 17:46:15,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:46:15,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:46:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:46:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:46:15,079 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 9 states. [2018-11-18 17:46:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:46:15,128 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2018-11-18 17:46:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:46:15,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-18 17:46:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:46:15,130 INFO L225 Difference]: With dead ends: 139 [2018-11-18 17:46:15,130 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 17:46:15,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:46:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 17:46:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-11-18 17:46:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 17:46:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2018-11-18 17:46:15,138 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 54 [2018-11-18 17:46:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:46:15,138 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2018-11-18 17:46:15,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:46:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2018-11-18 17:46:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 17:46:15,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:46:15,139 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:46:15,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:46:15,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:46:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash 737034398, now seen corresponding path program 3 times [2018-11-18 17:46:15,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:46:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:15,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:46:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:46:15,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:46:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:46:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:46:15,220 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:46:15,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:46:15 BoogieIcfgContainer [2018-11-18 17:46:15,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:46:15,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:46:15,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:46:15,254 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:46:15,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:46:12" (3/4) ... [2018-11-18 17:46:15,257 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:46:15,308 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_16bcc303-9849-4d6c-b42e-f371ea349117/bin-2019/utaipan/witness.graphml [2018-11-18 17:46:15,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:46:15,309 INFO L168 Benchmark]: Toolchain (without parser) took 3861.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 866.1 MB in the end (delta: 89.3 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,310 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:46:15,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.01 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,311 INFO L168 Benchmark]: Boogie Preprocessor took 23.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,312 INFO L168 Benchmark]: RCFGBuilder took 266.46 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,312 INFO L168 Benchmark]: TraceAbstraction took 3159.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.3 MB in the end (delta: 225.4 MB). Peak memory consumption was 225.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,312 INFO L168 Benchmark]: Witness Printer took 54.03 ms. Allocated memory is still 1.2 GB. Free memory was 871.3 MB in the beginning and 866.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:46:15,314 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.01 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 266.46 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3159.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.3 MB in the end (delta: 225.4 MB). Peak memory consumption was 225.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.03 ms. Allocated memory is still 1.2 GB. Free memory was 871.3 MB in the beginning and 866.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] EXPR, FCALL malloc(sizeof(struct node)) [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L574] FCALL new_head->data_0 = 0 [L575] FCALL new_head->data_1 = 0 [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] FCALL new_head->next = head [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={23:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L569] COND TRUE len > 0 [L570] EXPR, FCALL malloc(sizeof(struct node)) [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={23:0}, len=4, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={23:0}, len=4, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L574] FCALL new_head->data_0 = 0 [L575] FCALL new_head->data_1 = 0 [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={23:0}, len=4, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] FCALL new_head->next = head [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={23:0}, len=4, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L579] COND TRUE \read(head) [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={23:0}, len=4, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={24:0}, len=3, malloc(sizeof(struct node))={24:0}, new_head={24:0}] [L569] COND TRUE len > 0 [L570] EXPR, FCALL malloc(sizeof(struct node)) [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={24:0}, len=3, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={24:0}, len=3, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L574] FCALL new_head->data_0 = 0 [L575] FCALL new_head->data_1 = 0 [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={24:0}, len=3, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] FCALL new_head->next = head [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={24:0}, len=3, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L579] COND TRUE \read(head) [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={24:0}, len=3, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={21:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L569] COND TRUE len > 0 [L570] EXPR, FCALL malloc(sizeof(struct node)) [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={21:0}, len=2, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={21:0}, len=2, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L574] FCALL new_head->data_0 = 0 [L575] FCALL new_head->data_1 = 0 [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={21:0}, len=2, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] FCALL new_head->next = head [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={21:0}, len=2, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L579] COND TRUE \read(head) [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={21:0}, len=2, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={26:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L569] COND TRUE len > 0 [L570] EXPR, FCALL malloc(sizeof(struct node)) [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={26:0}, len=1, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={26:0}, len=1, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L574] FCALL new_head->data_0 = 0 [L575] FCALL new_head->data_1 = 0 [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={26:0}, len=1, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] FCALL new_head->next = head [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={26:0}, len=1, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L579] COND TRUE \read(head) [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={26:0}, len=1, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={27:0}, len=0, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={27:0}, len=0, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L585] RET return head; VAL [\old(len)=5, \result={27:0}, head={27:0}, len=0, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L589] EXPR dll_create(len) VAL [dll_create(len)={27:0}, len=5] [L589] DLL head = dll_create(len); [L590] FCALL head->next VAL [head={27:0}, head->next={26:0}, len=5] [L590] COND TRUE head->next [L591] EXPR, FCALL head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR, FCALL head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={27:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR, FCALL head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={27:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={27:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. UNSAFE Result, 3.1s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 303 SDslu, 925 SDs, 0 SdLazy, 293 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 448 GetRequests, 367 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9383415435139573 AbsIntWeakeningRatio, 1.103448275862069 AbsIntAvgWeakeningVarsNumRemoved, 0.7931034482758621 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 533 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 99077 SizeOfPredicates, 16 NumberOfNonLiveVariables, 671 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 62/388 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...