./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba5476636e8902440a35b69190524704fd5af5c4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba5476636e8902440a35b69190524704fd5af5c4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:09:57,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:09:57,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:09:57,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:09:57,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:09:57,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:09:57,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:09:57,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:09:57,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:09:57,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:09:57,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:09:57,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:09:57,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:09:57,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:09:57,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:09:57,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:09:57,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:09:57,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:09:57,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:09:57,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:09:57,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:09:57,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:09:57,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:09:57,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:09:57,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:09:57,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:09:57,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:09:57,581 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:09:57,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:09:57,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:09:57,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:09:57,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:09:57,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:09:57,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:09:57,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:09:57,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:09:57,585 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 07:09:57,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:09:57,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:09:57,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:09:57,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:09:57,593 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:09:57,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:09:57,593 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:09:57,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:09:57,594 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:09:57,594 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:09:57,594 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:09:57,594 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:09:57,594 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:09:57,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 07:09:57,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:09:57,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:09:57,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:09:57,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:09:57,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:09:57,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:09:57,597 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_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ba5476636e8902440a35b69190524704fd5af5c4 [2018-12-03 07:09:57,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:09:57,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:09:57,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:09:57,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:09:57,624 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:09:57,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:09:57,660 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/8abaeec1c/0bc3066c67b240db96dc2a9bc745805c/FLAGe0524bac8 [2018-12-03 07:09:58,148 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:09:58,148 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:09:58,157 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/8abaeec1c/0bc3066c67b240db96dc2a9bc745805c/FLAGe0524bac8 [2018-12-03 07:09:58,644 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/8abaeec1c/0bc3066c67b240db96dc2a9bc745805c [2018-12-03 07:09:58,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:09:58,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:09:58,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:09:58,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:09:58,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:09:58,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:09:58" (1/1) ... [2018-12-03 07:09:58,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bd7056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:58, skipping insertion in model container [2018-12-03 07:09:58,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:09:58" (1/1) ... [2018-12-03 07:09:58,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:09:58,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:09:58,925 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:09:58,934 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:09:58,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:09:59,007 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:09:59,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59 WrapperNode [2018-12-03 07:09:59,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:09:59,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:09:59,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:09:59,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:09:59,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:09:59,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:09:59,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:09:59,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:09:59,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... [2018-12-03 07:09:59,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:09:59,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:09:59,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:09:59,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:09:59,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:09:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:09:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-03 07:09:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-03 07:09:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-03 07:09:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-03 07:09:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 07:09:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 07:09:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:09:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:09:59,243 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:09:59,243 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 07:09:59,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:09:59 BoogieIcfgContainer [2018-12-03 07:09:59,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:09:59,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:09:59,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:09:59,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:09:59,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:09:58" (1/3) ... [2018-12-03 07:09:59,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1060335d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:09:59, skipping insertion in model container [2018-12-03 07:09:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:09:59" (2/3) ... [2018-12-03 07:09:59,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1060335d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:09:59, skipping insertion in model container [2018-12-03 07:09:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:09:59" (3/3) ... [2018-12-03 07:09:59,250 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:09:59,259 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:09:59,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-03 07:09:59,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-03 07:09:59,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:09:59,295 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 07:09:59,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:09:59,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:09:59,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:09:59,295 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:09:59,295 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:09:59,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:09:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-03 07:09:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 07:09:59,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:59,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:59,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:09:59,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133031, now seen corresponding path program 1 times [2018-12-03 07:09:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:59,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:09:59,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:09:59,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:09:59,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:59,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:09:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:09:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:09:59,513 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 7 states. [2018-12-03 07:09:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:09:59,690 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 07:09:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:09:59,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 07:09:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:09:59,698 INFO L225 Difference]: With dead ends: 67 [2018-12-03 07:09:59,698 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 07:09:59,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:09:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 07:09:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 07:09:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 07:09:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-03 07:09:59,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-03 07:09:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:09:59,727 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-03 07:09:59,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:09:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-03 07:09:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 07:09:59,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:09:59,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:09:59,729 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:09:59,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:09:59,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133030, now seen corresponding path program 1 times [2018-12-03 07:09:59,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:09:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:09:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:09:59,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:09:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:09:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:09:59,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:09:59,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:09:59,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:09:59,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:09:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:09:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:09:59,841 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2018-12-03 07:10:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:00,026 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-03 07:10:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:10:00,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-03 07:10:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:00,027 INFO L225 Difference]: With dead ends: 60 [2018-12-03 07:10:00,027 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 07:10:00,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:10:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 07:10:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 07:10:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:10:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-03 07:10:00,034 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2018-12-03 07:10:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:00,034 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-03 07:10:00,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:10:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-03 07:10:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:10:00,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:00,035 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-12-03 07:10:00,035 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:00,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash -212703262, now seen corresponding path program 1 times [2018-12-03 07:10:00,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:00,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:00,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:10:00,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:00,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:10:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:10:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:10:00,097 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 8 states. [2018-12-03 07:10:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:00,214 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-03 07:10:00,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:10:00,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-03 07:10:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:00,215 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:10:00,215 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:10:00,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:10:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:10:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-12-03 07:10:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 07:10:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-03 07:10:00,220 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2018-12-03 07:10:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:00,220 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-03 07:10:00,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:10:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-03 07:10:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:10:00,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:00,221 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-12-03 07:10:00,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:00,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:00,221 INFO L82 PathProgramCache]: Analyzing trace with hash -212703261, now seen corresponding path program 1 times [2018-12-03 07:10:00,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:00,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:00,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:10:00,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:00,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:10:00,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:10:00,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:10:00,379 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 11 states. [2018-12-03 07:10:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:00,781 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 07:10:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:10:00,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 07:10:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:00,783 INFO L225 Difference]: With dead ends: 71 [2018-12-03 07:10:00,783 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 07:10:00,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 07:10:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 07:10:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-12-03 07:10:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 07:10:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-03 07:10:00,788 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2018-12-03 07:10:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:00,788 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-03 07:10:00,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:10:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-03 07:10:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:10:00,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:00,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:00,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:00,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash 594701227, now seen corresponding path program 1 times [2018-12-03 07:10:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:00,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:00,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:10:00,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:00,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:10:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:10:00,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:10:00,819 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-03 07:10:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:00,828 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-03 07:10:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:10:00,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 07:10:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:00,829 INFO L225 Difference]: With dead ends: 58 [2018-12-03 07:10:00,829 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 07:10:00,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:10:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 07:10:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 07:10:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 07:10:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 07:10:00,831 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2018-12-03 07:10:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:00,831 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 07:10:00,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:10:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 07:10:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:10:00,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:00,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:00,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:00,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash 398187722, now seen corresponding path program 1 times [2018-12-03 07:10:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:00,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:00,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:10:00,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:00,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:10:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:10:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:10:00,854 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2018-12-03 07:10:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:00,933 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-03 07:10:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:10:00,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-03 07:10:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:00,934 INFO L225 Difference]: With dead ends: 56 [2018-12-03 07:10:00,934 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 07:10:00,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:10:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 07:10:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 07:10:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 07:10:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 07:10:00,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 19 [2018-12-03 07:10:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 07:10:00,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:10:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 07:10:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:10:00,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:00,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:00,938 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:00,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash 398187723, now seen corresponding path program 1 times [2018-12-03 07:10:00,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:00,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:00,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:10:00,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:00,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:10:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:10:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:10:00,979 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2018-12-03 07:10:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,113 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 07:10:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:10:01,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-03 07:10:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,114 INFO L225 Difference]: With dead ends: 80 [2018-12-03 07:10:01,114 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 07:10:01,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:10:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 07:10:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-12-03 07:10:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 07:10:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-03 07:10:01,117 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-12-03 07:10:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,117 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-03 07:10:01,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:10:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-03 07:10:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:10:01,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,118 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] [2018-12-03 07:10:01,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133472, now seen corresponding path program 1 times [2018-12-03 07:10:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:10:01,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:10:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:10:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:10:01,160 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 9 states. [2018-12-03 07:10:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,252 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-12-03 07:10:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:10:01,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-03 07:10:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,252 INFO L225 Difference]: With dead ends: 64 [2018-12-03 07:10:01,253 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 07:10:01,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:10:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 07:10:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 07:10:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:10:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-03 07:10:01,255 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2018-12-03 07:10:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,256 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-03 07:10:01,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:10:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-03 07:10:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:10:01,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,256 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] [2018-12-03 07:10:01,257 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133473, now seen corresponding path program 1 times [2018-12-03 07:10:01,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:10:01,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:10:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:10:01,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:10:01,352 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 10 states. [2018-12-03 07:10:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,470 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2018-12-03 07:10:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:10:01,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-03 07:10:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,471 INFO L225 Difference]: With dead ends: 62 [2018-12-03 07:10:01,471 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:10:01,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:10:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:10:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-12-03 07:10:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:10:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 07:10:01,474 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2018-12-03 07:10:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,474 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 07:10:01,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:10:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 07:10:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:10:01,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,475 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] [2018-12-03 07:10:01,475 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2125216191, now seen corresponding path program 1 times [2018-12-03 07:10:01,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:10:01,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:10:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:10:01,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:10:01,500 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2018-12-03 07:10:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,504 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-12-03 07:10:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:10:01,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-03 07:10:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,505 INFO L225 Difference]: With dead ends: 48 [2018-12-03 07:10:01,505 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 07:10:01,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:10:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 07:10:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 07:10:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 07:10:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2018-12-03 07:10:01,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2018-12-03 07:10:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,507 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2018-12-03 07:10:01,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:10:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2018-12-03 07:10:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:10:01,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,507 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] [2018-12-03 07:10:01,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114557, now seen corresponding path program 1 times [2018-12-03 07:10:01,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:10:01,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:10:01,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:10:01,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:10:01,531 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 5 states. [2018-12-03 07:10:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,559 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-03 07:10:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:10:01,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 07:10:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,559 INFO L225 Difference]: With dead ends: 43 [2018-12-03 07:10:01,560 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 07:10:01,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-03 07:10:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 07:10:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 07:10:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 07:10:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-03 07:10:01,561 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2018-12-03 07:10:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,561 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-03 07:10:01,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:10:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-03 07:10:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:10:01,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,562 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] [2018-12-03 07:10:01,562 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114556, now seen corresponding path program 1 times [2018-12-03 07:10:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:10:01,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:10:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:10:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:10:01,670 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 10 states. [2018-12-03 07:10:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:01,786 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-03 07:10:01,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:10:01,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-03 07:10:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:01,786 INFO L225 Difference]: With dead ends: 42 [2018-12-03 07:10:01,786 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 07:10:01,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:10:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 07:10:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 07:10:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 07:10:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-03 07:10:01,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2018-12-03 07:10:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:01,788 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-03 07:10:01,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:10:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-03 07:10:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:10:01,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:01,789 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, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:01,789 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:01,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash 175945834, now seen corresponding path program 1 times [2018-12-03 07:10:01,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:01,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:01,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:01,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 07:10:01,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:01,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 07:10:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 07:10:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:10:01,948 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 15 states. [2018-12-03 07:10:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:02,227 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2018-12-03 07:10:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 07:10:02,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-12-03 07:10:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:02,228 INFO L225 Difference]: With dead ends: 41 [2018-12-03 07:10:02,228 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 07:10:02,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:10:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 07:10:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 07:10:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 07:10:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2018-12-03 07:10:02,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 33 [2018-12-03 07:10:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:02,230 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2018-12-03 07:10:02,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 07:10:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-12-03 07:10:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 07:10:02,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:02,231 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:02,231 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:02,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1159353522, now seen corresponding path program 1 times [2018-12-03 07:10:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:02,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:02,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 07:10:02,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:10:02,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 07:10:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 07:10:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:10:02,396 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 16 states. [2018-12-03 07:10:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:02,664 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-03 07:10:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:10:02,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-12-03 07:10:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:02,664 INFO L225 Difference]: With dead ends: 40 [2018-12-03 07:10:02,665 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 07:10:02,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:10:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 07:10:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 07:10:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:10:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 39 transitions. [2018-12-03 07:10:02,666 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 39 transitions. Word has length 34 [2018-12-03 07:10:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:02,667 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 39 transitions. [2018-12-03 07:10:02,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 07:10:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 39 transitions. [2018-12-03 07:10:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:10:02,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:02,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:02,668 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION]=== [2018-12-03 07:10:02,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1613541487, now seen corresponding path program 1 times [2018-12-03 07:10:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:10:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:02,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:10:02,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:10:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:10:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:10:02,701 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:10:02,710 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-03 07:10:02,716 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:10:02,717 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:10:02,717 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:10:02,717 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:10:02,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:10:02 BoogieIcfgContainer [2018-12-03 07:10:02,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:10:02,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:10:02,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:10:02,724 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:10:02,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:09:59" (3/4) ... [2018-12-03 07:10:02,727 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 07:10:02,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:10:02,727 INFO L168 Benchmark]: Toolchain (without parser) took 4081.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -249.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:10:02,728 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:10:02,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:10:02,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.32 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-12-03 07:10:02,729 INFO L168 Benchmark]: Boogie Preprocessor took 15.74 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:10:02,730 INFO L168 Benchmark]: RCFGBuilder took 198.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:10:02,730 INFO L168 Benchmark]: TraceAbstraction took 3479.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:10:02,730 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:10:02,732 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.32 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 15.74 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3479.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1454]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1454. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1434] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [\old(global_list_13)=null, \old(global_list_13)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1455] CALL entry_point() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1449] CALL alloc_13() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1442] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={24:0}, global_list_13={21:0}, ldv_global_msg_list={1:0}, malloc(size)={24:0}, size=12] [L1442] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct A13))={24:0}] [L1442] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L1443] COND TRUE \read(*p) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, p={24:0}] [L1444] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={21:0}, head={21:0}, ldv_global_msg_list={1:0}, new={24:4}] [L1121] EXPR head->next VAL [global_list_13={21:0}, head={21:0}, head={21:0}, head->next={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}] [L1121] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, next={21:0}, prev={21:0}] [L1107] next->prev = new VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1108] new->next = next VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1109] new->prev = prev VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1110] prev->next = new VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1121] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={21:0}, head={21:0}, head={21:0}, head->next={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}] [L1444] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, p={24:0}] [L1449] RET alloc_13() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1451] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}] [L1099] list->next = list VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}, list={21:0}] [L1100] list->prev = list VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}, list={21:0}] [L1451] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1455] RET entry_point() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 57 locations, 15 error locations. UNSAFE Result, 3.4s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 492 SDtfs, 687 SDslu, 1494 SDs, 0 SdLazy, 1894 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=1, 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, 14 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 53276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:10:04,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:10:04,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:10:04,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:10:04,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:10:04,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:10:04,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:10:04,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:10:04,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:10:04,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:10:04,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:10:04,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:10:04,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:10:04,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:10:04,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:10:04,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:10:04,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:10:04,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:10:04,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:10:04,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:10:04,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:10:04,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:10:04,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:10:04,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:10:04,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:10:04,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:10:04,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:10:04,103 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:10:04,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:10:04,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:10:04,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:10:04,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:10:04,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:10:04,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:10:04,105 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:10:04,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:10:04,106 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 07:10:04,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:10:04,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:10:04,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:10:04,114 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:10:04,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:10:04,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 07:10:04,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 07:10:04,115 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:10:04,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:10:04,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:10:04,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:10:04,117 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:10:04,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:10:04,117 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:10:04,117 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ba5476636e8902440a35b69190524704fd5af5c4 [2018-12-03 07:10:04,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:10:04,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:10:04,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:10:04,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:10:04,146 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:10:04,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:10:04,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/a07ade58c/0a2a6a967b1942a78d800ec27441de4a/FLAGe3cc7b235 [2018-12-03 07:10:04,562 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:10:04,562 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:10:04,570 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/a07ade58c/0a2a6a967b1942a78d800ec27441de4a/FLAGe3cc7b235 [2018-12-03 07:10:04,578 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/data/a07ade58c/0a2a6a967b1942a78d800ec27441de4a [2018-12-03 07:10:04,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:10:04,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:10:04,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:10:04,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:10:04,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:10:04,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04, skipping insertion in model container [2018-12-03 07:10:04,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:10:04,612 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:10:04,810 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:10:04,824 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:10:04,893 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:10:04,926 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:10:04,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04 WrapperNode [2018-12-03 07:10:04,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:10:04,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:10:04,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:10:04,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:10:04,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:10:04,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:10:04,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:10:04,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:10:04,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... [2018-12-03 07:10:04,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:10:04,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:10:04,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:10:04,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:10:04,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:10:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:10:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:10:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:10:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:10:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:10:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:10:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 07:10:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 07:10:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 07:10:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:10:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:10:05,198 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:10:05,198 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 07:10:05,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:10:05 BoogieIcfgContainer [2018-12-03 07:10:05,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:10:05,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:10:05,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:10:05,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:10:05,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:10:04" (1/3) ... [2018-12-03 07:10:05,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c7d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:10:05, skipping insertion in model container [2018-12-03 07:10:05,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:10:04" (2/3) ... [2018-12-03 07:10:05,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c7d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:10:05, skipping insertion in model container [2018-12-03 07:10:05,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:10:05" (3/3) ... [2018-12-03 07:10:05,203 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-03 07:10:05,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:10:05,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-03 07:10:05,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-03 07:10:05,235 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:10:05,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:10:05,235 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 07:10:05,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:10:05,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:10:05,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:10:05,236 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:10:05,236 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:10:05,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:10:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-03 07:10:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 07:10:05,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:05,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:05,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:10:05,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133031, now seen corresponding path program 1 times [2018-12-03 07:10:05,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:05,257 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:05,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:05,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:05,387 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 12 treesize of output 15 [2018-12-03 07:10:05,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:05,408 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 07:10:05,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:05,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:05,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 07:10:05,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:10:05,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-03 07:10:05,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:10:05,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:10:05,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:10:05,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-03 07:10:05,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:10:05,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:10:05,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-03 07:10:05,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:10:05,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:05,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-03 07:10:07,665 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-03 07:10:07,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:07,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:07,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-12-03 07:10:07,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:07,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:10:07,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-03 07:10:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:07,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:10:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:10:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:10:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:10:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-03 07:10:07,744 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 9 states. [2018-12-03 07:10:08,864 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-12-03 07:10:10,170 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-12-03 07:10:11,512 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-03 07:10:11,931 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 07:10:14,971 WARN L180 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-12-03 07:10:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:10:17,099 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-03 07:10:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:10:17,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-03 07:10:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:10:17,107 INFO L225 Difference]: With dead ends: 92 [2018-12-03 07:10:17,107 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 07:10:17,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=72, Invalid=141, Unknown=1, NotChecked=26, Total=240 [2018-12-03 07:10:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 07:10:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2018-12-03 07:10:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 07:10:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-03 07:10:17,134 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-03 07:10:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:10:17,134 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-03 07:10:17,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:10:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-03 07:10:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 07:10:17,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:10:17,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:10:17,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:10:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:10:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133030, now seen corresponding path program 1 times [2018-12-03 07:10:17,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:10:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:10:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:10:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:10:17,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:10:17,226 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 12 treesize of output 15 [2018-12-03 07:10:17,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:17,239 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 07:10:17,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:17,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:17,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 07:10:17,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:10:17,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-03 07:10:17,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:10:17,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:10:17,405 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 9 treesize of output 12 [2018-12-03 07:10:17,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 07:10:17,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,415 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:10:17,442 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:110 [2018-12-03 07:10:17,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-03 07:10:17,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:10:17,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-03 07:10:17,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:10:17,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:10:17,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-12-03 07:10:17,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:17,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:17,615 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 27 treesize of output 19 [2018-12-03 07:10:17,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-03 07:10:17,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 07:10:17,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-03 07:10:17,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:10:17,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2018-12-03 07:10:22,885 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 07:10:22,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:22,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:22,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-03 07:10:22,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:22,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-03 07:10:22,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:23,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:23,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:10:23,012 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 32 treesize of output 24 [2018-12-03 07:10:23,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:10:23,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-03 07:10:23,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:10:23,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:10:23,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:65, output treesize:28 [2018-12-03 07:10:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:10:25,164 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:10:25,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:10:25,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:10:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:10:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:10:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=50, Unknown=4, NotChecked=0, Total=72 [2018-12-03 07:10:25,167 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 9 states. [2018-12-03 07:10:37,958 WARN L180 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-03 07:11:27,036 WARN L180 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-03 07:11:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:11:29,046 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-03 07:11:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:11:29,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-03 07:11:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:11:29,048 INFO L225 Difference]: With dead ends: 79 [2018-12-03 07:11:29,048 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 07:11:29,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=71, Invalid=152, Unknown=17, NotChecked=0, Total=240 [2018-12-03 07:11:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 07:11:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-12-03 07:11:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:11:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-03 07:11:29,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2018-12-03 07:11:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:11:29,053 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-03 07:11:29,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:11:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-03 07:11:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:11:29,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:11:29,054 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-12-03 07:11:29,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:11:29,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:11:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -212703262, now seen corresponding path program 1 times [2018-12-03 07:11:29,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:11:29,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:11:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:11:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:11:29,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:11:29,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:11:29,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:11:29,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-12-03 07:11:29,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 07:11:29,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-03 07:11:29,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2018-12-03 07:11:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:11:29,226 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:11:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:11:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:11:29,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:11:29,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:11:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:11:29,228 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-12-03 07:11:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:11:29,756 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-03 07:11:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:11:29,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-03 07:11:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:11:29,757 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:11:29,757 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 07:11:29,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:11:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 07:11:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-12-03 07:11:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 07:11:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-03 07:11:29,761 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2018-12-03 07:11:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:11:29,761 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-03 07:11:29,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:11:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-03 07:11:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:11:29,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:11:29,761 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-12-03 07:11:29,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:11:29,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:11:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash -212703261, now seen corresponding path program 1 times [2018-12-03 07:11:29,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:11:29,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:11:29,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:11:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:11:29,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:11:29,865 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 9 treesize of output 12 [2018-12-03 07:11:29,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 07:11:29,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,897 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 12 treesize of output 15 [2018-12-03 07:11:29,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:29,909 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 07:11:29,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-03 07:11:29,913 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:29,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:29,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:29,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 07:11:29,939 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 07:11:29,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:11:29,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:11:30,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:11:30,002 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:48, output treesize:152 [2018-12-03 07:11:30,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-03 07:11:30,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:30,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-03 07:11:30,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:30,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:30,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:101, output treesize:33 [2018-12-03 07:11:33,963 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 07:11:33,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:33,975 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 55 treesize of output 58 [2018-12-03 07:11:33,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:34,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:34,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:34,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:34,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-12-03 07:11:34,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:34,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:34,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:11:34,168 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 55 treesize of output 47 [2018-12-03 07:11:34,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:34,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2018-12-03 07:11:34,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:11:34,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:11:34,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:111, output treesize:74 [2018-12-03 07:11:35,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 07:11:35,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 07:11:35,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:35,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:35,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 07:11:35,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-03 07:11:35,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:11:35,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:35,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:11:35,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:9 [2018-12-03 07:11:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:11:36,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:11:36,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:11:36,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:11:36,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:11:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:11:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2018-12-03 07:11:36,033 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 11 states. [2018-12-03 07:11:50,509 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-03 07:12:02,741 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-03 07:12:10,769 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-12-03 07:12:14,264 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-12-03 07:12:28,486 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-12-03 07:12:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:33,325 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 07:12:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:12:33,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 07:12:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:33,327 INFO L225 Difference]: With dead ends: 71 [2018-12-03 07:12:33,327 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 07:12:33,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=78, Invalid=249, Unknown=15, NotChecked=0, Total=342 [2018-12-03 07:12:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 07:12:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-12-03 07:12:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 07:12:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-03 07:12:33,332 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2018-12-03 07:12:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:33,332 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-03 07:12:33,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:12:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-03 07:12:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:12:33,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:33,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:33,333 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:33,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash 594701227, now seen corresponding path program 1 times [2018-12-03 07:12:33,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:33,333 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:33,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:33,381 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:33,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:33,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:12:33,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:12:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:12:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:12:33,382 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-03 07:12:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:33,394 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-03 07:12:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:12:33,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 07:12:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:33,394 INFO L225 Difference]: With dead ends: 58 [2018-12-03 07:12:33,394 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 07:12:33,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:12:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 07:12:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 07:12:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 07:12:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 07:12:33,397 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2018-12-03 07:12:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:33,397 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 07:12:33,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:12:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 07:12:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:12:33,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:33,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:33,398 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:33,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 398187722, now seen corresponding path program 1 times [2018-12-03 07:12:33,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:33,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:33,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:33,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:33,451 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 12 treesize of output 15 [2018-12-03 07:12:33,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:33,461 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-03 07:12:33,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-03 07:12:33,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:33,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:33,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-03 07:12:33,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:12:33,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:12:33,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:12:33,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 07:12:33,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-03 07:12:33,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:12:33,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:12:33,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-03 07:12:33,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:12:33,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:33,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-03 07:12:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:33,621 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:33,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:33,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:12:33,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:12:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:12:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:12:33,624 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-12-03 07:12:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:42,008 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 07:12:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:12:42,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-03 07:12:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:42,009 INFO L225 Difference]: With dead ends: 66 [2018-12-03 07:12:42,009 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 07:12:42,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:12:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 07:12:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-03 07:12:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 07:12:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-03 07:12:42,012 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 19 [2018-12-03 07:12:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:42,012 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-03 07:12:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:12:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-03 07:12:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 07:12:42,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:42,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:42,013 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:42,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:42,013 INFO L82 PathProgramCache]: Analyzing trace with hash 398187723, now seen corresponding path program 1 times [2018-12-03 07:12:42,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:42,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:42,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:42,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:42,070 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 9 treesize of output 12 [2018-12-03 07:12:42,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 07:12:42,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:12:42,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-12-03 07:12:42,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:12:42,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:12:42,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-03 07:12:42,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:12:42,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-03 07:12:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:42,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:42,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:42,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:12:42,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:12:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:12:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:12:42,164 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 7 states. [2018-12-03 07:12:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:42,678 INFO L93 Difference]: Finished difference Result 86 states and 85 transitions. [2018-12-03 07:12:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:12:42,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-03 07:12:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:42,680 INFO L225 Difference]: With dead ends: 86 [2018-12-03 07:12:42,680 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 07:12:42,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:12:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 07:12:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-12-03 07:12:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 07:12:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-03 07:12:42,683 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-12-03 07:12:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:42,684 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-03 07:12:42,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:12:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-03 07:12:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:12:42,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:42,685 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] [2018-12-03 07:12:42,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:42,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133472, now seen corresponding path program 1 times [2018-12-03 07:12:42,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:42,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:42,766 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-12-03 07:12:42,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:42,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:12:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:42,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:42,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:42,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:12:42,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:12:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:12:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:12:42,818 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 9 states. [2018-12-03 07:12:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:43,156 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-12-03 07:12:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:12:43,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-03 07:12:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:43,157 INFO L225 Difference]: With dead ends: 64 [2018-12-03 07:12:43,157 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 07:12:43,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:12:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 07:12:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 07:12:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:12:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-03 07:12:43,159 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2018-12-03 07:12:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:43,160 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-03 07:12:43,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:12:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-03 07:12:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:12:43,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:43,160 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] [2018-12-03 07:12:43,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133473, now seen corresponding path program 1 times [2018-12-03 07:12:43,160 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:43,160 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:43,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:43,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:43,256 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-12-03 07:12:43,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:43,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:43,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:12:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:43,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:43,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:43,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:12:43,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:12:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:12:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:12:43,346 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 10 states. [2018-12-03 07:12:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:43,773 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2018-12-03 07:12:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:12:43,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-03 07:12:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:43,774 INFO L225 Difference]: With dead ends: 62 [2018-12-03 07:12:43,774 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:12:43,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:12:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:12:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-12-03 07:12:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:12:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 07:12:43,776 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2018-12-03 07:12:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:43,776 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 07:12:43,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:12:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 07:12:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:12:43,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:43,777 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] [2018-12-03 07:12:43,777 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:43,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2125216191, now seen corresponding path program 1 times [2018-12-03 07:12:43,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:43,777 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:43,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:43,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:43,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:43,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:43,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:12:43,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:12:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:12:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:12:43,882 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2018-12-03 07:12:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:43,888 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-12-03 07:12:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:12:43,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-03 07:12:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:43,888 INFO L225 Difference]: With dead ends: 48 [2018-12-03 07:12:43,888 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 07:12:43,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:12:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 07:12:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 07:12:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 07:12:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2018-12-03 07:12:43,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2018-12-03 07:12:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:43,890 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2018-12-03 07:12:43,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:12:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2018-12-03 07:12:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:12:43,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:43,890 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] [2018-12-03 07:12:43,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:43,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114557, now seen corresponding path program 1 times [2018-12-03 07:12:43,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:43,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:43,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:43,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:12:43,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:12:43,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:43,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:43,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:43,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-03 07:12:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:44,000 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:44,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:44,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:12:44,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:12:44,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:12:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:12:44,002 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2018-12-03 07:12:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:49,042 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-03 07:12:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:12:49,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-03 07:12:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:49,043 INFO L225 Difference]: With dead ends: 43 [2018-12-03 07:12:49,043 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 07:12:49,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:12:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 07:12:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 07:12:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 07:12:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-03 07:12:49,046 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2018-12-03 07:12:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:49,046 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-03 07:12:49,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:12:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-03 07:12:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:12:49,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:49,047 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] [2018-12-03 07:12:49,047 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:49,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114556, now seen corresponding path program 1 times [2018-12-03 07:12:49,047 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:49,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:49,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 07:12:49,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 07:12:49,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 07:12:49,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-03 07:12:49,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:10 [2018-12-03 07:12:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:49,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:49,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:12:49,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:12:49,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:12:49,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:12:49,289 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 9 states. [2018-12-03 07:12:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:49,780 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-03 07:12:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:12:49,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 07:12:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:49,781 INFO L225 Difference]: With dead ends: 42 [2018-12-03 07:12:49,781 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 07:12:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:12:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 07:12:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 07:12:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 07:12:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-03 07:12:49,783 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2018-12-03 07:12:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:49,783 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-03 07:12:49,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:12:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-03 07:12:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:12:49,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:49,784 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, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:49,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:49,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash 175945834, now seen corresponding path program 1 times [2018-12-03 07:12:49,784 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:49,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:12:49,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:12:49,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:12:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 07:12:49,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-03 07:12:49,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:49,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-03 07:12:49,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:49,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-03 07:12:50,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-03 07:12:50,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:12:50,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-03 07:12:50,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:50,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:50,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-03 07:12:50,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-03 07:12:50,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:12:50,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:50,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:12:50,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:11 [2018-12-03 07:12:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:12:50,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:12:50,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:12:50,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 07:12:50,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 07:12:50,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 07:12:50,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:12:50,270 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 14 states. [2018-12-03 07:12:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:12:51,608 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-03 07:12:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:12:51,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-03 07:12:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:12:51,610 INFO L225 Difference]: With dead ends: 40 [2018-12-03 07:12:51,610 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 07:12:51,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:12:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 07:12:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 07:12:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:12:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 39 transitions. [2018-12-03 07:12:51,611 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 39 transitions. Word has length 33 [2018-12-03 07:12:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:12:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 39 transitions. [2018-12-03 07:12:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 07:12:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 39 transitions. [2018-12-03 07:12:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:12:51,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:12:51,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:12:51,612 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION]=== [2018-12-03 07:12:51,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:12:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1613541487, now seen corresponding path program 1 times [2018-12-03 07:12:51,613 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:12:51,613 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1da1c95f-bf1e-4738-bf09-60c9c1828e4b/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:12:51,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:12:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:12:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:12:51,991 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:12:52,004 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-03 07:12:52,011 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:12:52,012 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:12:52,012 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:12:52,012 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 07:12:52,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:12:52 BoogieIcfgContainer [2018-12-03 07:12:52,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:12:52,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:12:52,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:12:52,019 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:12:52,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:10:05" (3/4) ... [2018-12-03 07:12:52,022 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 07:12:52,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:12:52,023 INFO L168 Benchmark]: Toolchain (without parser) took 167442.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 938.0 MB in the beginning and 944.5 MB in the end (delta: -6.5 MB). Peak memory consumption was 226.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:52,023 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:52,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:52,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:52,023 INFO L168 Benchmark]: Boogie Preprocessor took 16.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:52,023 INFO L168 Benchmark]: RCFGBuilder took 233.64 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:52,024 INFO L168 Benchmark]: TraceAbstraction took 166819.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 138.5 MB). Peak memory consumption was 229.2 MB. Max. memory is 11.5 GB. [2018-12-03 07:12:52,024 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.3 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:12:52,024 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 233.64 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 166819.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 138.5 MB). Peak memory consumption was 229.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.3 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1454]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1454. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1434] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [\old(global_list_13)=null, \old(global_list_13)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1455] CALL entry_point() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1449] CALL alloc_13() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1442] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={536870900:0}, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, malloc(size)={536870900:0}, size=12] [L1442] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, ldv_malloc(sizeof(struct A13))={536870900:0}] [L1442] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L1443] COND TRUE \read(*p) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, p={536870900:0}] [L1444] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={-536870909:0}, head={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}] [L1121] EXPR head->next VAL [global_list_13={-536870909:0}, head={-536870909:0}, head={-536870909:0}, head->next={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}] [L1121] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, next={-536870909:0}, prev={-536870909:0}] [L1107] next->prev = new VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1108] new->next = next VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1109] new->prev = prev VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1110] prev->next = new VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1121] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={-536870909:0}, head={-536870909:0}, head={-536870909:0}, head->next={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}] [L1444] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, p={536870900:0}] [L1449] RET alloc_13() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1451] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}] [L1099] list->next = list VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}, list={-536870909:0}] [L1100] list->prev = list VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}, list={-536870909:0}] [L1451] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1455] RET entry_point() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 57 locations, 15 error locations. UNSAFE Result, 166.7s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 147.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 493 SDtfs, 688 SDslu, 1530 SDs, 0 SdLazy, 1821 SolverSat, 312 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 101.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 161 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 60.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, 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, 13 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 260 ConstructedInterpolants, 17 QuantifiedInterpolants, 73260 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1673 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...