./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.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_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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 1f3e231c5b77f9ab25b28372001f508e3e47c051 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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 1f3e231c5b77f9ab25b28372001f508e3e47c051 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:20:19,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:20:19,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:20:19,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:20:19,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:20:19,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:20:19,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:20:19,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:20:19,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:20:19,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:20:19,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:20:19,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:20:19,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:20:19,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:20:19,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:20:19,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:20:19,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:20:19,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:20:19,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:20:19,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:20:19,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:20:19,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:20:19,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:20:19,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:20:19,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:20:19,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:20:19,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:20:19,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:20:19,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:20:19,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:20:19,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:20:19,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:20:19,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:20:19,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:20:19,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:20:19,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:20:19,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 21:20:19,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:20:19,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:20:19,324 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:20:19,324 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:20:19,324 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:20:19,324 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:20:19,325 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:20:19,326 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:20:19,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:20:19,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:20:19,327 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:20:19,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:20:19,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:20:19,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:20:19,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:20:19,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:20:19,329 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:20:19,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:20:19,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:20:19,329 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_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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 -> 1f3e231c5b77f9ab25b28372001f508e3e47c051 [2018-12-02 21:20:19,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:20:19,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:20:19,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:20:19,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:20:19,363 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:20:19,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:19,399 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/5ba8c183c/438ae3e4c2564f4d8a647749fbc68d76/FLAG4fac21e67 [2018-12-02 21:20:19,823 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:20:19,823 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:19,829 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/5ba8c183c/438ae3e4c2564f4d8a647749fbc68d76/FLAG4fac21e67 [2018-12-02 21:20:19,837 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/5ba8c183c/438ae3e4c2564f4d8a647749fbc68d76 [2018-12-02 21:20:19,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:20:19,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:20:19,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:20:19,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:20:19,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:20:19,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:19" (1/1) ... [2018-12-02 21:20:19,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b5df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:19, skipping insertion in model container [2018-12-02 21:20:19,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:19" (1/1) ... [2018-12-02 21:20:19,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:20:19,873 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:20:20,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:20:20,073 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:20:20,101 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:20:20,123 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:20:20,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20 WrapperNode [2018-12-02 21:20:20,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:20:20,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:20:20,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:20:20,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:20:20,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:20:20,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:20:20,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:20:20,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:20:20,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... [2018-12-02 21:20:20,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:20:20,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:20:20,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:20:20,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:20:20,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-02 21:20:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 21:20:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 21:20:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:20:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:20:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:20:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_append [2018-12-02 21:20:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_append [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-02 21:20:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 21:20:20,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:20:20,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:20:20,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:20:20,490 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 21:20:20,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:20 BoogieIcfgContainer [2018-12-02 21:20:20,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:20:20,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:20:20,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:20:20,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:20:20,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:20:19" (1/3) ... [2018-12-02 21:20:20,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3b95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:20:20, skipping insertion in model container [2018-12-02 21:20:20,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:20" (2/3) ... [2018-12-02 21:20:20,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3b95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:20:20, skipping insertion in model container [2018-12-02 21:20:20,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:20" (3/3) ... [2018-12-02 21:20:20,496 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:20,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:20:20,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-12-02 21:20:20,519 INFO L257 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2018-12-02 21:20:20,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:20:20,538 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:20:20,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:20:20,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:20:20,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:20:20,538 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:20:20,538 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:20:20,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:20:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-12-02 21:20:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 21:20:20,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:20,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:20,557 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:20,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -488415875, now seen corresponding path program 1 times [2018-12-02 21:20:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:20,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:20,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:20:20,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:20:20,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:20:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:20:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:20,692 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2018-12-02 21:20:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:20,791 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-12-02 21:20:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:20:20,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 21:20:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:20,799 INFO L225 Difference]: With dead ends: 140 [2018-12-02 21:20:20,799 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 21:20:20,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 21:20:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-02 21:20:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 21:20:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-02 21:20:20,828 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 12 [2018-12-02 21:20:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:20,828 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-02 21:20:20,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:20:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-02 21:20:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 21:20:20,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:20,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:20,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:20,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -488415874, now seen corresponding path program 1 times [2018-12-02 21:20:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:20,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:20,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:20:20,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:20:20,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:20:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:20:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:20,880 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-02 21:20:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:20,947 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-12-02 21:20:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:20:20,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 21:20:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:20,948 INFO L225 Difference]: With dead ends: 130 [2018-12-02 21:20:20,949 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 21:20:20,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 21:20:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-02 21:20:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 21:20:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-12-02 21:20:20,957 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 12 [2018-12-02 21:20:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:20,957 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-12-02 21:20:20,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:20:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-12-02 21:20:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:20:20,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:20,958 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-02 21:20:20,958 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:20,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1898997958, now seen corresponding path program 1 times [2018-12-02 21:20:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:20,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:21,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:21,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:21,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:20:21,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:20:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:20:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:20:21,006 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 5 states. [2018-12-02 21:20:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:21,032 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-12-02 21:20:21,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:20:21,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 21:20:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:21,033 INFO L225 Difference]: With dead ends: 131 [2018-12-02 21:20:21,033 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 21:20:21,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 21:20:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-02 21:20:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 21:20:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-12-02 21:20:21,038 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 20 [2018-12-02 21:20:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:21,039 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-12-02 21:20:21,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:20:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-12-02 21:20:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:20:21,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:21,040 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:21,041 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:21,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1994744049, now seen corresponding path program 1 times [2018-12-02 21:20:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:21,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:21,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:21,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:20:21,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:20:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:20:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:21,115 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 6 states. [2018-12-02 21:20:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:21,259 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-12-02 21:20:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:21,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 21:20:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:21,261 INFO L225 Difference]: With dead ends: 131 [2018-12-02 21:20:21,261 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 21:20:21,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 21:20:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-02 21:20:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 21:20:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-12-02 21:20:21,268 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 30 [2018-12-02 21:20:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:21,269 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-12-02 21:20:21,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:20:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-12-02 21:20:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:20:21,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:21,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:21,270 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:21,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1994744048, now seen corresponding path program 1 times [2018-12-02 21:20:21,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:20:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:21,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:21,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:20:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:20:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:20:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:21,318 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 6 states. [2018-12-02 21:20:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:21,468 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-02 21:20:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:21,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 21:20:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:21,469 INFO L225 Difference]: With dead ends: 130 [2018-12-02 21:20:21,470 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 21:20:21,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 21:20:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-02 21:20:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 21:20:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-12-02 21:20:21,474 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 30 [2018-12-02 21:20:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:21,474 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-12-02 21:20:21,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:20:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-12-02 21:20:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:20:21,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:21,475 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:21,475 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 21:20:21,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1393617297, now seen corresponding path program 1 times [2018-12-02 21:20:21,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:20:21,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:21,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:20:21,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:20:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:21,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:21,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:20:21,621 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-02 21:20:21,623 INFO L205 CegarAbsIntRunner]: [0], [48], [50], [59], [61], [62], [67], [69], [86], [87], [181], [187], [189], [192], [195], [198], [199], [200], [206], [207], [208], [209], [212], [213], [214] [2018-12-02 21:20:21,644 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:20:21,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:20:21,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:20:21,765 INFO L272 AbstractInterpreter]: Visited 25 different actions 32 times. Never merged. Never widened. Performed 394 root evaluator evaluations with a maximum evaluation depth of 3. Performed 394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 28 variables. [2018-12-02 21:20:21,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:21,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:20:21,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:21,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:21,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:20:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:21,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:22,117 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:22,118 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_3| input size 14 context size 14 output size 14 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 21:20:22,122 INFO L168 Benchmark]: Toolchain (without parser) took 2282.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 953.5 MB in the beginning and 769.5 MB in the end (delta: 183.9 MB). Peak memory consumption was 265.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:20:22,124 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:20:22,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -109.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:20:22,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.22 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-02 21:20:22,126 INFO L168 Benchmark]: Boogie Preprocessor took 22.38 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:20:22,126 INFO L168 Benchmark]: RCFGBuilder took 325.28 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:20:22,127 INFO L168 Benchmark]: TraceAbstraction took 1629.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 769.5 MB in the end (delta: 238.3 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:20:22,131 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.12 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 283.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -109.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.38 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.28 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1629.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 769.5 MB in the end (delta: 238.3 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_3| input size 14 context size 14 output size 14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_3| input size 14 context size 14 output size 14: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:20:23,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:20:23,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:20:23,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:20:23,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:20:23,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:20:23,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:20:23,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:20:23,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:20:23,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:20:23,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:20:23,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:20:23,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:20:23,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:20:23,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:20:23,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:20:23,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:20:23,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:20:23,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:20:23,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:20:23,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:20:23,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:20:23,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:20:23,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:20:23,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:20:23,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:20:23,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:20:23,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:20:23,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:20:23,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:20:23,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:20:23,408 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:20:23,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:20:23,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:20:23,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:20:23,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:20:23,410 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 21:20:23,419 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:20:23,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:20:23,420 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:20:23,421 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:20:23,421 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:20:23,421 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:20:23,421 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:20:23,421 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:20:23,421 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:20:23,422 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:20:23,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:20:23,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:20:23,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:20:23,423 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:20:23,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:20:23,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:20:23,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:20:23,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:20:23,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:20:23,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:20:23,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:20:23,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:20:23,426 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 21:20:23,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:20:23,426 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 21:20:23,426 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_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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 -> 1f3e231c5b77f9ab25b28372001f508e3e47c051 [2018-12-02 21:20:23,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:20:23,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:20:23,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:20:23,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:20:23,462 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:20:23,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:23,498 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/184f46bd9/aa4140a2bbd94cf7944d35476987a2bb/FLAG11e066f72 [2018-12-02 21:20:23,927 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:20:23,927 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/sv-benchmarks/c/list-simple/dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:23,933 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/184f46bd9/aa4140a2bbd94cf7944d35476987a2bb/FLAG11e066f72 [2018-12-02 21:20:23,941 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/data/184f46bd9/aa4140a2bbd94cf7944d35476987a2bb [2018-12-02 21:20:23,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:20:23,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:20:23,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:20:23,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:20:23,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:20:23,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:23" (1/1) ... [2018-12-02 21:20:23,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46be3c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:23, skipping insertion in model container [2018-12-02 21:20:23,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:23" (1/1) ... [2018-12-02 21:20:23,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:20:23,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:20:24,131 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:20:24,139 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:20:24,211 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:20:24,239 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:20:24,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24 WrapperNode [2018-12-02 21:20:24,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:20:24,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:20:24,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:20:24,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:20:24,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:20:24,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:20:24,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:20:24,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:20:24,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... [2018-12-02 21:20:24,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:20:24,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:20:24,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:20:24,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:20:24,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:20:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-02 21:20:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-02 21:20:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 21:20:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 21:20:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:20:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 21:20:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 21:20:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:20:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:20:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_append [2018-12-02 21:20:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_append [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-02 21:20:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 21:20:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:20:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:20:24,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:20:24,717 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 21:20:24,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:24 BoogieIcfgContainer [2018-12-02 21:20:24,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:20:24,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:20:24,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:20:24,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:20:24,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:20:23" (1/3) ... [2018-12-02 21:20:24,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b99a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:20:24, skipping insertion in model container [2018-12-02 21:20:24,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:24" (2/3) ... [2018-12-02 21:20:24,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b99a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:20:24, skipping insertion in model container [2018-12-02 21:20:24,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:24" (3/3) ... [2018-12-02 21:20:24,722 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:20:24,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:20:24,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-12-02 21:20:24,741 INFO L257 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2018-12-02 21:20:24,757 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:20:24,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:20:24,757 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:20:24,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:20:24,758 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:20:24,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:20:24,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:20:24,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:20:24,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:20:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-12-02 21:20:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 21:20:24,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:24,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:24,776 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:24,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash -488415875, now seen corresponding path program 1 times [2018-12-02 21:20:24,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:24,782 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:24,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:24,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:24,870 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-02 21:20:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:24,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:24,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:24,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:24,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:24,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:20:24,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:20:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:20:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:24,900 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2018-12-02 21:20:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:25,152 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-12-02 21:20:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:20:25,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 21:20:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:25,163 INFO L225 Difference]: With dead ends: 140 [2018-12-02 21:20:25,163 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 21:20:25,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 21:20:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-02 21:20:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 21:20:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-02 21:20:25,204 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 12 [2018-12-02 21:20:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:25,205 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-02 21:20:25,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:20:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-02 21:20:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 21:20:25,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:25,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:25,206 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:25,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -488415874, now seen corresponding path program 1 times [2018-12-02 21:20:25,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:25,207 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:25,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:25,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 6 treesize of output 5 [2018-12-02 21:20:25,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:25,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:25,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:20:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:25,271 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:25,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:25,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:20:25,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:20:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:20:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:25,274 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-02 21:20:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:25,485 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-12-02 21:20:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:20:25,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 21:20:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:25,487 INFO L225 Difference]: With dead ends: 130 [2018-12-02 21:20:25,487 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 21:20:25,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:20:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 21:20:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-02 21:20:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 21:20:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-12-02 21:20:25,493 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 12 [2018-12-02 21:20:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:25,493 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-12-02 21:20:25,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:20:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-12-02 21:20:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:20:25,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:25,494 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-02 21:20:25,494 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:25,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1898997958, now seen corresponding path program 1 times [2018-12-02 21:20:25,495 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:25,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:25,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:25,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:25,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:25,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:25,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:20:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:20:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:20:25,578 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 5 states. [2018-12-02 21:20:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:25,609 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-02 21:20:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:20:25,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 21:20:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:25,611 INFO L225 Difference]: With dead ends: 141 [2018-12-02 21:20:25,611 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 21:20:25,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 21:20:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-12-02 21:20:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 21:20:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-12-02 21:20:25,620 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 20 [2018-12-02 21:20:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:25,621 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-12-02 21:20:25,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:20:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-12-02 21:20:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:20:25,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:25,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:25,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:25,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1994744049, now seen corresponding path program 1 times [2018-12-02 21:20:25,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:25,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:25,720 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-02 21:20:25,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:25,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:25,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:20:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:25,757 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:25,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:25,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:20:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:20:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:25,759 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 6 states. [2018-12-02 21:20:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:26,328 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-12-02 21:20:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:26,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 21:20:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:26,331 INFO L225 Difference]: With dead ends: 131 [2018-12-02 21:20:26,331 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 21:20:26,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 21:20:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-02 21:20:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 21:20:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-12-02 21:20:26,336 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 30 [2018-12-02 21:20:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:26,336 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-12-02 21:20:26,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:20:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-12-02 21:20:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:20:26,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:26,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:26,337 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:26,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1994744048, now seen corresponding path program 1 times [2018-12-02 21:20:26,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:26,337 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:26,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:26,424 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-02 21:20:26,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:26,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:26,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:26,449 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:20:26,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:20:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:20:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:26,452 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 6 states. [2018-12-02 21:20:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:26,888 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-02 21:20:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:26,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 21:20:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:26,889 INFO L225 Difference]: With dead ends: 130 [2018-12-02 21:20:26,889 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 21:20:26,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 21:20:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-02 21:20:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 21:20:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-12-02 21:20:26,894 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 30 [2018-12-02 21:20:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:26,895 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-12-02 21:20:26,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:20:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-12-02 21:20:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:20:26,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:26,896 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:26,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1393617297, now seen corresponding path program 1 times [2018-12-02 21:20:26,896 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:26,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:27,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:27,012 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-02 21:20:27,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:27,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:27,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:27,347 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 21:20:27,355 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 14 treesize of output 11 [2018-12-02 21:20:27,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:27,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:27,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-02 21:20:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 21:20:27,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:20:27,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:27,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:27,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:27,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:27,520 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-02 21:20:27,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:27,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:27,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:29,527 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 21:20:29,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:29,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:29,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:20:29,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:29,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:29,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-02 21:20:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 21:20:29,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:29,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:20:29,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 10 [2018-12-02 21:20:29,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:20:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:20:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=7, NotChecked=34, Total=132 [2018-12-02 21:20:29,621 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 11 states. [2018-12-02 21:20:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:30,404 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-12-02 21:20:30,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:20:30,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-02 21:20:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:30,405 INFO L225 Difference]: With dead ends: 152 [2018-12-02 21:20:30,405 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 21:20:30,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=39, Invalid=115, Unknown=10, NotChecked=46, Total=210 [2018-12-02 21:20:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 21:20:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2018-12-02 21:20:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 21:20:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-12-02 21:20:30,409 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 32 [2018-12-02 21:20:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:30,410 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-12-02 21:20:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:20:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-12-02 21:20:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:20:30,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:30,410 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:30,411 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:30,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1393617298, now seen corresponding path program 1 times [2018-12-02 21:20:30,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/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-02 21:20:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:30,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:30,537 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-02 21:20:30,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:30,545 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-02 21:20:30,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:30,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:30,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:20:32,240 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-02 21:20:32,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:32,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:32,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 21:20:32,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:20:32,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:32,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-02 21:20:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 21:20:32,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:32,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:32,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:32,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:32,501 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-02 21:20:32,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,518 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-02 21:20:32,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:20:32,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:32,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:32,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:20:32,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:20:32,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:32,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:32,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-02 21:20:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 21:20:32,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:32,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:20:32,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 21:20:32,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:20:32,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:20:32,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-02 21:20:32,670 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 9 states. [2018-12-02 21:20:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:33,774 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-12-02 21:20:33,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:20:33,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-02 21:20:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:33,776 INFO L225 Difference]: With dead ends: 151 [2018-12-02 21:20:33,776 INFO L226 Difference]: Without dead ends: 151 [2018-12-02 21:20:33,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-12-02 21:20:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-02 21:20:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-12-02 21:20:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 21:20:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-12-02 21:20:33,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 32 [2018-12-02 21:20:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:33,781 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-12-02 21:20:33,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:20:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-12-02 21:20:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 21:20:33,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:33,782 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:33,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:33,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash -763418328, now seen corresponding path program 1 times [2018-12-02 21:20:33,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:33,783 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:33,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:33,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:33,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:33,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:33,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:33,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:33,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:33,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:33,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:20:33,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-12-02 21:20:33,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:20:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:20:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:20:33,987 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 6 states. [2018-12-02 21:20:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:34,125 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-12-02 21:20:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:34,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-02 21:20:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:34,127 INFO L225 Difference]: With dead ends: 135 [2018-12-02 21:20:34,127 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 21:20:34,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 21:20:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-02 21:20:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 21:20:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-12-02 21:20:34,131 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 34 [2018-12-02 21:20:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:34,131 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-12-02 21:20:34,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:20:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-12-02 21:20:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 21:20:34,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:34,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:34,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:34,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2099054961, now seen corresponding path program 1 times [2018-12-02 21:20:34,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:34,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:34,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:34,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:34,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-02 21:20:34,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:34,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-12-02 21:20:34,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:20:34,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 21:20:34,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:34,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-02 21:20:34,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:50 [2018-12-02 21:20:34,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:34,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:34,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:34,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:34,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-12-02 21:20:34,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:20:34,770 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-02 21:20:34,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:34,821 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 21:20:34,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:34,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-02 21:20:34,872 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:50 [2018-12-02 21:20:34,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:20:34,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 21:20:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:20:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:20:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:20:34,976 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 7 states. [2018-12-02 21:20:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:35,383 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-12-02 21:20:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:20:35,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-12-02 21:20:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:35,385 INFO L225 Difference]: With dead ends: 145 [2018-12-02 21:20:35,385 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 21:20:35,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:20:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 21:20:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2018-12-02 21:20:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-02 21:20:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-12-02 21:20:35,387 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 35 [2018-12-02 21:20:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:35,387 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-12-02 21:20:35,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:20:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-12-02 21:20:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 21:20:35,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:35,388 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:35,388 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:35,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2099054960, now seen corresponding path program 1 times [2018-12-02 21:20:35,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:35,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:35,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:35,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:20:35,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 21:20:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:35,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:35,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-02 21:20:35,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-02 21:20:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:35,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:35,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:35,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:35,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:35,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:35,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-02 21:20:35,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-02 21:20:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:35,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:20:35,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3] total 3 [2018-12-02 21:20:35,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:20:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:20:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:20:35,590 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 4 states. [2018-12-02 21:20:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:35,787 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-12-02 21:20:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:20:35,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 21:20:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:35,787 INFO L225 Difference]: With dead ends: 138 [2018-12-02 21:20:35,787 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 21:20:35,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:20:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 21:20:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-02 21:20:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-02 21:20:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2018-12-02 21:20:35,791 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 35 [2018-12-02 21:20:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:35,791 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2018-12-02 21:20:35,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:20:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2018-12-02 21:20:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:20:35,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:35,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:35,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:35,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 646194371, now seen corresponding path program 1 times [2018-12-02 21:20:35,793 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:35,793 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:35,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:35,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:35,902 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-02 21:20:35,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:35,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:35,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:35,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:20:35,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:20:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:20:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:35,926 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 7 states. [2018-12-02 21:20:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:36,459 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-02 21:20:36,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:20:36,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 21:20:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:36,460 INFO L225 Difference]: With dead ends: 137 [2018-12-02 21:20:36,460 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 21:20:36,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:20:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 21:20:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-02 21:20:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:20:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-12-02 21:20:36,463 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2018-12-02 21:20:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:36,463 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-12-02 21:20:36,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:20:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-12-02 21:20:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:20:36,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:36,463 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:36,463 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:36,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 646194372, now seen corresponding path program 1 times [2018-12-02 21:20:36,464 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:36,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:36,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:36,571 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-02 21:20:36,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:36,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:36,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:20:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:20:36,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:20:36,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:20:36,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:20:36,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:20:36,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:20:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:20:36,616 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 7 states. [2018-12-02 21:20:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:37,190 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-12-02 21:20:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:20:37,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 21:20:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:37,191 INFO L225 Difference]: With dead ends: 135 [2018-12-02 21:20:37,191 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 21:20:37,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:20:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 21:20:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-02 21:20:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 21:20:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-12-02 21:20:37,193 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 36 [2018-12-02 21:20:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:37,194 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-12-02 21:20:37,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:20:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-12-02 21:20:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 21:20:37,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:37,194 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:37,195 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:37,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -857095864, now seen corresponding path program 1 times [2018-12-02 21:20:37,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:37,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:37,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:37,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 21:20:37,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:20:37,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:20:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:37,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:20:37,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:20:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 21:20:37,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:20:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-02 21:20:37,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:20:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:20:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:20:37,436 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-12-02 21:20:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:20:37,486 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-02 21:20:37,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:20:37,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-12-02 21:20:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:20:37,487 INFO L225 Difference]: With dead ends: 123 [2018-12-02 21:20:37,487 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 21:20:37,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:20:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 21:20:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-02 21:20:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-02 21:20:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-12-02 21:20:37,489 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 47 [2018-12-02 21:20:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:20:37,489 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-12-02 21:20:37,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:20:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-12-02 21:20:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 21:20:37,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:20:37,490 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:20:37,490 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:20:37,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:20:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash 954432893, now seen corresponding path program 1 times [2018-12-02 21:20:37,491 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:20:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:20:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:20:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:20:37,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:20:37,694 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-02 21:20:37,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:37,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:37,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:20:39,703 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 21:20:40,287 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 21:20:44,092 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 c_dll_circular_create_~new_head~0.base)) (= (store .cse0 c_dll_circular_create_~new_head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 21:20:49,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:49,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:49,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:20:49,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 21:20:49,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-12-02 21:20:49,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:49,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:20:49,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:49,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2018-12-02 21:20:50,442 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 21:20:50,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:20:50,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 21:20:50,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:20:50,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 21:20:50,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-02 21:20:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 1 times theorem prover too weak. 3 trivial. 18 not checked. [2018-12-02 21:20:50,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:04,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:21:04,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:21:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:21:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:21:04,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:21:04,502 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-02 21:21:04,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:21:04,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:21:04,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:21:09,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:21:09,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:21:09,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:21:09,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 21:21:09,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-12-02 21:21:09,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:21:09,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:21:09,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:21:09,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2018-12-02 21:21:09,568 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:21:09,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 21:21:09,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:21:09,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 21:21:09,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-02 21:21:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 10 trivial. 14 not checked. [2018-12-02 21:21:09,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:21:21,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:21:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2018-12-02 21:21:21,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:21:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:21:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=184, Unknown=19, NotChecked=90, Total=342 [2018-12-02 21:21:21,855 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 15 states. [2018-12-02 21:22:06,013 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-12-02 21:22:29,992 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 21:22:30,962 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-12-02 21:24:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:24:44,007 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-12-02 21:24:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:24:44,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-02 21:24:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:24:44,008 INFO L225 Difference]: With dead ends: 131 [2018-12-02 21:24:44,008 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 21:24:44,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=88, Invalid=355, Unknown=31, NotChecked=126, Total=600 [2018-12-02 21:24:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 21:24:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2018-12-02 21:24:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 21:24:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-12-02 21:24:44,011 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 53 [2018-12-02 21:24:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:24:44,011 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-12-02 21:24:44,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:24:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-12-02 21:24:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 21:24:44,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:24:44,012 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:24:44,012 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:24:44,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:24:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash 954432894, now seen corresponding path program 1 times [2018-12-02 21:24:44,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:24:44,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:24:44,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:24:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:24:44,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:24:44,274 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-02 21:24:44,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:44,283 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-02 21:24:44,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:44,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:24:44,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:24:46,382 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32))) (= (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 21:24:47,775 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) |c_dll_circular_create_#t~ret4.base| (_ bv12 32))) (= (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_dll_circular_create_#t~ret4.base|) (_ bv0 1)))) is different from true [2018-12-02 21:24:48,994 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)))) is different from true [2018-12-02 21:24:49,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 21:24:49,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:49,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 21:24:49,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-02 21:24:49,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:49,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:24:49,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:24:49,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-02 21:24:49,958 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))) is different from true [2018-12-02 21:24:49,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:24:49,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-02 21:24:49,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 21:24:50,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 21:24:50,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:60 [2018-12-02 21:24:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-12-02 21:24:50,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:24:50,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:24:50,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:24:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:24:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:24:50,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:24:50,423 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-02 21:24:50,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:50,431 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-02 21:24:50,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:24:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:24:50,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:24:51,439 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 21:25:12,145 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) dll_circular_create_~head~0.base (_ bv12 32))))) is different from true [2018-12-02 21:25:12,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 21:25:12,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:12,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 21:25:12,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-02 21:25:12,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:12,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:12,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:12,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-02 21:25:12,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:12,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-12-02 21:25:12,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 21:25:12,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 21:25:12,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-02 21:25:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-02 21:25:12,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:25:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2018-12-02 21:25:12,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 21:25:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 21:25:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=258, Unknown=18, NotChecked=222, Total=552 [2018-12-02 21:25:12,542 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 22 states. [2018-12-02 21:25:31,083 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32))) (= (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 21:25:32,496 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) |c_dll_circular_create_#t~ret4.base| (_ bv12 32))) (= (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_dll_circular_create_#t~ret4.base|) (_ bv0 1)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) |c_dll_circular_create_#t~ret4.base| (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_circular_create_#t~ret4.base|))))) is different from true [2018-12-02 21:25:36,766 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_circular_create_~new_head~0.base)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) c_dll_circular_create_~new_head~0.base (_ bv12 32))))) (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)))) (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) dll_circular_create_~head~0.base (_ bv12 32)))))) is different from true [2018-12-02 21:25:38,614 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)))) (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) dll_circular_create_~head~0.base (_ bv12 32)))))) is different from true [2018-12-02 21:26:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:26:48,061 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-12-02 21:26:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 21:26:48,061 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-12-02 21:26:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:26:48,061 INFO L225 Difference]: With dead ends: 125 [2018-12-02 21:26:48,061 INFO L226 Difference]: Without dead ends: 125 [2018-12-02 21:26:48,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=83, Invalid=352, Unknown=25, NotChecked=470, Total=930 [2018-12-02 21:26:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-02 21:26:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2018-12-02 21:26:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 21:26:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-12-02 21:26:48,064 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 53 [2018-12-02 21:26:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:26:48,064 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-12-02 21:26:48,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 21:26:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-12-02 21:26:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 21:26:48,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:26:48,064 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:26:48,065 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:26:48,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:26:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1912988898, now seen corresponding path program 1 times [2018-12-02 21:26:48,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:26:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:26:48,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:26:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:26:48,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:26:48,213 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-02 21:26:48,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:48,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:48,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:26:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 21:26:48,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:26:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:26:48,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:26:48,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:26:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:26:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:26:48,239 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 6 states. [2018-12-02 21:26:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:26:48,672 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-12-02 21:26:48,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:26:48,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-02 21:26:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:26:48,673 INFO L225 Difference]: With dead ends: 106 [2018-12-02 21:26:48,673 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 21:26:48,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:26:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 21:26:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-02 21:26:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 21:26:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-02 21:26:48,675 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 55 [2018-12-02 21:26:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:26:48,675 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-02 21:26:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:26:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-02 21:26:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 21:26:48,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:26:48,675 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:26:48,675 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:26:48,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:26:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1912988897, now seen corresponding path program 1 times [2018-12-02 21:26:48,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:26:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:26:48,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:26:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:26:48,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:26:48,843 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-02 21:26:48,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:48,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:48,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:26:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 21:26:48,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:26:48,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:26:48,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:26:48,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:26:48,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:26:48,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:26:48,881 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 6 states. [2018-12-02 21:26:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:26:49,320 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-12-02 21:26:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:26:49,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-02 21:26:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:26:49,321 INFO L225 Difference]: With dead ends: 102 [2018-12-02 21:26:49,322 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 21:26:49,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:26:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 21:26:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-02 21:26:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 21:26:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-02 21:26:49,324 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 55 [2018-12-02 21:26:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:26:49,324 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-02 21:26:49,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:26:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-02 21:26:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:26:49,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:26:49,325 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:26:49,325 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:26:49,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:26:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash 826897304, now seen corresponding path program 1 times [2018-12-02 21:26:49,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:26:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:26:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:26:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:26:49,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:26:49,595 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-02 21:26:49,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:26:49,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:26:49,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 21:26:49,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-02 21:26:49,803 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 21 treesize of output 16 [2018-12-02 21:26:49,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:49,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:26:49,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-02 21:26:49,912 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 30 treesize of output 23 [2018-12-02 21:26:49,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:26:49,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:49,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:49,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:47 [2018-12-02 21:26:52,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:52,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:52,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-02 21:26:52,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-12-02 21:26:52,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-12-02 21:26:52,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:26:52,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:26:52,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-02 21:26:52,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:52,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:26:52,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:52,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:26:52,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,430 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:52,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:52,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:26:52,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:26:52,486 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:59, output treesize:105 [2018-12-02 21:26:54,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-12-02 21:26:54,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-02 21:26:54,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:54,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:54,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 73 [2018-12-02 21:26:54,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-12-02 21:26:54,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:54,720 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 59 treesize of output 54 [2018-12-02 21:26:54,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:54,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:26:54,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 21:26:54,832 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:135, output treesize:153 [2018-12-02 21:26:59,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-02 21:26:59,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-02 21:26:59,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:59,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:59,128 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-02 21:26:59,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:18 [2018-12-02 21:26:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:26:59,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:26:59,968 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 21:27:00,142 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 21:27:00,246 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-02 21:27:00,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:00,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:00,615 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 62 treesize of output 59 [2018-12-02 21:27:00,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 21:27:00,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 21:27:00,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-02 21:27:00,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:00,637 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:00,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:00,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:00,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2018-12-02 21:27:00,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-02 21:27:00,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:00,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-12-02 21:27:00,974 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:01,019 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:27:01,261 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:01,294 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:01,443 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:01,456 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:01,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 21:27:01,588 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:145, output treesize:132 [2018-12-02 21:27:22,170 WARN L180 SmtUtils]: Spent 13.32 s on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-12-02 21:27:22,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:27:22,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:27:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:27:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:27:22,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:22,338 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-02 21:27:22,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:22,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:22,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:27:22,754 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 21:27:22,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:27:22,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 21:27:22,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:22,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:22,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:22,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-02 21:27:23,664 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 21:27:23,673 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 21 treesize of output 16 [2018-12-02 21:27:23,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:27:23,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:27:23,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:23,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:23,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:23,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:42 [2018-12-02 21:27:24,583 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 21:27:24,596 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 30 treesize of output 23 [2018-12-02 21:27:24,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:27:24,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:24,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:24,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:24,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2018-12-02 21:27:30,100 WARN L180 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-02 21:27:30,113 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 16 treesize of output 15 [2018-12-02 21:27:30,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2018-12-02 21:27:30,212 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-12-02 21:27:30,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:27:30,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:27:30,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:27:30,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:27:30,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:30,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 21:27:30,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:27:30,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:27:30,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,322 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:30,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:27:30,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:27:30,387 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:54, output treesize:91 [2018-12-02 21:27:32,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2018-12-02 21:27:32,729 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 45 treesize of output 40 [2018-12-02 21:27:32,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:32,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-12-02 21:27:32,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:32,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:27:32,858 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 53 treesize of output 47 [2018-12-02 21:27:32,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-02 21:27:32,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:32,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:32,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 21:27:32,920 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:111, output treesize:115 [2018-12-02 21:27:35,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-02 21:27:35,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 21:27:35,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:35,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:35,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:35,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-12-02 21:27:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:27:35,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:37,134 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-12-02 21:27:37,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:37,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:37,823 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 56 treesize of output 53 [2018-12-02 21:27:37,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 21:27:37,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 21:27:37,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-02 21:27:37,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:37,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:37,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:37,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:38,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-02 21:27:38,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-02 21:27:38,172 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:38,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-02 21:27:38,202 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:38,240 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:27:38,465 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:38,498 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:27:38,615 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:38,626 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:38,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-02 21:27:38,779 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:133, output treesize:114 [2018-12-02 21:27:56,127 WARN L180 SmtUtils]: Spent 11.50 s on a formula simplification that was a NOOP. DAG size: 60 [2018-12-02 21:27:56,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:27:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 30 [2018-12-02 21:27:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 21:27:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 21:27:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1133, Unknown=10, NotChecked=0, Total=1260 [2018-12-02 21:27:56,145 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 31 states. [2018-12-02 21:28:08,561 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 72 [2018-12-02 21:28:13,239 WARN L180 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2018-12-02 21:28:17,644 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2018-12-02 21:28:20,319 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2018-12-02 21:28:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:28:34,164 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-02 21:28:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 21:28:34,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-12-02 21:28:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:28:34,165 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:28:34,165 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:28:34,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 74.4s TimeCoverageRelationStatistics Valid=208, Invalid=1852, Unknown=10, NotChecked=0, Total=2070 [2018-12-02 21:28:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:28:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2018-12-02 21:28:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 21:28:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-02 21:28:34,167 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 56 [2018-12-02 21:28:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:28:34,167 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-02 21:28:34,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 21:28:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-02 21:28:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:28:34,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:28:34,167 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:28:34,168 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:28:34,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:28:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 826897305, now seen corresponding path program 1 times [2018-12-02 21:28:34,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:28:34,168 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:28:34,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:28:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:28:34,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:28:34,476 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-02 21:28:34,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:34,483 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-02 21:28:34,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:34,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:34,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:28:36,980 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 21:28:37,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:37,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:28:37,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:37,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:37,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 21:28:37,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-12-02 21:28:37,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-12-02 21:28:37,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:28:37,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:28:37,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-02 21:28:37,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:37,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:28:37,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:37,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:28:37,652 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,673 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:37,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:28:37,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:28:37,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 21:28:37,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 21:28:38,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:28:38,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:28:38,013 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,019 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,030 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,075 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:28:38,112 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:84, output treesize:115 [2018-12-02 21:28:38,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:38,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 21:28:38,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 21:28:38,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:38,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:28:38,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 21:28:38,620 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-12-02 21:28:38,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-02 21:28:38,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:38,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:28:38,669 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:84, output treesize:26 [2018-12-02 21:28:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-02 21:28:38,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:28:39,840 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 21:28:40,070 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 21:28:40,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:28:40,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:00,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:00,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:13,381 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:13,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:25,137 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:25,194 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:33,239 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:33,280 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:41,660 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:41,723 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:47,505 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:29:47,520 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:29:52,134 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 21:29:52,166 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:29:55,482 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:55,500 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:57,271 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:57,333 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:58,936 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:58,964 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:29:59,998 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:00,043 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:01,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-12-02 21:30:01,025 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:433, output treesize:351 [2018-12-02 21:30:14,654 WARN L180 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2018-12-02 21:30:14,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:14,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:14,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:14,913 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-02 21:30:14,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:14,921 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-02 21:30:14,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:14,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:14,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:30:15,871 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 21:30:20,077 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-02 21:30:24,382 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-02 21:30:26,408 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))))) is different from true [2018-12-02 21:30:26,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:26,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:26,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:30:26,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:26,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-02 21:30:26,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:26,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 21:30:26,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 21:30:26,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:30:26,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:30:26,843 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:26,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:26,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:26,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2018-12-02 21:30:27,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-12-02 21:30:27,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:30:27,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:30:27,097 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,103 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,113 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-02 21:30:27,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:27,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:30:27,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:27,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:30:27,219 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,227 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,236 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:27,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:30:27,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:30:27,312 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:84, output treesize:119 [2018-12-02 21:30:27,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:27,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 21:30:27,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 21:30:27,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:27,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:27,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:30:27,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 21:30:28,010 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-12-02 21:30:28,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:28,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-02 21:30:28,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:30:28,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:30:28,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:28,050 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:82, output treesize:24 [2018-12-02 21:30:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-02 21:30:28,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:29,204 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-02 21:30:29,424 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 21:30:29,527 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 21:30:29,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:36,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:36,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:40,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:40,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:45,054 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:45,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:48,706 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:48,766 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:52,746 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:52,785 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:55,953 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:55,974 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:59,644 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:30:59,705 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:31:02,716 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:31:02,757 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:31:05,010 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:31:05,052 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:31:06,808 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:06,822 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:07,971 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:07,983 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:09,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 12 dim-2 vars, End of recursive call: 22 dim-0 vars, and 6 xjuncts. [2018-12-02 21:31:09,232 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 22 variables, input treesize:433, output treesize:351 [2018-12-02 21:31:39,946 WARN L180 SmtUtils]: Spent 13.78 s on a formula simplification. DAG size of input: 162 DAG size of output: 105 [2018-12-02 21:31:39,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:31:39,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 29 [2018-12-02 21:31:39,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 21:31:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 21:31:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=997, Unknown=10, NotChecked=130, Total=1260 [2018-12-02 21:31:39,963 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 30 states. [2018-12-02 21:31:50,321 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-02 21:31:53,530 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-02 21:31:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:31:56,466 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-02 21:31:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 21:31:56,467 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-12-02 21:31:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:31:56,467 INFO L225 Difference]: With dead ends: 115 [2018-12-02 21:31:56,467 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 21:31:56,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 72.8s TimeCoverageRelationStatistics Valid=190, Invalid=1697, Unknown=13, NotChecked=170, Total=2070 [2018-12-02 21:31:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 21:31:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-12-02 21:31:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 21:31:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-02 21:31:56,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 56 [2018-12-02 21:31:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:31:56,469 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-02 21:31:56,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 21:31:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-02 21:31:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:31:56,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:31:56,470 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:31:56,470 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:31:56,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:31:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash 79362233, now seen corresponding path program 1 times [2018-12-02 21:31:56,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:31:56,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:31:56,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:31:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:31:56,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:31:56,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 21:31:56,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 21:31:56,802 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-02 21:31:56,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:31:56,894 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-02 21:31:56,895 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-02 21:31:56,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:56,907 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-02 21:31:56,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-02 21:31:59,480 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 21:31:59,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:31:59,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:31:59,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:31:59,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2018-12-02 21:31:59,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:59,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 21:31:59,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 21:31:59,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:31:59,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:31:59,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:31:59,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:31:59,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 71 [2018-12-02 21:32:00,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-12-02 21:32:00,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:32:00,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:32:00,156 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-12-02 21:32:00,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:00,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:32:00,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:00,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:32:00,290 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,298 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,312 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:00,340 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:00,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:00,389 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:86, output treesize:163 [2018-12-02 21:32:00,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:00,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 21:32:00,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 21:32:00,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:00,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:00,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:86 [2018-12-02 21:32:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:01,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:01,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2018-12-02 21:32:01,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-12-02 21:32:01,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:01,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-12-02 21:32:01,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:01,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-12-02 21:32:01,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:01,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-12-02 21:32:01,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:01,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-12-02 21:32:01,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:01,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:01,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:01,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:67 [2018-12-02 21:32:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-02 21:32:01,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:32:02,664 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 21:32:02,871 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 21:32:02,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:03,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:03,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:03,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:03,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:03,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:04,123 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:04,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:04,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:04,265 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:165, output treesize:189 [2018-12-02 21:32:15,434 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 71 [2018-12-02 21:32:15,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:32:15,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:32:15,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:32:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:32:15,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:32:15,664 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-02 21:32:15,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:15,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:15,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:32:15,685 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-02 21:32:15,686 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-02 21:32:15,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:15,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:15,699 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-02 21:32:15,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-02 21:32:15,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:15,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:16,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:16,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2018-12-02 21:32:16,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,278 INFO L303 Elim1Store]: Index analysis took 131 ms [2018-12-02 21:32:16,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 72 [2018-12-02 21:32:16,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2018-12-02 21:32:16,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:32:16,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:32:16,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-12-02 21:32:16,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:16,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:32:16,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:16,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:32:16,664 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:16,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:16,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:17,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 21:32:17,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 21:32:17,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:32:17,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:32:17,145 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,152 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:17,260 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:86, output treesize:161 [2018-12-02 21:32:17,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:17,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 21:32:17,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 21:32:17,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:17,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:86 [2018-12-02 21:32:17,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:17,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:17,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2018-12-02 21:32:17,445 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2018-12-02 21:32:17,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:17,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 21:32:17,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:17,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-02 21:32:17,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-12-02 21:32:17,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:17,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-12-02 21:32:17,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:17,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:17,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:17,706 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:69 [2018-12-02 21:32:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-02 21:32:17,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:32:21,773 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-02 21:32:21,960 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 21:32:22,081 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-02 21:32:22,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:22,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:22,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:22,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:23,326 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:23,379 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:23,628 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:23,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:23,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:23,869 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:185, output treesize:237 [2018-12-02 21:32:33,233 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 75 [2018-12-02 21:32:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:32:33,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 27 [2018-12-02 21:32:33,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 21:32:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 21:32:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1347, Unknown=7, NotChecked=74, Total=1560 [2018-12-02 21:32:33,251 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 28 states. [2018-12-02 21:32:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:32:43,050 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-02 21:32:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 21:32:43,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-12-02 21:32:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:32:43,051 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:32:43,051 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:32:43,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=234, Invalid=2211, Unknown=9, NotChecked=96, Total=2550 [2018-12-02 21:32:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:32:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-02 21:32:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:32:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-12-02 21:32:43,053 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 58 [2018-12-02 21:32:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:32:43,054 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-12-02 21:32:43,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 21:32:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-12-02 21:32:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:32:43,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:32:43,054 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:32:43,054 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 21:32:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:32:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash 79362234, now seen corresponding path program 1 times [2018-12-02 21:32:43,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:32:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e88c2f91-6e4d-489c-b3b5-46cf1d3d6f60/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:32:43,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:32:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:32:43,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:32:43,449 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-02 21:32:43,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,460 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-02 21:32:43,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:32:43,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:43,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:43,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:32:43,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:32:43,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-12-02 21:32:43,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:32:43,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:32:43,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:32:43,814 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-02 21:32:43,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:43,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:63 [2018-12-02 21:32:46,716 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 21:32:46,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:46,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:46,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-12-02 21:32:46,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:46,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:46,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:46,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:46,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-02 21:32:46,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,262 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-12-02 21:32:47,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 90 [2018-12-02 21:32:47,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-12-02 21:32:47,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:32:47,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:32:47,363 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-12-02 21:32:47,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:47,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:32:47,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:47,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:32:47,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,756 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:47,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:47,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:48,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 124 [2018-12-02 21:32:48,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 115 [2018-12-02 21:32:48,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-02 21:32:48,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 21:32:48,322 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,330 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,356 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,464 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 84 [2018-12-02 21:32:48,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-02 21:32:48,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:48,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 21:32:48,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:48,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-02 21:32:48,532 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,542 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,548 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,571 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:48,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:48,654 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:137, output treesize:194 [2018-12-02 21:32:49,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:49,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 69 [2018-12-02 21:32:49,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:32:49,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2018-12-02 21:32:49,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:49,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:32:49,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:49,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:32:49,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 83 [2018-12-02 21:32:49,529 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 84 [2018-12-02 21:32:49,530 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:49,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-12-02 21:32:49,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:49,689 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:32:49,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 21:32:49,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:49,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-12-02 21:32:49,763 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:32:49,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:32:49,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-12-02 21:32:49,852 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:49,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:49,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:32:49,941 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:158, output treesize:87 [2018-12-02 21:32:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 21:32:50,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:32:52,064 WARN L180 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 21:32:52,278 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 21:32:52,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:32:52,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:10,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:10,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:30,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:30,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:46,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:46,518 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:56,316 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:33:56,377 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:07,404 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:07,449 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:17,873 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:17,968 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:24,187 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:24,236 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:29,807 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:29,857 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:33,328 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:33,400 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:35,393 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:35,441 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:37,850 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:37,918 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:34:39,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-12-02 21:34:39,627 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:525, output treesize:765 [2018-12-02 21:34:40,066 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 21:34:40,267 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:34:40,268 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-02 21:34:40,273 INFO L168 Benchmark]: Toolchain (without parser) took 856329.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:34:40,274 INFO L168 Benchmark]: CDTParser took 0.13 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-02 21:34:40,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:34:40,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:34:40,275 INFO L168 Benchmark]: Boogie Preprocessor took 22.17 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:34:40,275 INFO L168 Benchmark]: RCFGBuilder took 435.42 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:34:40,275 INFO L168 Benchmark]: TraceAbstraction took 855554.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:34:40,277 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.17 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.42 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 855554.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...