./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/config/AutomizerReach.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_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 11:47:22,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:47:22,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:47:22,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:47:22,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:47:22,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:47:22,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:47:22,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:47:22,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:47:22,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:47:22,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:47:22,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:47:22,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:47:22,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:47:22,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:47:22,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:47:22,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:47:22,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:47:22,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:47:22,797 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:47:22,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:47:22,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:47:22,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:47:22,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:47:22,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:47:22,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:47:22,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:47:22,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:47:22,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:47:22,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:47:22,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:47:22,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:47:22,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:47:22,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:47:22,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:47:22,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:47:22,807 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:47:22,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:47:22,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:47:22,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:47:22,817 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:47:22,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:47:22,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:47:22,818 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:47:22,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:47:22,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:47:22,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:47:22,819 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:47:22,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:47:22,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:47:22,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:47:22,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:47:22,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:47:22,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:47:22,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:47:22,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2018-11-28 11:47:22,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:47:22,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:47:22,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:47:22,854 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:47:22,854 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:47:22,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:47:22,892 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/data/dad87dd3a/190ca56be1e44f069472e242454babbd/FLAG2196dff14 [2018-11-28 11:47:23,315 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:47:23,316 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:47:23,322 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/data/dad87dd3a/190ca56be1e44f069472e242454babbd/FLAG2196dff14 [2018-11-28 11:47:23,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/data/dad87dd3a/190ca56be1e44f069472e242454babbd [2018-11-28 11:47:23,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:47:23,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:47:23,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:47:23,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:47:23,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:47:23,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da43f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23, skipping insertion in model container [2018-11-28 11:47:23,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:47:23,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:47:23,551 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:47:23,600 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:47:23,629 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:47:23,662 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:47:23,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23 WrapperNode [2018-11-28 11:47:23,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:47:23,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:47:23,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:47:23,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:47:23,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:47:23,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:47:23,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:47:23,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:47:23,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... [2018-11-28 11:47:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:47:23,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:47:23,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:47:23,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:47:23,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:47:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:47:23,756 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:47:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:47:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:47:23,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:47:23,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:47:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-28 11:47:23,758 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-28 11:47:23,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:47:23,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:47:24,056 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:47:24,056 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 11:47:24,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:24 BoogieIcfgContainer [2018-11-28 11:47:24,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:47:24,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:47:24,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:47:24,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:47:24,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:47:23" (1/3) ... [2018-11-28 11:47:24,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d2a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:47:24, skipping insertion in model container [2018-11-28 11:47:24,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:23" (2/3) ... [2018-11-28 11:47:24,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d2a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:47:24, skipping insertion in model container [2018-11-28 11:47:24,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:24" (3/3) ... [2018-11-28 11:47:24,062 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:47:24,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:47:24,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:47:24,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:47:24,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:47:24,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:47:24,103 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:47:24,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:47:24,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:47:24,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:47:24,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:47:24,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:47:24,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:47:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-28 11:47:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:47:24,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:47:24,121 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1289389462, now seen corresponding path program 1 times [2018-11-28 11:47:24,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:24,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:47:24,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:47:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:47:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:47:24,225 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-28 11:47:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:24,238 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-28 11:47:24,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:47:24,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-28 11:47:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:24,245 INFO L225 Difference]: With dead ends: 62 [2018-11-28 11:47:24,245 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 11:47:24,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:47:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 11:47:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 11:47:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 11:47:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-28 11:47:24,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2018-11-28 11:47:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:24,271 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-28 11:47:24,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:47:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-28 11:47:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:47:24,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:47:24,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash -350572860, now seen corresponding path program 1 times [2018-11-28 11:47:24,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:47:24,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:47:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:47:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:47:24,355 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 5 states. [2018-11-28 11:47:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:24,395 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-28 11:47:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:47:24,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 11:47:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:24,396 INFO L225 Difference]: With dead ends: 56 [2018-11-28 11:47:24,396 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 11:47:24,397 INFO L631 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-28 11:47:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 11:47:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-28 11:47:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 11:47:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-11-28 11:47:24,400 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2018-11-28 11:47:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:24,400 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-28 11:47:24,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:47:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-28 11:47:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:47:24,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,401 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, 1, 1, 1, 1, 1] [2018-11-28 11:47:24,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2015546292, now seen corresponding path program 1 times [2018-11-28 11:47:24,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:24,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:24,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:24,450 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-11-28 11:47:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:24,472 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2018-11-28 11:47:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:24,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:47:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:24,473 INFO L225 Difference]: With dead ends: 63 [2018-11-28 11:47:24,473 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 11:47:24,474 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-11-28 11:47:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 11:47:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 11:47:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 11:47:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-28 11:47:24,477 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 27 [2018-11-28 11:47:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:24,477 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-28 11:47:24,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-28 11:47:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:47:24,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,478 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, 1, 1, 1, 1, 1] [2018-11-28 11:47:24,478 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1268303754, now seen corresponding path program 1 times [2018-11-28 11:47:24,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:47:24,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:47:24,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:47:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:47:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:47:24,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:47:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:47:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:47:24,626 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 6 states. [2018-11-28 11:47:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:24,676 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2018-11-28 11:47:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:47:24,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 11:47:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:24,677 INFO L225 Difference]: With dead ends: 63 [2018-11-28 11:47:24,677 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 11:47:24,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:47:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 11:47:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-11-28 11:47:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 11:47:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-11-28 11:47:24,681 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 27 [2018-11-28 11:47:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:24,682 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-28 11:47:24,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:47:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-11-28 11:47:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:47:24,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,682 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 11:47:24,683 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1308831546, now seen corresponding path program 1 times [2018-11-28 11:47:24,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:47:24,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:47:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:47:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:47:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 11:47:24,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:47:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:47:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:47:24,827 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2018-11-28 11:47:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:24,873 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2018-11-28 11:47:24,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:47:24,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-28 11:47:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:24,874 INFO L225 Difference]: With dead ends: 70 [2018-11-28 11:47:24,874 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 11:47:24,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:47:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 11:47:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-11-28 11:47:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 11:47:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-28 11:47:24,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 34 [2018-11-28 11:47:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:24,878 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-28 11:47:24,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:47:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-28 11:47:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:47:24,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:24,879 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 11:47:24,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:24,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1450388490, now seen corresponding path program 2 times [2018-11-28 11:47:24,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:24,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:47:24,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/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-28 11:47:24,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:47:25,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:47:25,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:47:25,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:47:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:25,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:47:25,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 11:47:25,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:47:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:47:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:47:25,055 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 8 states. [2018-11-28 11:47:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:25,100 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2018-11-28 11:47:25,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:47:25,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-28 11:47:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:25,102 INFO L225 Difference]: With dead ends: 77 [2018-11-28 11:47:25,102 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 11:47:25,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:47:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 11:47:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-28 11:47:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 11:47:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-11-28 11:47:25,109 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 41 [2018-11-28 11:47:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:25,109 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-11-28 11:47:25,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:47:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-28 11:47:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:47:25,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:25,111 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 11:47:25,111 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:25,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2080351162, now seen corresponding path program 3 times [2018-11-28 11:47:25,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:25,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:47:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:47:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:47:25,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/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-28 11:47:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:47:27,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:47:27,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:47:27,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:47:27,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:47:27,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:47:27,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:47:27,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 11:47:27,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:47:27,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 11:47:27,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:47:27,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2018-11-28 11:47:27,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-28 11:47:27,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2018-11-28 11:47:27,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-11-28 11:47:27,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-28 11:47:27,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:47:27,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-11-28 11:47:27,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,317 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2018-11-28 11:47:27,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 11:47:27,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-28 11:47:27,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:47:27,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2018-11-28 11:47:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:47:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:47:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-11-28 11:47:27,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:47:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:47:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:47:27,494 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 20 states. [2018-11-28 11:47:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:28,301 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2018-11-28 11:47:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:47:28,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-11-28 11:47:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:28,302 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:47:28,302 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 11:47:28,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 11:47:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 11:47:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-28 11:47:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:47:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-28 11:47:28,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 48 [2018-11-28 11:47:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:28,309 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-28 11:47:28,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:47:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-28 11:47:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:47:28,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:28,310 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 11:47:28,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:28,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -16533492, now seen corresponding path program 1 times [2018-11-28 11:47:28,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:28,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:28,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:47:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:47:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:47:28,408 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:47:28,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:47:28 BoogieIcfgContainer [2018-11-28 11:47:28,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:47:28,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:47:28,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:47:28,446 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:47:28,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:24" (3/4) ... [2018-11-28 11:47:28,448 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:47:28,495 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8092d572-63d7-4930-a405-17ead5a28ecf/bin-2019/uautomizer/witness.graphml [2018-11-28 11:47:28,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:47:28,496 INFO L168 Benchmark]: Toolchain (without parser) took 5160.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -76.5 MB). Peak memory consumption was 121.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,497 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:47:28,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:47:28,498 INFO L168 Benchmark]: Boogie Preprocessor took 27.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,499 INFO L168 Benchmark]: RCFGBuilder took 340.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,500 INFO L168 Benchmark]: TraceAbstraction took 4388.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,500 INFO L168 Benchmark]: Witness Printer took 49.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:47:28,502 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 340.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4388.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] 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))={47:0}, new_head={47:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L585] return head; VAL [\old(len)=5, \result={54:0}, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={54:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={54:0}, head->next={69:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={54: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 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={54: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={54:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 4.3s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 253 SDtfs, 345 SDslu, 832 SDs, 0 SdLazy, 664 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 422 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 43666 SizeOfPredicates, 21 NumberOfNonLiveVariables, 684 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 40/161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...