./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.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_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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 45292d949331e02d780a7679ac12098a89a953bb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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 45292d949331e02d780a7679ac12098a89a953bb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-09 05:41:14,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:41:14,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:41:14,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:41:14,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:41:14,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:41:14,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:41:14,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:41:14,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:41:14,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:41:14,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:41:14,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:41:14,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:41:14,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:41:14,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:41:14,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:41:14,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:41:14,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:41:14,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:41:14,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:41:14,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:41:14,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:41:14,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:41:14,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:41:14,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:41:14,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:41:14,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:41:14,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:41:14,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:41:14,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:41:14,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:41:14,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:41:14,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:41:14,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:41:14,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:41:14,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:41:14,570 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 05:41:14,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:41:14,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:41:14,581 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:41:14,581 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:41:14,582 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:41:14,582 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:41:14,583 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:41:14,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:41:14,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:41:14,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:41:14,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 05:41:14,584 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:41:14,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:41:14,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:41:14,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:41:14,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:41:14,586 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:41:14,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:41:14,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:41:14,586 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_a3abb0a9-f982-461b-a87e-7632e9d600b2/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 -> 45292d949331e02d780a7679ac12098a89a953bb [2018-12-09 05:41:14,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:41:14,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:41:14,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:41:14,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:41:14,619 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:41:14,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:14,664 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/5df3a05b4/3d2b2b64aa454d119d978a230058cdf0/FLAG7373eaa5c [2018-12-09 05:41:15,080 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:41:15,081 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:15,087 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/5df3a05b4/3d2b2b64aa454d119d978a230058cdf0/FLAG7373eaa5c [2018-12-09 05:41:15,096 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/5df3a05b4/3d2b2b64aa454d119d978a230058cdf0 [2018-12-09 05:41:15,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:41:15,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:41:15,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:15,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:41:15,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:41:15,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15, skipping insertion in model container [2018-12-09 05:41:15,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:41:15,134 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:41:15,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:15,323 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:41:15,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:15,378 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:41:15,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15 WrapperNode [2018-12-09 05:41:15,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:15,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:15,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:41:15,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:41:15,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:15,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:41:15,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:41:15,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:41:15,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... [2018-12-09 05:41:15,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:41:15,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:41:15,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:41:15,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:41:15,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 05:41:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 05:41:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:41:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 05:41:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:41:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:41:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:41:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:41:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:41:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 05:41:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:41:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:41:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:41:15,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:41:15,646 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 05:41:15,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:15 BoogieIcfgContainer [2018-12-09 05:41:15,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:41:15,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:41:15,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:41:15,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:41:15,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:41:15" (1/3) ... [2018-12-09 05:41:15,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:15, skipping insertion in model container [2018-12-09 05:41:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:15" (2/3) ... [2018-12-09 05:41:15,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:15, skipping insertion in model container [2018-12-09 05:41:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:15" (3/3) ... [2018-12-09 05:41:15,650 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:15,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:41:15,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-12-09 05:41:15,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2018-12-09 05:41:15,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:41:15,684 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 05:41:15,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:41:15,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:41:15,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:41:15,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:41:15,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:41:15,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:41:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-12-09 05:41:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 05:41:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:15,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:15,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:15,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1319059633, now seen corresponding path program 1 times [2018-12-09 05:41:15,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:15,775 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-09 05:41:15,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 05:41:15,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:15,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 05:41:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 05:41:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:41:15,789 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-12-09 05:41:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:15,801 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-12-09 05:41:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 05:41:15,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-09 05:41:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:15,807 INFO L225 Difference]: With dead ends: 72 [2018-12-09 05:41:15,807 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 05:41:15,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:41:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 05:41:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 05:41:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 05:41:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-12-09 05:41:15,829 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 11 [2018-12-09 05:41:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:15,830 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-12-09 05:41:15,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 05:41:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-12-09 05:41:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 05:41:15,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:15,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:15,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:15,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1319085259, now seen corresponding path program 1 times [2018-12-09 05:41:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:15,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:15,866 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-09 05:41:15,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:15,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:15,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:15,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:41:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:41:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:41:15,867 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 4 states. [2018-12-09 05:41:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:15,952 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-12-09 05:41:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:41:15,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 05:41:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:15,953 INFO L225 Difference]: With dead ends: 70 [2018-12-09 05:41:15,953 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 05:41:15,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:41:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 05:41:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-09 05:41:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 05:41:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-12-09 05:41:15,957 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 11 [2018-12-09 05:41:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:15,957 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-12-09 05:41:15,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:41:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-12-09 05:41:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 05:41:15,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:15,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:15,958 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:15,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1319085258, now seen corresponding path program 1 times [2018-12-09 05:41:15,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:15,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:15,991 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-09 05:41:15,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:15,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:15,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:41:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:41:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:41:15,992 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2018-12-09 05:41:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,075 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-12-09 05:41:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:41:16,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 05:41:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,076 INFO L225 Difference]: With dead ends: 88 [2018-12-09 05:41:16,076 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 05:41:16,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:41:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 05:41:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-12-09 05:41:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 05:41:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-12-09 05:41:16,079 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 11 [2018-12-09 05:41:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,080 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-12-09 05:41:16,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:41:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-12-09 05:41:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 05:41:16,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,080 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-09 05:41:16,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1804683774, now seen corresponding path program 1 times [2018-12-09 05:41:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:41:16,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,125 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2018-12-09 05:41:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,234 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-12-09 05:41:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:41:16,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 05:41:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,235 INFO L225 Difference]: With dead ends: 112 [2018-12-09 05:41:16,235 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 05:41:16,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:41:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 05:41:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2018-12-09 05:41:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 05:41:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-12-09 05:41:16,239 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2018-12-09 05:41:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,239 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-12-09 05:41:16,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-09 05:41:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 05:41:16,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,240 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:16,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash -540844760, now seen corresponding path program 1 times [2018-12-09 05:41:16,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:16,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,283 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 6 states. [2018-12-09 05:41:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,410 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-09 05:41:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:41:16,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 05:41:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,411 INFO L225 Difference]: With dead ends: 105 [2018-12-09 05:41:16,411 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 05:41:16,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:41:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 05:41:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-12-09 05:41:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 05:41:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-12-09 05:41:16,414 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 19 [2018-12-09 05:41:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,415 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-12-09 05:41:16,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-12-09 05:41:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 05:41:16,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,415 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:16,416 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash -540844759, now seen corresponding path program 1 times [2018-12-09 05:41:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:16,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,470 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2018-12-09 05:41:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,641 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-12-09 05:41:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:41:16,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 05:41:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,642 INFO L225 Difference]: With dead ends: 106 [2018-12-09 05:41:16,642 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 05:41:16,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:41:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 05:41:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2018-12-09 05:41:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 05:41:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-12-09 05:41:16,646 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 19 [2018-12-09 05:41:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,646 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-12-09 05:41:16,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-12-09 05:41:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:16,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,646 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-09 05:41:16,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,647 INFO L82 PathProgramCache]: Analyzing trace with hash 818102511, now seen corresponding path program 1 times [2018-12-09 05:41:16,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:41:16,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,685 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2018-12-09 05:41:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,777 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-12-09 05:41:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:41:16,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 05:41:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,778 INFO L225 Difference]: With dead ends: 101 [2018-12-09 05:41:16,778 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 05:41:16,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:41:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 05:41:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2018-12-09 05:41:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 05:41:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-12-09 05:41:16,781 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 21 [2018-12-09 05:41:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,782 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-12-09 05:41:16,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-12-09 05:41:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:16,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,782 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:16,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash 522288282, now seen corresponding path program 1 times [2018-12-09 05:41:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:16,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,817 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2018-12-09 05:41:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:16,904 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-12-09 05:41:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:41:16,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 05:41:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:16,905 INFO L225 Difference]: With dead ends: 86 [2018-12-09 05:41:16,905 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 05:41:16,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:41:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 05:41:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-09 05:41:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 05:41:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-12-09 05:41:16,908 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2018-12-09 05:41:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:16,908 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-12-09 05:41:16,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-12-09 05:41:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:16,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:16,908 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:16,909 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:16,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 522288283, now seen corresponding path program 1 times [2018-12-09 05:41:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:16,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:16,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:16,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:16,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:16,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:16,952 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2018-12-09 05:41:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:17,069 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-12-09 05:41:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:41:17,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 05:41:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:17,070 INFO L225 Difference]: With dead ends: 83 [2018-12-09 05:41:17,070 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 05:41:17,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:41:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 05:41:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2018-12-09 05:41:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 05:41:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-12-09 05:41:17,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 21 [2018-12-09 05:41:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:17,073 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-12-09 05:41:17,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-12-09 05:41:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 05:41:17,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:17,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:17,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:17,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -410251038, now seen corresponding path program 1 times [2018-12-09 05:41:17,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:17,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:17,104 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:41:17,114 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 05:41:17,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:17 BoogieIcfgContainer [2018-12-09 05:41:17,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:41:17,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:41:17,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:41:17,128 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:41:17,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:15" (3/4) ... [2018-12-09 05:41:17,130 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 05:41:17,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:41:17,131 INFO L168 Benchmark]: Toolchain (without parser) took 2033.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 953.5 MB in the beginning and 1.0 GB in the end (delta: -60.9 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:17,132 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:17,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:17,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:17,133 INFO L168 Benchmark]: Boogie Preprocessor took 18.83 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-09 05:41:17,133 INFO L168 Benchmark]: RCFGBuilder took 231.37 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:17,133 INFO L168 Benchmark]: TraceAbstraction took 1480.86 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:17,134 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:17,135 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.83 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. * RCFGBuilder took 231.37 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1480.86 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 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.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L628] COND FALSE !(a == 0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L629] List t; [L630] List p = a; VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L646] p = a VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L647] EXPR p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 25 error locations. UNSAFE Result, 1.4s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 417 SDtfs, 587 SDslu, 751 SDs, 0 SdLazy, 999 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, 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, 9 MinimizatonAttempts, 146 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 8860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 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-09 05:41:18,463 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:41:18,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:41:18,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:41:18,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:41:18,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:41:18,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:41:18,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:41:18,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:41:18,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:41:18,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:41:18,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:41:18,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:41:18,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:41:18,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:41:18,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:41:18,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:41:18,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:41:18,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:41:18,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:41:18,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:41:18,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:41:18,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:41:18,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:41:18,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:41:18,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:41:18,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:41:18,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:41:18,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:41:18,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:41:18,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:41:18,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:41:18,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:41:18,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:41:18,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:41:18,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:41:18,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 05:41:18,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:41:18,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:41:18,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:41:18,492 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:41:18,492 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:41:18,493 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:41:18,493 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:41:18,493 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:41:18,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:41:18,493 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:41:18,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:41:18,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:41:18,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 05:41:18,494 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:41:18,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:41:18,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 05:41:18,495 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:41:18,496 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 05:41:18,496 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_a3abb0a9-f982-461b-a87e-7632e9d600b2/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 -> 45292d949331e02d780a7679ac12098a89a953bb [2018-12-09 05:41:18,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:41:18,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:41:18,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:41:18,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:41:18,523 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:41:18,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:18,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/14274d294/41bf36267145433c8d3dba5bb635c3a4/FLAGafde6f4a9 [2018-12-09 05:41:19,038 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:41:19,038 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/sv-benchmarks/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:19,045 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/14274d294/41bf36267145433c8d3dba5bb635c3a4/FLAGafde6f4a9 [2018-12-09 05:41:19,402 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/bin-2019/utaipan/data/14274d294/41bf36267145433c8d3dba5bb635c3a4 [2018-12-09 05:41:19,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:41:19,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:41:19,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:19,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:41:19,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:41:19,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db1f4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19, skipping insertion in model container [2018-12-09 05:41:19,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:41:19,447 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:41:19,594 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:19,603 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:41:19,628 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:19,690 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:41:19,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19 WrapperNode [2018-12-09 05:41:19,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:19,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:19,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:41:19,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:41:19,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:19,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:41:19,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:41:19,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:41:19,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 05:41:19,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:41:19,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:41:19,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:41:19,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:41:19,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 05:41:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 05:41:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:41:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 05:41:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:41:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:41:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:41:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:41:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 05:41:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:41:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 05:41:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:41:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:41:20,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:41:20,022 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 05:41:20,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:20 BoogieIcfgContainer [2018-12-09 05:41:20,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:41:20,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:41:20,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:41:20,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:41:20,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:41:19" (1/3) ... [2018-12-09 05:41:20,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d87be90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:20, skipping insertion in model container [2018-12-09 05:41:20,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (2/3) ... [2018-12-09 05:41:20,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d87be90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:20, skipping insertion in model container [2018-12-09 05:41:20,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:20" (3/3) ... [2018-12-09 05:41:20,027 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-12-09 05:41:20,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:41:20,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-12-09 05:41:20,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2018-12-09 05:41:20,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:41:20,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:41:20,060 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 05:41:20,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:41:20,060 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:41:20,060 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:41:20,060 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:41:20,060 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:41:20,060 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:41:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-09 05:41:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:41:20,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:20,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:20,075 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:20,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2120440968, now seen corresponding path program 1 times [2018-12-09 05:41:20,081 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:20,081 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:20,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:20,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:20,159 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-09 05:41:20,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 05:41:20,174 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-09 05:41:20,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:20,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:20,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:41:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:41:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:41:20,188 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2018-12-09 05:41:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:20,370 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-12-09 05:41:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:41:20,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 05:41:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:20,376 INFO L225 Difference]: With dead ends: 75 [2018-12-09 05:41:20,376 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 05:41:20,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:41:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 05:41:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-12-09 05:41:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 05:41:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-12-09 05:41:20,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 10 [2018-12-09 05:41:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:20,401 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-09 05:41:20,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:41:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-12-09 05:41:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:41:20,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:20,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:20,402 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:20,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2120440969, now seen corresponding path program 1 times [2018-12-09 05:41:20,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:20,403 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:20,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:20,442 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-09 05:41:20,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 05:41:20,463 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-09 05:41:20,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:20,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:20,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:20,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:41:20,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:41:20,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:41:20,466 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2018-12-09 05:41:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:20,673 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-12-09 05:41:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:41:20,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 05:41:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:20,674 INFO L225 Difference]: With dead ends: 84 [2018-12-09 05:41:20,674 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 05:41:20,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:41:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 05:41:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-09 05:41:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 05:41:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-12-09 05:41:20,679 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 10 [2018-12-09 05:41:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:20,679 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-12-09 05:41:20,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:41:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-12-09 05:41:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 05:41:20,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:20,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:20,680 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:20,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -508055769, now seen corresponding path program 1 times [2018-12-09 05:41:20,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:20,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:20,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:20,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 05:41:20,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 05:41:20,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 05:41:20,769 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-09 05:41:20,772 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 13 treesize of output 5 [2018-12-09 05:41:20,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:20,776 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-09 05:41:20,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 05:41:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:20,789 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:20,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:20,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:41:20,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:41:20,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:41:20,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:41:20,791 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 7 states. [2018-12-09 05:41:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:21,084 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-12-09 05:41:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:41:21,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 05:41:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:21,086 INFO L225 Difference]: With dead ends: 108 [2018-12-09 05:41:21,086 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 05:41:21,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:41:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 05:41:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2018-12-09 05:41:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 05:41:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-09 05:41:21,092 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 17 [2018-12-09 05:41:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:21,092 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-09 05:41:21,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:41:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-09 05:41:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 05:41:21,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:21,093 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:21,093 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:21,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2035917311, now seen corresponding path program 1 times [2018-12-09 05:41:21,094 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:21,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:21,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:21,144 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-09 05:41:21,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 05:41:21,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:21,162 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 10 treesize of output 9 [2018-12-09 05:41:21,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,172 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-09 05:41:21,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-12-09 05:41:21,188 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 21 treesize of output 17 [2018-12-09 05:41:21,191 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 17 treesize of output 5 [2018-12-09 05:41:21,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 05:41:21,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2018-12-09 05:41:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:21,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:21,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:21,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:21,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:21,209 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2018-12-09 05:41:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:21,496 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-09 05:41:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:41:21,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 05:41:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:21,498 INFO L225 Difference]: With dead ends: 85 [2018-12-09 05:41:21,498 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 05:41:21,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:41:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 05:41:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-12-09 05:41:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 05:41:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-09 05:41:21,502 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 17 [2018-12-09 05:41:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:21,502 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-09 05:41:21,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-09 05:41:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 05:41:21,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:21,503 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:21,503 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:21,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2035917312, now seen corresponding path program 1 times [2018-12-09 05:41:21,503 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:21,504 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:21,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:21,561 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-09 05:41:21,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 05:41:21,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:21,596 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 10 treesize of output 9 [2018-12-09 05:41:21,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:21,616 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 10 treesize of output 9 [2018-12-09 05:41:21,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,628 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-09 05:41:21,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-12-09 05:41:21,645 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-09 05:41:21,649 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 3 [2018-12-09 05:41:21,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,665 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 23 treesize of output 19 [2018-12-09 05:41:21,668 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 19 treesize of output 7 [2018-12-09 05:41:21,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:21,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2018-12-09 05:41:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:21,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:21,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:21,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:21,701 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 6 states. [2018-12-09 05:41:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:22,174 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 05:41:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:41:22,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 05:41:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:22,176 INFO L225 Difference]: With dead ends: 101 [2018-12-09 05:41:22,176 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 05:41:22,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:41:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 05:41:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-12-09 05:41:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 05:41:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-12-09 05:41:22,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 17 [2018-12-09 05:41:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:22,179 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-12-09 05:41:22,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-12-09 05:41:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 05:41:22,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:22,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:22,180 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:22,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2111799943, now seen corresponding path program 1 times [2018-12-09 05:41:22,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:22,181 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:22,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:22,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:22,234 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-09 05:41:22,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 05:41:22,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:22,257 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 10 treesize of output 9 [2018-12-09 05:41:22,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:22,279 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 10 treesize of output 9 [2018-12-09 05:41:22,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,295 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-09 05:41:22,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-12-09 05:41:22,312 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-09 05:41:22,314 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 3 [2018-12-09 05:41:22,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,327 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 23 treesize of output 19 [2018-12-09 05:41:22,330 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 19 treesize of output 7 [2018-12-09 05:41:22,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2018-12-09 05:41:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:22,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:22,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:22,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:22,357 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 6 states. [2018-12-09 05:41:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:22,784 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-12-09 05:41:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:41:22,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 05:41:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:22,785 INFO L225 Difference]: With dead ends: 90 [2018-12-09 05:41:22,785 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 05:41:22,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:41:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 05:41:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-12-09 05:41:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 05:41:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-12-09 05:41:22,788 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 18 [2018-12-09 05:41:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:22,788 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-12-09 05:41:22,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-12-09 05:41:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 05:41:22,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:22,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:22,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:22,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2111799942, now seen corresponding path program 1 times [2018-12-09 05:41:22,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:22,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:22,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:22,837 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-09 05:41:22,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 05:41:22,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:41:22,850 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 10 treesize of output 9 [2018-12-09 05:41:22,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,860 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-09 05:41:22,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-12-09 05:41:22,872 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 21 treesize of output 17 [2018-12-09 05:41:22,874 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 17 treesize of output 5 [2018-12-09 05:41:22,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:22,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 05:41:22,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2018-12-09 05:41:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:22,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:22,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:22,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:41:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:41:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:41:22,888 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 6 states. [2018-12-09 05:41:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:23,091 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-12-09 05:41:23,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:41:23,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 05:41:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:23,092 INFO L225 Difference]: With dead ends: 64 [2018-12-09 05:41:23,092 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 05:41:23,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:41:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 05:41:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-12-09 05:41:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 05:41:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-09 05:41:23,094 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 18 [2018-12-09 05:41:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:23,094 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-09 05:41:23,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:41:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-09 05:41:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 05:41:23,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:23,095 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-09 05:41:23,095 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:23,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1337099412, now seen corresponding path program 1 times [2018-12-09 05:41:23,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:23,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:23,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:23,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 05:41:23,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 05:41:23,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:23,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:23,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:23,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 05:41:23,175 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-09 05:41:23,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 13 treesize of output 5 [2018-12-09 05:41:23,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:41:23,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:41:23,179 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-09 05:41:23,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 05:41:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:23,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:23,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:41:23,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:41:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:41:23,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:41:23,188 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-12-09 05:41:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:23,440 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-12-09 05:41:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:41:23,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 05:41:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:23,442 INFO L225 Difference]: With dead ends: 83 [2018-12-09 05:41:23,442 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 05:41:23,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:41:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 05:41:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2018-12-09 05:41:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 05:41:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-09 05:41:23,446 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 19 [2018-12-09 05:41:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:23,446 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-09 05:41:23,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:41:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-09 05:41:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 05:41:23,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:23,447 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-09 05:41:23,447 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2018-12-09 05:41:23,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1501216293, now seen corresponding path program 1 times [2018-12-09 05:41:23,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:41:23,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3abb0a9-f982-461b-a87e-7632e9d600b2/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-09 05:41:23,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:23,552 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:41:23,560 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 05:41:23,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:23 BoogieIcfgContainer [2018-12-09 05:41:23,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:41:23,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:41:23,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:41:23,570 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:41:23,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:20" (3/4) ... [2018-12-09 05:41:23,573 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 05:41:23,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:41:23,573 INFO L168 Benchmark]: Toolchain (without parser) took 4165.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:23,574 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-09 05:41:23,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:23,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:23,574 INFO L168 Benchmark]: Boogie Preprocessor took 18.54 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-09 05:41:23,575 INFO L168 Benchmark]: RCFGBuilder took 294.78 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:23,575 INFO L168 Benchmark]: TraceAbstraction took 3546.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:23,575 INFO L168 Benchmark]: Witness Printer took 2.76 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-09 05:41:23,577 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 278.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.54 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 294.78 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3546.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 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. * 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.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}] [L628] COND FALSE !(a == 0) VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}] [L629] List t; [L630] List p = a; VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L646] p = a VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L647] EXPR p->h VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR p->h VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR p->h VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 72 locations, 25 error locations. UNSAFE Result, 3.5s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 656 SDslu, 602 SDs, 0 SdLazy, 957 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, 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, 8 MinimizatonAttempts, 135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 8828 SizeOfPredicates, 50 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8/8 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...