./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 17:11:13,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:11:13,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:11:13,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:11:13,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:11:13,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:11:13,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:11:13,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:11:13,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:11:13,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:11:13,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:11:13,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:11:13,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:11:13,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:11:13,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:11:13,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:11:13,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:11:13,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:11:13,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:11:13,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:11:13,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:11:13,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:11:13,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:11:13,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:11:13,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:11:13,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:11:13,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:11:13,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:11:13,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:11:13,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:11:13,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:11:13,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:11:13,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:11:13,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:11:13,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:11:13,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:11:13,435 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 17:11:13,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:11:13,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:11:13,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:11:13,443 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:11:13,443 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:11:13,443 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:11:13,444 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:11:13,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:11:13,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:11:13,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:11:13,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:11:13,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:11:13,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:11:13,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:11:13,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:11:13,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:11:13,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:11:13,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:11:13,447 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_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 -> 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b [2018-12-02 17:11:13,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:11:13,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:11:13,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:11:13,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:11:13,474 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:11:13,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:13,509 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/30e0c3596/d9c01ecf624243c5ae57f8ac154b7a9b/FLAGf4b3cb023 [2018-12-02 17:11:13,873 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:11:13,874 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:13,881 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/30e0c3596/d9c01ecf624243c5ae57f8ac154b7a9b/FLAGf4b3cb023 [2018-12-02 17:11:13,889 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/30e0c3596/d9c01ecf624243c5ae57f8ac154b7a9b [2018-12-02 17:11:13,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:11:13,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:11:13,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:11:13,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:11:13,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:11:13,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:13" (1/1) ... [2018-12-02 17:11:13,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fc0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:13, skipping insertion in model container [2018-12-02 17:11:13,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:13" (1/1) ... [2018-12-02 17:11:13,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:11:13,928 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:11:14,158 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:14,167 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:11:14,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:14,248 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:11:14,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14 WrapperNode [2018-12-02 17:11:14,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:11:14,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:11:14,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:11:14,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:11:14,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:11:14,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:11:14,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:11:14,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:11:14,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... [2018-12-02 17:11:14,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:11:14,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:11:14,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:11:14,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:11:14,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-02 17:11:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-02 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-02 17:11:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-02 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure probe_19 [2018-12-02 17:11:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-12-02 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-02 17:11:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-02 17:11:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 17:11:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:11:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:11:14,519 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:11:14,519 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 17:11:14,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:11:14 BoogieIcfgContainer [2018-12-02 17:11:14,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:11:14,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:11:14,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:11:14,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:11:14,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:11:13" (1/3) ... [2018-12-02 17:11:14,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae3d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:11:14, skipping insertion in model container [2018-12-02 17:11:14,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:14" (2/3) ... [2018-12-02 17:11:14,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae3d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:11:14, skipping insertion in model container [2018-12-02 17:11:14,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:11:14" (3/3) ... [2018-12-02 17:11:14,524 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:14,529 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:11:14,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-02 17:11:14,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-02 17:11:14,557 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:11:14,557 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 17:11:14,557 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:11:14,557 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:11:14,557 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:11:14,557 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:11:14,557 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:11:14,557 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:11:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-02 17:11:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 17:11:14,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:14,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:14,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:14,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -364091227, now seen corresponding path program 1 times [2018-12-02 17:11:14,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:14,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:14,744 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 17:11:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:14,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:14,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:11:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:11:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:11:14,763 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 7 states. [2018-12-02 17:11:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:15,063 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-02 17:11:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:11:15,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 17:11:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:15,072 INFO L225 Difference]: With dead ends: 149 [2018-12-02 17:11:15,072 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 17:11:15,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:11:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 17:11:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 82. [2018-12-02 17:11:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 17:11:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-12-02 17:11:15,105 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2018-12-02 17:11:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:15,106 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-12-02 17:11:15,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:11:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-02 17:11:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 17:11:15,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:15,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:15,107 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:15,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -364091226, now seen corresponding path program 1 times [2018-12-02 17:11:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:15,208 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 17:11:15,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:15,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:15,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:15,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:11:15,211 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 8 states. [2018-12-02 17:11:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:15,610 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2018-12-02 17:11:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:11:15,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 17:11:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:15,611 INFO L225 Difference]: With dead ends: 145 [2018-12-02 17:11:15,612 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 17:11:15,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:11:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 17:11:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-12-02 17:11:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 17:11:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-12-02 17:11:15,621 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 15 [2018-12-02 17:11:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:15,621 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-12-02 17:11:15,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:11:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-12-02 17:11:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:15,622 INFO L402 BasicCegarLoop]: trace histogram [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 17:11:15,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:15,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1509820408, now seen corresponding path program 1 times [2018-12-02 17:11:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:11:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:15,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:15,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:11:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:11:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:11:15,692 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 7 states. [2018-12-02 17:11:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:15,877 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2018-12-02 17:11:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:11:15,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 17:11:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:15,879 INFO L225 Difference]: With dead ends: 126 [2018-12-02 17:11:15,879 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 17:11:15,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:11:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 17:11:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2018-12-02 17:11:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 17:11:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-02 17:11:15,883 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2018-12-02 17:11:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:15,883 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-02 17:11:15,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:11:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-02 17:11:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:15,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:15,884 INFO L402 BasicCegarLoop]: trace histogram [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 17:11:15,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:15,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1509820409, now seen corresponding path program 1 times [2018-12-02 17:11:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:15,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:11:15,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 17:11:15,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:15,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 17:11:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:11:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:11:15,996 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 12 states. [2018-12-02 17:11:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,269 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2018-12-02 17:11:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:11:16,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-02 17:11:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,270 INFO L225 Difference]: With dead ends: 104 [2018-12-02 17:11:16,270 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 17:11:16,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-02 17:11:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 17:11:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-12-02 17:11:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 17:11:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-02 17:11:16,274 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 26 [2018-12-02 17:11:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,275 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-02 17:11:16,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 17:11:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-02 17:11:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:16,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1532388828, now seen corresponding path program 1 times [2018-12-02 17:11:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,312 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 17:11:16,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:16,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:16,313 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-12-02 17:11:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,338 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-12-02 17:11:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:11:16,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 17:11:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,339 INFO L225 Difference]: With dead ends: 82 [2018-12-02 17:11:16,339 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 17:11:16,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:11:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 17:11:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-02 17:11:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 17:11:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-02 17:11:16,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2018-12-02 17:11:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,343 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-02 17:11:16,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-02 17:11:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:16,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,344 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash -24837019, now seen corresponding path program 1 times [2018-12-02 17:11:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,377 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 17:11:16,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:16,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:16,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:11:16,378 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2018-12-02 17:11:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,456 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-12-02 17:11:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:11:16,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 17:11:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,457 INFO L225 Difference]: With dead ends: 95 [2018-12-02 17:11:16,457 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 17:11:16,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:11:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 17:11:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-12-02 17:11:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 17:11:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-02 17:11:16,460 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2018-12-02 17:11:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,461 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-02 17:11:16,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:11:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-02 17:11:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:16,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,461 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash -24837018, now seen corresponding path program 1 times [2018-12-02 17:11:16,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:11:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:16,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:16,499 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 6 states. [2018-12-02 17:11:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,517 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-02 17:11:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:11:16,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 17:11:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,518 INFO L225 Difference]: With dead ends: 89 [2018-12-02 17:11:16,518 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 17:11:16,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 17:11:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 17:11:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-02 17:11:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 17:11:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-12-02 17:11:16,522 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 26 [2018-12-02 17:11:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,522 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-12-02 17:11:16,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-12-02 17:11:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 17:11:16,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -768724897, now seen corresponding path program 1 times [2018-12-02 17:11:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,564 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 17:11:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:11:16,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:16,565 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 4 states. [2018-12-02 17:11:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,631 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-12-02 17:11:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:16,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 17:11:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,633 INFO L225 Difference]: With dead ends: 113 [2018-12-02 17:11:16,633 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 17:11:16,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 17:11:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-12-02 17:11:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 17:11:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-12-02 17:11:16,638 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 27 [2018-12-02 17:11:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,639 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-12-02 17:11:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-12-02 17:11:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 17:11:16,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,640 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,640 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash 840552866, now seen corresponding path program 1 times [2018-12-02 17:11:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:11:16,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:11:16,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:11:16,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:11:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:16,692 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2018-12-02 17:11:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,700 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-12-02 17:11:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:11:16,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 17:11:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,701 INFO L225 Difference]: With dead ends: 107 [2018-12-02 17:11:16,701 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 17:11:16,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 17:11:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-02 17:11:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 17:11:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-12-02 17:11:16,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 35 [2018-12-02 17:11:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,704 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-12-02 17:11:16,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:11:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-12-02 17:11:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 17:11:16,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,705 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,705 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1728056547, now seen corresponding path program 1 times [2018-12-02 17:11:16,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:11:16,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:16,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:16,746 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-12-02 17:11:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:16,776 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-12-02 17:11:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:11:16,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-02 17:11:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:16,777 INFO L225 Difference]: With dead ends: 103 [2018-12-02 17:11:16,777 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 17:11:16,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:11:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 17:11:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-02 17:11:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 17:11:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-02 17:11:16,781 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 35 [2018-12-02 17:11:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,781 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-02 17:11:16,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-02 17:11:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 17:11:16,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,783 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,783 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-02 17:11:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1434653540, now seen corresponding path program 1 times [2018-12-02 17:11:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:11:16,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:16,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:11:16,883 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-02 17:11:16,885 INFO L205 CegarAbsIntRunner]: [24], [26], [29], [30], [36], [37], [38], [41], [42], [43], [44], [45], [49], [61], [63], [66], [67], [74], [76], [79], [91], [94], [103], [105], [106], [107], [108], [109], [111], [115], [116], [117], [118] [2018-12-02 17:11:16,915 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:11:16,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:11:17,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:11:17,032 INFO L272 AbstractInterpreter]: Visited 33 different actions 41 times. Merged at 2 different actions 4 times. Never widened. Performed 324 root evaluator evaluations with a maximum evaluation depth of 3. Performed 324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-02 17:11:17,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:17,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:11:17,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:17,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:17,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:11:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:17,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:17,103 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 17:11:17,105 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 17:11:17,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 17:11:17,513 WARN L854 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-12-02 17:11:17,521 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 17:11:17,523 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 17 [2018-12-02 17:11:17,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,529 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 17:11:17,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-12-02 17:11:17,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:11:17,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:11:17,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:17,538 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 17:11:17,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 17:11:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:11:17,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:11:17,624 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 51 treesize of output 47 [2018-12-02 17:11:17,825 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:11:17,827 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) 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.computeBackwardSequence(IterativePredicateTransformer.java:418) 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.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 17:11:17,833 INFO L168 Benchmark]: Toolchain (without parser) took 3942.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -111.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:17,836 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:17,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:17,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.34 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 17:11:17,839 INFO L168 Benchmark]: Boogie Preprocessor took 17.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:17,840 INFO L168 Benchmark]: RCFGBuilder took 229.70 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:17,841 INFO L168 Benchmark]: TraceAbstraction took 3312.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:17,845 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.34 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 17.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.70 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3312.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -21.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) 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 17:11:19,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:11:19,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:11:19,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:11:19,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:11:19,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:11:19,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:11:19,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:11:19,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:11:19,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:11:19,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:11:19,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:11:19,135 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:11:19,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:11:19,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:11:19,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:11:19,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:11:19,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:11:19,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:11:19,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:11:19,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:11:19,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:11:19,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:11:19,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:11:19,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:11:19,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:11:19,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:11:19,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:11:19,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:11:19,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:11:19,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:11:19,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:11:19,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:11:19,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:11:19,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:11:19,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:11:19,146 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 17:11:19,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:11:19,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:11:19,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:11:19,154 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:11:19,154 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:11:19,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:11:19,154 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:11:19,154 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:11:19,155 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:11:19,155 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:11:19,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:11:19,155 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:11:19,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:11:19,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 17:11:19,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:11:19,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:11:19,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:11:19,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:11:19,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:11:19,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:11:19,158 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 17:11:19,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:11:19,158 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 17:11:19,158 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_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 -> 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b [2018-12-02 17:11:19,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:11:19,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:11:19,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:11:19,190 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:11:19,190 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:11:19,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:19,229 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/51e07e82d/12c99413249641dd8ca919c02d730f2e/FLAGad31ee3e1 [2018-12-02 17:11:19,673 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:11:19,674 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:19,684 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/51e07e82d/12c99413249641dd8ca919c02d730f2e/FLAGad31ee3e1 [2018-12-02 17:11:19,693 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/data/51e07e82d/12c99413249641dd8ca919c02d730f2e [2018-12-02 17:11:19,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:11:19,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:11:19,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:11:19,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:11:19,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:11:19,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:19" (1/1) ... [2018-12-02 17:11:19,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:19, skipping insertion in model container [2018-12-02 17:11:19,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:19" (1/1) ... [2018-12-02 17:11:19,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:11:19,727 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:11:19,922 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:19,935 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:11:20,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:20,060 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:11:20,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20 WrapperNode [2018-12-02 17:11:20,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:11:20,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:11:20,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:11:20,061 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:11:20,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:11:20,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:11:20,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:11:20,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:11:20,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... [2018-12-02 17:11:20,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:11:20,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:11:20,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:11:20,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:11:20,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-02 17:11:20,132 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-02 17:11:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-02 17:11:20,132 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure probe_19 [2018-12-02 17:11:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-02 17:11:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 17:11:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 17:11:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 17:11:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 17:11:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-02 17:11:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 17:11:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 17:11:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:11:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:11:20,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:11:20,361 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 17:11:20,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:11:20 BoogieIcfgContainer [2018-12-02 17:11:20,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:11:20,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:11:20,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:11:20,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:11:20,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:11:19" (1/3) ... [2018-12-02 17:11:20,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d51f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:11:20, skipping insertion in model container [2018-12-02 17:11:20,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:20" (2/3) ... [2018-12-02 17:11:20,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d51f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:11:20, skipping insertion in model container [2018-12-02 17:11:20,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:11:20" (3/3) ... [2018-12-02 17:11:20,366 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-02 17:11:20,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:11:20,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-02 17:11:20,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-02 17:11:20,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 17:11:20,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:11:20,398 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 17:11:20,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:11:20,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:11:20,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:11:20,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:11:20,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:11:20,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:11:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-02 17:11:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 17:11:20,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:20,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:20,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:20,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1778700408, now seen corresponding path program 1 times [2018-12-02 17:11:20,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:20,421 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:20,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:20,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:20,539 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 17:11:20,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:20,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:20,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:11:21,083 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 17:11:21,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:21,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:21,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 17:11:21,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:21,105 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 17:11:21,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 17:11:21,128 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 17:11:21,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:21,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:21,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:21,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-02 17:11:21,143 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 8 states. [2018-12-02 17:11:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:23,571 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-12-02 17:11:23,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:11:23,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 17:11:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:23,583 INFO L225 Difference]: With dead ends: 134 [2018-12-02 17:11:23,583 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 17:11:23,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-12-02 17:11:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 17:11:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 91. [2018-12-02 17:11:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 17:11:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2018-12-02 17:11:23,619 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2018-12-02 17:11:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:23,619 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2018-12-02 17:11:23,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:11:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2018-12-02 17:11:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 17:11:23,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:23,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:23,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:23,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:23,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1778700407, now seen corresponding path program 1 times [2018-12-02 17:11:23,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:23,622 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:23,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:23,691 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 17:11:23,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:23,701 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 17:11:23,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:23,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:23,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 17:11:25,152 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 17:11:25,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:25,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:25,165 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 17:11:25,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:25,177 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 17:11:25,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:25,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:25,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 17:11:25,196 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 17:11:25,196 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:25,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:25,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-02 17:11:25,200 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 8 states. [2018-12-02 17:11:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:25,614 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-02 17:11:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:11:25,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 17:11:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:25,616 INFO L225 Difference]: With dead ends: 130 [2018-12-02 17:11:25,616 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 17:11:25,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-02 17:11:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 17:11:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2018-12-02 17:11:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 17:11:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-12-02 17:11:25,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 15 [2018-12-02 17:11:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:25,623 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-12-02 17:11:25,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:11:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-12-02 17:11:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:25,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:25,624 INFO L402 BasicCegarLoop]: trace histogram [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 17:11:25,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:25,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:25,624 INFO L82 PathProgramCache]: Analyzing trace with hash 73867160, now seen corresponding path program 1 times [2018-12-02 17:11:25,625 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:25,625 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:25,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:25,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:26,037 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 17:11:26,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:26,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:26,044 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 17:11:26,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:26,051 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 17:11:26,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-02 17:11:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:11:26,066 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:26,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:26,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:26,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:26,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:26,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-02 17:11:26,068 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 8 states. [2018-12-02 17:11:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:28,366 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-12-02 17:11:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:11:28,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 17:11:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:28,367 INFO L225 Difference]: With dead ends: 114 [2018-12-02 17:11:28,367 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 17:11:28,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2018-12-02 17:11:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 17:11:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2018-12-02 17:11:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 17:11:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-12-02 17:11:28,372 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 26 [2018-12-02 17:11:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:28,372 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-12-02 17:11:28,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:11:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-12-02 17:11:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:28,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:28,373 INFO L402 BasicCegarLoop]: trace histogram [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 17:11:28,373 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:28,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash 73867161, now seen corresponding path program 1 times [2018-12-02 17:11:28,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:28,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:28,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:28,471 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 17:11:28,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,479 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 17:11:28,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 17:11:30,011 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 17:11:30,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,021 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 17:11:30,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,038 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 17:11:30,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 17:11:30,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,094 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 17:11:30,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,119 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 17:11:30,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-02 17:11:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:11:30,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:30,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:30,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 17:11:30,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 17:11:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 17:11:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-12-02 17:11:30,148 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 11 states. [2018-12-02 17:11:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:30,850 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-12-02 17:11:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 17:11:30,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-02 17:11:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:30,851 INFO L225 Difference]: With dead ends: 122 [2018-12-02 17:11:30,851 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 17:11:30,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2018-12-02 17:11:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 17:11:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-12-02 17:11:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 17:11:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-12-02 17:11:30,856 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 26 [2018-12-02 17:11:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:30,856 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2018-12-02 17:11:30,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 17:11:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2018-12-02 17:11:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 17:11:30,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:30,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:30,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:30,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 439120609, now seen corresponding path program 1 times [2018-12-02 17:11:30,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:30,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:30,911 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 17:11:30,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:30,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:30,913 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 6 states. [2018-12-02 17:11:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:30,932 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-12-02 17:11:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:11:30,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 17:11:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:30,933 INFO L225 Difference]: With dead ends: 97 [2018-12-02 17:11:30,933 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 17:11:30,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 17:11:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 17:11:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-02 17:11:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 17:11:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-12-02 17:11:30,937 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 26 [2018-12-02 17:11:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:30,937 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-12-02 17:11:30,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-12-02 17:11:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 17:11:30,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:30,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:30,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:30,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash 729089443, now seen corresponding path program 1 times [2018-12-02 17:11:30,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:11:30,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:30,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:31,004 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 17:11:31,006 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 17:11:31,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,016 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 17:11:31,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-02 17:11:31,027 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 20 treesize of output 16 [2018-12-02 17:11:31,029 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 16 treesize of output 4 [2018-12-02 17:11:31,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,032 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 17:11:31,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-12-02 17:11:31,039 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 17:11:31,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:31,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:31,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:11:31,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:31,042 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 6 states. [2018-12-02 17:11:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:31,126 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-02 17:11:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:11:31,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 17:11:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:31,127 INFO L225 Difference]: With dead ends: 99 [2018-12-02 17:11:31,127 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 17:11:31,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:11:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 17:11:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-02 17:11:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 17:11:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-02 17:11:31,132 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 27 [2018-12-02 17:11:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:31,132 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-02 17:11:31,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-02 17:11:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 17:11:31,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:31,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:31,133 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:11:31,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash 218555266, now seen corresponding path program 1 times [2018-12-02 17:11:31,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:11:31,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:11:31,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:31,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:31,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 17:11:31,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,218 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 9 [2018-12-02 17:11:31,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,223 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 15 treesize of output 17 [2018-12-02 17:11:31,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 17:11:31,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:31,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:31,250 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 2 xjuncts. [2018-12-02 17:11:31,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 17:11:33,283 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_8| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_entry_point_~#a19~0.base_8| (_ bv0 1))) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_8|) (_ bv0 1)))) is different from true [2018-12-02 17:11:33,300 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 17:11:33,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:11:33,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:33,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:11:33,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:11:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:11:33,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2018-12-02 17:11:33,303 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2018-12-02 17:11:53,429 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-02 17:12:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:12:19,642 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2018-12-02 17:12:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:12:19,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 17:12:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:12:19,644 INFO L225 Difference]: With dead ends: 135 [2018-12-02 17:12:19,644 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 17:12:19,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-12-02 17:12:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 17:12:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-12-02 17:12:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 17:12:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2018-12-02 17:12:19,650 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 27 [2018-12-02 17:12:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:12:19,650 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2018-12-02 17:12:19,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:12:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2018-12-02 17:12:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 17:12:19,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:12:19,651 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:12:19,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:12:19,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:12:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1599342211, now seen corresponding path program 1 times [2018-12-02 17:12:19,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:12:19,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:12:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:19,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:12:19,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:12:19,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:12:19,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:12:19,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:12:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:12:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:12:19,725 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2018-12-02 17:12:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:12:19,735 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-12-02 17:12:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:12:19,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-02 17:12:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:12:19,737 INFO L225 Difference]: With dead ends: 114 [2018-12-02 17:12:19,737 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 17:12:19,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:12:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 17:12:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-02 17:12:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 17:12:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2018-12-02 17:12:19,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 34 [2018-12-02 17:12:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:12:19,743 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2018-12-02 17:12:19,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:12:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-12-02 17:12:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 17:12:19,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:12:19,744 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:12:19,744 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:12:19,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:12:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash -325948579, now seen corresponding path program 1 times [2018-12-02 17:12:19,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:12:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:12:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:19,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:19,815 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 17:12:19,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:19,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:19,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 17:12:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:12:19,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:12:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:12:19,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:12:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:12:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:12:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:12:19,830 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 5 states. [2018-12-02 17:12:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:12:19,927 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-02 17:12:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:12:19,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-02 17:12:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:12:19,929 INFO L225 Difference]: With dead ends: 116 [2018-12-02 17:12:19,929 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 17:12:19,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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 17:12:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 17:12:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-12-02 17:12:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-02 17:12:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-12-02 17:12:19,934 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 34 [2018-12-02 17:12:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:12:19,935 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-12-02 17:12:19,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:12:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-12-02 17:12:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 17:12:19,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:12:19,936 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:12:19,936 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:12:19,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:12:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1570713059, now seen corresponding path program 1 times [2018-12-02 17:12:19,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:12:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:12:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:20,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:20,014 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 17:12:20,016 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 8 treesize of output 7 [2018-12-02 17:12:20,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,025 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 17:12:20,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 17:12:20,034 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 16 treesize of output 12 [2018-12-02 17:12:20,036 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 12 treesize of output 4 [2018-12-02 17:12:20,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,037 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 17:12:20,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-02 17:12:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:12:20,043 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:12:20,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:12:20,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:12:20,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:12:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:12:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:12:20,046 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 6 states. [2018-12-02 17:12:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:12:20,137 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-02 17:12:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:12:20,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-02 17:12:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:12:20,138 INFO L225 Difference]: With dead ends: 108 [2018-12-02 17:12:20,138 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 17:12:20,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:12:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 17:12:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-02 17:12:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 17:12:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2018-12-02 17:12:20,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 34 [2018-12-02 17:12:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:12:20,143 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-12-02 17:12:20,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:12:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2018-12-02 17:12:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 17:12:20,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:12:20,144 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:12:20,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:12:20,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:12:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1740867549, now seen corresponding path program 1 times [2018-12-02 17:12:20,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:12:20,145 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:12:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:20,265 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 17:12:20,267 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 17:12:20,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:20,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-02 17:12:21,578 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-02 17:12:21,586 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 17:12:21,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:12:21,590 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 17:12:21,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,602 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 17:12:21,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-02 17:12:21,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:12:21,606 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 17:12:21,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,608 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 17:12:21,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:12:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:12:21,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:12:21,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:12:21,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:12:21,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:21,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:21,828 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 17:12:21,830 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 17:12:21,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 17:12:21,847 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 17:12:21,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:12:21,852 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 17:12:21,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,872 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 17:12:21,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 17:12:21,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:12:21,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:12:21,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:21,880 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 17:12:21,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 17:12:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:12:21,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:12:21,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:12:21,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2018-12-02 17:12:21,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 17:12:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 17:12:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2018-12-02 17:12:21,977 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 14 states. [2018-12-02 17:12:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:12:22,528 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2018-12-02 17:12:22,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 17:12:22,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-02 17:12:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:12:22,529 INFO L225 Difference]: With dead ends: 123 [2018-12-02 17:12:22,529 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 17:12:22,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2018-12-02 17:12:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 17:12:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-02 17:12:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 17:12:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2018-12-02 17:12:22,533 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 35 [2018-12-02 17:12:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:12:22,533 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2018-12-02 17:12:22,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 17:12:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2018-12-02 17:12:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 17:12:22,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:12:22,534 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:12:22,534 INFO L423 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:12:22,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:12:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1867680955, now seen corresponding path program 1 times [2018-12-02 17:12:22,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:12:22,535 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:12:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:22,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:22,634 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 17:12:22,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:22,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:22,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:12:22,661 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 17:12:22,663 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 17:12:22,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:22,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:22,674 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 17:12:22,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-12-02 17:12:27,902 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 17:12:27,911 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 23 treesize of output 18 [2018-12-02 17:12:27,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:12:27,918 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 17:12:27,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:27,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:27,933 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 17:12:27,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-12-02 17:12:27,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:12:27,938 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 17:12:27,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:27,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:27,943 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 17:12:27,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-02 17:12:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:12:27,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:12:30,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:12:30,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:12:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:12:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:12:30,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:12:30,229 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 17:12:30,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:12:30,263 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 17:12:30,265 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 17:12:30,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,274 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 17:12:30,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-12-02 17:12:30,287 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 23 treesize of output 18 [2018-12-02 17:12:30,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:12:30,292 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 17:12:30,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,309 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 17:12:30,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-02 17:12:30,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 17:12:30,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-02 17:12:30,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:12:30,316 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 17:12:30,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-02 17:12:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:12:30,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:12:30,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:12:30,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2018-12-02 17:12:30,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 17:12:30,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 17:12:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=225, Unknown=4, NotChecked=0, Total=272 [2018-12-02 17:12:30,457 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 15 states. [2018-12-02 17:13:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:23,963 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2018-12-02 17:13:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:13:23,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-12-02 17:13:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:23,964 INFO L225 Difference]: With dead ends: 132 [2018-12-02 17:13:23,965 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 17:13:23,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=96, Invalid=450, Unknown=6, NotChecked=0, Total=552 [2018-12-02 17:13:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 17:13:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-12-02 17:13:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-02 17:13:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2018-12-02 17:13:23,969 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 36 [2018-12-02 17:13:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:23,969 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2018-12-02 17:13:23,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 17:13:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2018-12-02 17:13:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 17:13:23,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:23,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:23,971 INFO L423 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:23,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -209528388, now seen corresponding path program 1 times [2018-12-02 17:13:23,971 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:23,971 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:13:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:24,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:24,062 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 17:13:24,064 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 17:13:24,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,081 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 17:13:24,083 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 17:13:24,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-02 17:13:24,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:13:24,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:13:24,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:13:24,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:13:24,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-02 17:13:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:13:24,135 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:24,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:24,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:13:24,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:13:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:13:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:13:24,137 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand 6 states. [2018-12-02 17:13:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:24,224 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-12-02 17:13:24,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:13:24,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-02 17:13:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:24,225 INFO L225 Difference]: With dead ends: 104 [2018-12-02 17:13:24,225 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 17:13:24,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:13:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 17:13:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 17:13:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 17:13:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-12-02 17:13:24,229 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-12-02 17:13:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:24,229 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-12-02 17:13:24,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:13:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-12-02 17:13:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 17:13:24,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:24,230 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:24,230 INFO L423 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:24,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash -309113979, now seen corresponding path program 1 times [2018-12-02 17:13:24,231 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:24,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:24,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:24,305 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 17:13:24,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:24,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 17:13:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:13:24,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:24,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:24,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:13:24,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:13:24,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:13:24,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:13:24,342 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 8 states. [2018-12-02 17:13:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:24,572 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-12-02 17:13:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:13:24,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-02 17:13:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:24,573 INFO L225 Difference]: With dead ends: 117 [2018-12-02 17:13:24,574 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 17:13:24,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 17:13:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 17:13:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-02 17:13:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 17:13:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-12-02 17:13:24,578 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 41 [2018-12-02 17:13:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:24,578 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-12-02 17:13:24,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:13:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-12-02 17:13:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 17:13:24,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:24,578 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:24,579 INFO L423 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:24,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -309113978, now seen corresponding path program 1 times [2018-12-02 17:13:24,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:24,579 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:24,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:13:24,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:24,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:24,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 17:13:24,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 17:13:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 17:13:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 17:13:24,796 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 11 states. [2018-12-02 17:13:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:25,397 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-02 17:13:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:13:25,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-12-02 17:13:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:25,399 INFO L225 Difference]: With dead ends: 108 [2018-12-02 17:13:25,400 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 17:13:25,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-02 17:13:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 17:13:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-02 17:13:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 17:13:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-12-02 17:13:25,402 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 41 [2018-12-02 17:13:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-12-02 17:13:25,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 17:13:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-12-02 17:13:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 17:13:25,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:25,402 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:25,403 INFO L423 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:25,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -992598774, now seen corresponding path program 1 times [2018-12-02 17:13:25,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:25,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:25,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:25,522 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 17:13:25,524 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 17:13:25,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:25,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:25,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:25,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 17:13:25,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:13:25,610 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 17:13:25,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:25,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:25,612 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 17:13:25,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:13:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:13:25,624 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:25,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:25,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 17:13:25,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 17:13:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 17:13:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:13:25,626 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 14 states. [2018-12-02 17:13:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:26,215 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-12-02 17:13:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 17:13:26,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-12-02 17:13:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:26,217 INFO L225 Difference]: With dead ends: 107 [2018-12-02 17:13:26,217 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 17:13:26,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:13:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 17:13:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-02 17:13:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 17:13:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-02 17:13:26,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 42 [2018-12-02 17:13:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:26,220 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-02 17:13:26,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 17:13:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-02 17:13:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 17:13:26,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:26,221 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:26,221 INFO L423 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:26,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -705790875, now seen corresponding path program 1 times [2018-12-02 17:13:26,222 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:26,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:13:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:26,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:26,321 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 17:13:26,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-02 17:13:26,334 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 17:13:26,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:13:26,364 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 17:13:26,366 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 17:13:26,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,372 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 17:13:26,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 17:13:26,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:13:26,460 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 17:13:26,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:26,462 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 17:13:26,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 17:13:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:13:26,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:26,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:26,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 17:13:26,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 17:13:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 17:13:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:13:26,480 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 14 states. [2018-12-02 17:13:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:27,607 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-12-02 17:13:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 17:13:27,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-02 17:13:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:27,608 INFO L225 Difference]: With dead ends: 127 [2018-12-02 17:13:27,608 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 17:13:27,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:13:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 17:13:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-12-02 17:13:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-02 17:13:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-12-02 17:13:27,610 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2018-12-02 17:13:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:27,611 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-12-02 17:13:27,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 17:13:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-12-02 17:13:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 17:13:27,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:27,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:27,611 INFO L423 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:27,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash -494439962, now seen corresponding path program 1 times [2018-12-02 17:13:27,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:27,612 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:27,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:27,726 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 17:13:27,728 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 17:13:27,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:27,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:27,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:27,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 17:13:27,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:13:27,808 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 17:13:27,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:27,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:27,811 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 17:13:27,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:13:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:13:27,826 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:27,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:27,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 17:13:27,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 17:13:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 17:13:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:13:27,828 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 14 states. [2018-12-02 17:13:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:28,393 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-12-02 17:13:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 17:13:28,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-02 17:13:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:28,394 INFO L225 Difference]: With dead ends: 152 [2018-12-02 17:13:28,395 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 17:13:28,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-12-02 17:13:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 17:13:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-12-02 17:13:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 17:13:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-12-02 17:13:28,398 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 43 [2018-12-02 17:13:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:28,398 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-02 17:13:28,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 17:13:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-12-02 17:13:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:13:28,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:28,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:28,399 INFO L423 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:28,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1002486348, now seen corresponding path program 1 times [2018-12-02 17:13:28,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:13:28,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:28,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:28,479 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 17:13:28,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:28,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:28,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-02 17:13:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:13:28,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:28,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:28,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 17:13:28,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 17:13:28,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:13:28,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:13:28,534 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 10 states. [2018-12-02 17:13:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:28,935 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-12-02 17:13:28,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:13:28,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-02 17:13:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:28,936 INFO L225 Difference]: With dead ends: 128 [2018-12-02 17:13:28,936 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 17:13:28,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:13:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 17:13:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-12-02 17:13:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 17:13:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-02 17:13:28,939 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 45 [2018-12-02 17:13:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:28,939 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-02 17:13:28,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 17:13:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-02 17:13:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:13:28,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:28,940 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:28,940 INFO L423 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:28,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1002486349, now seen corresponding path program 1 times [2018-12-02 17:13:28,941 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:28,941 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:28,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:29,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:29,058 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 17:13:29,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:29,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 17:13:29,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:29,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:29,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 17:13:29,817 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 17:13:32,533 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-02 17:13:34,513 WARN L180 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-02 17:13:36,554 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-02 17:13:36,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:36,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:36,566 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 17:13:36,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:36,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 17:13:36,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:26 [2018-12-02 17:13:38,630 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 17:13:38,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 17:13:38,653 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 17:13:38,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 17:13:38,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:13:38,701 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 17:13:38,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:38,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:13:38,727 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:26, output treesize:7 [2018-12-02 17:13:38,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:38,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:38,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 4 [2018-12-02 17:13:38,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:38,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-12-02 17:13:38,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 30 [2018-12-02 17:13:38,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 17:13:38,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:13:38,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:38,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:43, output treesize:11 [2018-12-02 17:13:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:13:38,918 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:38,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:38,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 17:13:38,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 17:13:38,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 17:13:38,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=152, Unknown=3, NotChecked=24, Total=210 [2018-12-02 17:13:38,921 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 15 states. [2018-12-02 17:13:46,503 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 17:13:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:57,918 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-12-02 17:13:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 17:13:57,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-02 17:13:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:57,919 INFO L225 Difference]: With dead ends: 135 [2018-12-02 17:13:57,919 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 17:13:57,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=50, Invalid=257, Unknown=3, NotChecked=32, Total=342 [2018-12-02 17:13:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 17:13:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2018-12-02 17:13:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 17:13:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-12-02 17:13:57,921 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-12-02 17:13:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:57,922 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-12-02 17:13:57,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 17:13:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-12-02 17:13:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 17:13:57,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:57,922 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:57,923 INFO L423 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:57,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1171715165, now seen corresponding path program 1 times [2018-12-02 17:13:57,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:57,923 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:13:57,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:57,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:13:57,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:13:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:13:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 17:13:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:13:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:13:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:13:57,999 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 8 states. [2018-12-02 17:13:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:13:58,031 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-12-02 17:13:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:13:58,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-02 17:13:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:13:58,032 INFO L225 Difference]: With dead ends: 124 [2018-12-02 17:13:58,032 INFO L226 Difference]: Without dead ends: 124 [2018-12-02 17:13:58,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:13:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-02 17:13:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-02 17:13:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 17:13:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-12-02 17:13:58,034 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 44 [2018-12-02 17:13:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:13:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-12-02 17:13:58,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:13:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-12-02 17:13:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 17:13:58,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:13:58,035 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:13:58,035 INFO L423 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:13:58,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:13:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1943975022, now seen corresponding path program 1 times [2018-12-02 17:13:58,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:13:58,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:13:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:13:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:13:58,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:13:58,204 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 17:13:58,206 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 17:13:58,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:58,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:58,214 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 17:13:58,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-02 17:13:58,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:58,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:13:58,232 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 17:13:58,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:58,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:13:58,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-12-02 17:13:58,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 17:13:58,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:13:58,305 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 17:13:58,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 17:14:04,336 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 17:14:06,373 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 17:14:08,414 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 17:14:10,454 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 17:14:10,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:14:10,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-12-02 17:14:10,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:14:10,477 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 18 treesize of output 22 [2018-12-02 17:14:10,479 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 18 treesize of output 16 [2018-12-02 17:14:10,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:14:10,489 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 17:14:10,490 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 17:14:10,502 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 14 treesize of output 10 [2018-12-02 17:14:10,502 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 17:14:10,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 17:14:10,524 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 17:14:10,524 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-12-02 17:14:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:14:10,568 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:14:10,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:14:10,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 17:14:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 17:14:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 17:14:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=261, Unknown=2, NotChecked=0, Total=306 [2018-12-02 17:14:10,571 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 18 states. [2018-12-02 17:15:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:15:40,419 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-02 17:15:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 17:15:40,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-02 17:15:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:15:40,420 INFO L225 Difference]: With dead ends: 137 [2018-12-02 17:15:40,420 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 17:15:40,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=122, Invalid=744, Unknown=4, NotChecked=0, Total=870 [2018-12-02 17:15:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 17:15:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2018-12-02 17:15:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 17:15:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-12-02 17:15:40,424 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 46 [2018-12-02 17:15:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:15:40,424 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-02 17:15:40,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 17:15:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-12-02 17:15:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 17:15:40,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:15:40,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:15:40,425 INFO L423 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:15:40,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:15:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1943975023, now seen corresponding path program 1 times [2018-12-02 17:15:40,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:15:40,426 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:15:40,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:15:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:15:40,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:15:40,544 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 17:15:40,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:40,555 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 17:15:40,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:40,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:15:40,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 17:15:41,533 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 17:15:41,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:41,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:41,539 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 17:15:41,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:41,552 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 17:15:41,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:41,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:15:41,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 17:15:42,607 WARN L180 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 17:15:43,874 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 17:15:43,881 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 17:15:43,883 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 17:15:43,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:43,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:15:43,901 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 17:15:43,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-12-02 17:15:45,059 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 17:15:47,117 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 17:15:47,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:47,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:47,126 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 17:15:47,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:15:47,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2018-12-02 17:15:47,358 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 17 treesize of output 21 [2018-12-02 17:15:47,361 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 17 treesize of output 15 [2018-12-02 17:15:47,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,374 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 13 treesize of output 12 [2018-12-02 17:15:47,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:15:47,382 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 17:15:47,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2018-12-02 17:15:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-12-02 17:15:47,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:15:47,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:15:47,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:15:47,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:15:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:15:47,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:15:52,600 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 17:15:53,963 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 17:15:53,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:53,977 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 14 treesize of output 17 [2018-12-02 17:15:53,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:54,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:54,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:15:54,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 17:15:54,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:15:54,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:15:54,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2018-12-02 17:15:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:15:54,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:15:54,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:15:54,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-12-02 17:15:54,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 17:15:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 17:15:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=563, Unknown=3, NotChecked=48, Total=702 [2018-12-02 17:15:54,459 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 25 states. [2018-12-02 17:16:08,484 WARN L180 SmtUtils]: Spent 8.01 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-02 17:16:11,240 WARN L180 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-02 17:16:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:25,665 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-02 17:16:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 17:16:25,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-02 17:16:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:25,666 INFO L225 Difference]: With dead ends: 162 [2018-12-02 17:16:25,666 INFO L226 Difference]: Without dead ends: 162 [2018-12-02 17:16:25,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=209, Invalid=1351, Unknown=4, NotChecked=76, Total=1640 [2018-12-02 17:16:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-02 17:16:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 120. [2018-12-02 17:16:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 17:16:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-02 17:16:25,669 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 46 [2018-12-02 17:16:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:25,669 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-02 17:16:25,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 17:16:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-02 17:16:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 17:16:25,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:25,670 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:16:25,670 INFO L423 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:16:25,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1012305689, now seen corresponding path program 1 times [2018-12-02 17:16:25,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:16:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:16:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:25,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:25,804 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 17:16:25,807 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 17:16:25,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:25,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:25,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:25,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-02 17:16:27,343 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-02 17:16:27,351 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 17:16:27,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:27,357 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 17:16:27,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:27,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:27,371 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 17:16:27,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 17:16:27,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:16:27,520 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 17:16:27,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:27,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:27,523 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 17:16:27,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:16:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:16:27,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:27,859 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 17:16:27,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:27,859 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 17:16:27,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-02 17:16:27,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:16:27,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:16:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:28,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:28,022 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 17:16:28,024 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 17:16:28,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-02 17:16:28,044 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 17:16:28,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:28,050 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 17:16:28,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,064 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 17:16:28,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 17:16:28,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:16:28,107 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 17:16:28,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,110 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 17:16:28,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:16:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:16:28,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:28,324 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 17:16:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:28,325 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 17:16:28,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-02 17:16:28,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:16:28,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-02 17:16:28,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 17:16:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 17:16:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2018-12-02 17:16:28,462 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 16 states. [2018-12-02 17:16:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:31,468 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-02 17:16:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:16:31,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-02 17:16:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:31,469 INFO L225 Difference]: With dead ends: 124 [2018-12-02 17:16:31,469 INFO L226 Difference]: Without dead ends: 124 [2018-12-02 17:16:31,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=686, Unknown=1, NotChecked=54, Total=870 [2018-12-02 17:16:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-02 17:16:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-12-02 17:16:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 17:16:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-02 17:16:31,472 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 46 [2018-12-02 17:16:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:31,472 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-02 17:16:31,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 17:16:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-02 17:16:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 17:16:31,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:31,472 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:16:31,472 INFO L423 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:16:31,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1876968269, now seen corresponding path program 1 times [2018-12-02 17:16:31,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:16:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:16:31,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:31,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:31,663 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 17:16:31,665 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 17:16:31,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 17:16:31,758 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 7 treesize of output 1 [2018-12-02 17:16:31,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,764 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 17:16:31,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-02 17:16:31,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:31,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-12-02 17:16:31,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,927 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 24 treesize of output 26 [2018-12-02 17:16:31,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 17:16:31,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:31,938 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:13 [2018-12-02 17:16:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:16:31,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:16:31,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:16:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 17:16:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 17:16:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 17:16:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-02 17:16:31,962 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 18 states. [2018-12-02 17:16:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:33,137 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-02 17:16:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:16:33,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-02 17:16:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:33,138 INFO L225 Difference]: With dead ends: 133 [2018-12-02 17:16:33,138 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 17:16:33,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-02 17:16:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 17:16:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-02 17:16:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 17:16:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 17:16:33,140 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 46 [2018-12-02 17:16:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:33,140 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 17:16:33,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 17:16:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 17:16:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 17:16:33,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:33,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:16:33,141 INFO L423 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:16:33,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:33,141 INFO L82 PathProgramCache]: Analyzing trace with hash 133683600, now seen corresponding path program 1 times [2018-12-02 17:16:33,141 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:16:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:16:33,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:33,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:33,274 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 17:16:33,276 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 17:16:33,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:33,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:33,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:33,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-02 17:16:34,711 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-02 17:16:34,718 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 17:16:34,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:34,722 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 17:16:34,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:34,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:34,734 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 17:16:34,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-02 17:16:34,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:16:34,778 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 17:16:34,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:34,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:34,780 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 17:16:34,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:16:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:16:34,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:34,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:16:34,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:16:34,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:35,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:35,033 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 17:16:35,034 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 17:16:35,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 17:16:35,047 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 17:16:35,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:35,051 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 17:16:35,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,066 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 17:16:35,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 17:16:35,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:16:35,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:16:35,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:35,222 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 17:16:35,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 17:16:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:16:35,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:35,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:16:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-12-02 17:16:35,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 17:16:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 17:16:35,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2018-12-02 17:16:35,334 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 16 states. [2018-12-02 17:16:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:38,078 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-02 17:16:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:16:38,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-12-02 17:16:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:38,079 INFO L225 Difference]: With dead ends: 105 [2018-12-02 17:16:38,079 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 17:16:38,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=718, Unknown=1, NotChecked=56, Total=930 [2018-12-02 17:16:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 17:16:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-02 17:16:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 17:16:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-02 17:16:38,082 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 47 [2018-12-02 17:16:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:38,082 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-02 17:16:38,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 17:16:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-02 17:16:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 17:16:38,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:38,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:16:38,083 INFO L423 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:16:38,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1316705324, now seen corresponding path program 1 times [2018-12-02 17:16:38,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:16:38,083 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/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 17:16:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:38,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:38,211 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 17:16:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:38,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:38,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:16:38,235 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 17:16:38,237 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 17:16:38,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:38,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:38,254 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 17:16:38,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-02 17:16:38,993 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 17:16:41,758 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 17:16:43,625 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))))) is different from true [2018-12-02 17:16:43,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:43,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:43,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:43,643 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 30 treesize of output 44 [2018-12-02 17:16:43,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:43,678 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 33 treesize of output 26 [2018-12-02 17:16:43,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:43,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-02 17:16:43,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:43,695 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:43,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:16:43,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:38 [2018-12-02 17:16:44,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-02 17:16:44,193 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 21 treesize of output 12 [2018-12-02 17:16:44,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:44,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:44,211 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 17:16:44,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-12-02 17:16:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 17:16:44,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:44,695 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-02 17:16:44,830 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:44,831 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:44, output treesize:1 [2018-12-02 17:16:52,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:16:52,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:16:52,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:52,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:16:52,504 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 17:16:52,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:16:52,511 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 17:16:52,513 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 17:16:52,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,529 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 17:16:52,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-02 17:16:52,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:52,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:52,628 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 25 treesize of output 41 [2018-12-02 17:16:52,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,652 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 35 treesize of output 28 [2018-12-02 17:16:52,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:16:52,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-02 17:16:52,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:52,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:16:52,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:29 [2018-12-02 17:16:53,232 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 27 treesize of output 21 [2018-12-02 17:16:53,237 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 21 treesize of output 12 [2018-12-02 17:16:53,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:53,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:16:53,247 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 17:16:53,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-12-02 17:16:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 17:16:53,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:16:53,519 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 17:16:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 17:16:53,611 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:37, output treesize:1 [2018-12-02 17:17:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:17:01,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2018-12-02 17:17:01,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 17:17:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 17:17:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=717, Unknown=5, NotChecked=110, Total=930 [2018-12-02 17:17:01,853 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 25 states. [2018-12-02 17:17:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:16,972 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-12-02 17:17:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:17:16,973 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-02 17:17:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:16,973 INFO L225 Difference]: With dead ends: 131 [2018-12-02 17:17:16,973 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 17:17:16,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=161, Invalid=1102, Unknown=5, NotChecked=138, Total=1406 [2018-12-02 17:17:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 17:17:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2018-12-02 17:17:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 17:17:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-12-02 17:17:16,975 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 47 [2018-12-02 17:17:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-12-02 17:17:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 17:17:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-12-02 17:17:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 17:17:16,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:16,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:17:16,976 INFO L423 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:17:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1013558168, now seen corresponding path program 1 times [2018-12-02 17:17:16,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:17:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:17:16,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:17,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:17:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:17:17,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:17:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:17:17,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:17:17,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:17:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:17:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:17:17,037 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-12-02 17:17:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:17,043 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-12-02 17:17:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:17:17,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 17:17:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:17,044 INFO L225 Difference]: With dead ends: 121 [2018-12-02 17:17:17,044 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 17:17:17,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:17:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 17:17:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-12-02 17:17:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 17:17:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-02 17:17:17,046 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 46 [2018-12-02 17:17:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:17,047 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-02 17:17:17,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:17:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-02 17:17:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 17:17:17,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:17,047 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:17:17,048 INFO L423 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:17:17,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash -760504019, now seen corresponding path program 1 times [2018-12-02 17:17:17,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:17:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:17:17,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:17,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:17:17,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 17:17:17,152 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 17:17:17,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,165 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 17:17:17,166 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 17:17:17,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-02 17:17:17,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:17:17,182 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 17:17:17,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:17:17,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 17:17:17,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 17:17:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:17:17,202 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:17:17,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:17:17,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:17:17,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:17:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:17:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:17:17,204 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-02 17:17:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:17,294 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-02 17:17:17,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:17:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 17:17:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:17,295 INFO L225 Difference]: With dead ends: 102 [2018-12-02 17:17:17,295 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 17:17:17,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:17:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 17:17:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-02 17:17:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 17:17:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-12-02 17:17:17,297 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 47 [2018-12-02 17:17:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:17,297 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-12-02 17:17:17,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:17:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-12-02 17:17:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 17:17:17,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:17,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:17:17,297 INFO L423 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:17:17,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1964684199, now seen corresponding path program 1 times [2018-12-02 17:17:17,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:17:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:17:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:17,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:17:17,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 17:17:17,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:17:17,432 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 9 [2018-12-02 17:17:17,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,437 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 15 treesize of output 17 [2018-12-02 17:17:17,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:17:17,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 17:17:17,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 17:17:17,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:17:17,462 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 2 xjuncts. [2018-12-02 17:17:17,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 17:17:17,547 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 17:17:17,550 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 17:17:17,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:17,568 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 17:17:17,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-02 17:17:26,597 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 17:17:26,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-02 17:17:26,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:17:26,617 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 28 treesize of output 37 [2018-12-02 17:17:26,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:26,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:26,654 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 17:17:26,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-12-02 17:17:26,657 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 33 treesize of output 27 [2018-12-02 17:17:26,658 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 27 treesize of output 12 [2018-12-02 17:17:26,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:26,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:26,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:26,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:12 [2018-12-02 17:17:28,659 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_11| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe_19_#t~mem46.base_11|)) (= (store |c_old(#valid)| |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |c_#valid|))) is different from true [2018-12-02 17:17:32,705 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 17:17:34,710 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_11| (_ BitVec 32)) (|v_entry_point_~#a19~0.base_13| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_13| (_ bv1 1)))) (and (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_13|) (_ bv0 1)) (= (select .cse0 |v_probe_19_#t~mem46.base_11|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_13| (_ bv0 1)))))) is different from true [2018-12-02 17:17:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:17:36,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:17:36,866 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 17:17:37,093 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 25 treesize of output 23 [2018-12-02 17:17:37,095 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 23 treesize of output 27 [2018-12-02 17:17:37,103 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 24 treesize of output 12 [2018-12-02 17:17:37,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:37,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:37,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:37,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:17:37,115 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2018-12-02 17:17:39,117 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_probe_19_~a.base_49 (_ BitVec 32)) (|v_probe_19_#t~ret42.base_38| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_probe_19_~a.base_49 (_ bv1 1)))) (or (not (= (select |c_#valid| v_probe_19_~a.base_49) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 |v_probe_19_#t~ret42.base_38|))) (= |c_old(#valid)| (store (store .cse0 |v_probe_19_#t~ret42.base_38| (_ bv0 1)) v_probe_19_~a.base_49 (_ bv0 1)))))) is different from false [2018-12-02 17:17:39,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:17:39,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:17:39,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:39,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:17:42,911 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 17:17:42,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 10 treesize of output 9 [2018-12-02 17:17:42,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:42,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:42,929 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 17:17:42,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-12-02 17:17:43,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-02 17:17:43,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:17:43,008 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 28 treesize of output 37 [2018-12-02 17:17:43,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:43,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:43,034 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 17:17:43,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-12-02 17:17:43,037 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 33 treesize of output 27 [2018-12-02 17:17:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2018-12-02 17:17:43,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:43,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:43,045 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 17:17:43,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:12 [2018-12-02 17:17:45,050 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_16| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_probe_19_#t~mem46.base_16| (_ bv0 1))) (= (select |c_old(#valid)| |v_probe_19_#t~mem46.base_16|) (_ bv0 1)))) is different from true [2018-12-02 17:17:49,093 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_19| (_ BitVec 32)) (|v_probe_19_#t~mem46.base_11| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_19| (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_19| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_probe_19_#t~mem46.base_11|)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_19|) (_ bv0 1))))) is different from true [2018-12-02 17:17:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:17:49,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:17:49,324 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 17:17:49,533 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 29 treesize of output 27 [2018-12-02 17:17:49,535 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 27 treesize of output 31 [2018-12-02 17:17:49,547 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 28 treesize of output 12 [2018-12-02 17:17:49,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:17:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:49,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:17:49,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:17:49,560 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:28 [2018-12-02 17:17:51,563 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_probe_19_~a.base_56 (_ BitVec 32)) (|v_probe_19_#t~ret42.base_48| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_probe_19_~a.base_56 (_ bv1 1)))) (or (not (= (select |c_#valid| v_probe_19_~a.base_56) (_ bv0 1))) (not (= (select .cse0 |v_probe_19_#t~ret42.base_48|) (_ bv0 1))) (= (store (store .cse0 |v_probe_19_#t~ret42.base_48| (_ bv0 1)) v_probe_19_~a.base_56 (_ bv0 1)) |c_old(#valid)|)))) is different from false [2018-12-02 17:17:51,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:17:51,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2018-12-02 17:17:51,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 17:17:51,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 17:17:51,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=315, Unknown=15, NotChecked=246, Total=650 [2018-12-02 17:17:51,580 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 24 states. [2018-12-02 17:19:01,477 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 17:19:16,298 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-02 17:19:23,147 WARN L180 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-12-02 17:19:44,161 WARN L180 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-02 17:19:50,202 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (exists ((|v_probe_19_#t~mem46.base_11| (_ BitVec 32)) (|v_entry_point_~#a19~0.base_13| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_13| (_ bv1 1)))) (and (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_13|) (_ bv0 1)) (= (select .cse0 |v_probe_19_#t~mem46.base_11|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_13| (_ bv0 1)))))) (exists ((|v_entry_point_~#a19~0.base_19| (_ BitVec 32)) (|v_probe_19_#t~mem46.base_11| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_19| (_ bv1 1)))) (and (= |c_#valid| (store (store .cse1 |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_19| (_ bv0 1))) (= (_ bv0 1) (select .cse1 |v_probe_19_#t~mem46.base_11|)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_19|) (_ bv0 1)))))) is different from true [2018-12-02 17:19:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:50,203 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-02 17:19:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 17:19:50,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-02 17:19:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:50,203 INFO L225 Difference]: With dead ends: 106 [2018-12-02 17:19:50,203 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 17:19:50,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=133, Invalid=678, Unknown=29, NotChecked=420, Total=1260 [2018-12-02 17:19:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 17:19:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-02 17:19:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 17:19:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-12-02 17:19:50,205 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 45 [2018-12-02 17:19:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:50,205 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-12-02 17:19:50,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 17:19:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-12-02 17:19:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 17:19:50,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:50,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:50,206 INFO L423 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:19:50,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -150775570, now seen corresponding path program 1 times [2018-12-02 17:19:50,206 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:19:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:19:50,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:50,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:19:50,354 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 17:19:50,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:50,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:50,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:19:50,374 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 17:19:50,376 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 17:19:50,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:50,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:50,388 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 17:19:50,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-12-02 17:19:52,484 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-02 17:19:52,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,500 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 32 treesize of output 46 [2018-12-02 17:19:52,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,533 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 35 treesize of output 28 [2018-12-02 17:19:52,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-02 17:19:52,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:55 [2018-12-02 17:19:52,689 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-02 17:19:52,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,696 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 17:19:52,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:24 [2018-12-02 17:19:52,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,880 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 40 treesize of output 58 [2018-12-02 17:19:52,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:52,905 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 17:19:52,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:53 [2018-12-02 17:19:52,983 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 26 treesize of output 20 [2018-12-02 17:19:52,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:52,987 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 20 treesize of output 15 [2018-12-02 17:19:52,987 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 17:19:52,993 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 17:19:52,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:19:52,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-12-02 17:19:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:53,044 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:19:53,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:53,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 17:19:53,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 17:19:53,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 17:19:53,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=366, Unknown=1, NotChecked=38, Total=462 [2018-12-02 17:19:53,047 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 22 states. [2018-12-02 17:19:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:54,200 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-12-02 17:19:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 17:19:54,200 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-12-02 17:19:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:54,200 INFO L225 Difference]: With dead ends: 83 [2018-12-02 17:19:54,201 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 17:19:54,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=121, Invalid=812, Unknown=1, NotChecked=58, Total=992 [2018-12-02 17:19:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 17:19:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 17:19:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 17:19:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-02 17:19:54,202 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 48 [2018-12-02 17:19:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:54,202 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-02 17:19:54,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 17:19:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-02 17:19:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 17:19:54,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:54,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:54,203 INFO L423 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:19:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 32119129, now seen corresponding path program 1 times [2018-12-02 17:19:54,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:19:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:19:54,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:54,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:19:54,343 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 17:19:54,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 17:19:54,386 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 17:19:54,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,407 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 17:19:54,410 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 17:19:54,410 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:54,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-12-02 17:19:55,925 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 17:19:55,933 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 23 treesize of output 18 [2018-12-02 17:19:55,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:55,938 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 17:19:55,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:55,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:55,958 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 17:19:55,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-02 17:19:55,989 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 1 [2018-12-02 17:19:55,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:55,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:19:55,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-02 17:19:56,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:56,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:56,044 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 19 treesize of output 10 [2018-12-02 17:19:56,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-02 17:19:56,144 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 16 treesize of output 12 [2018-12-02 17:19:56,146 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 12 treesize of output 4 [2018-12-02 17:19:56,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-02 17:19:56,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:56,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-02 17:19:56,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,187 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 17:19:56,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-02 17:19:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:56,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:19:56,918 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-02 17:19:56,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,926 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 6 treesize of output 1 [2018-12-02 17:19:56,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 17:19:56,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,936 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 18 treesize of output 16 [2018-12-02 17:19:56,938 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 16 treesize of output 20 [2018-12-02 17:19:56,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-02 17:19:56,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:56,954 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:64, output treesize:6 [2018-12-02 17:19:57,117 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 32 treesize of output 24 [2018-12-02 17:19:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,144 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 21 treesize of output 14 [2018-12-02 17:19:57,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,166 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 2 xjuncts. [2018-12-02 17:19:57,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2018-12-02 17:19:57,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:19:57,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:19:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:57,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:19:57,265 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 17:19:57,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 17:19:57,281 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 17:19:57,284 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 17:19:57,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,300 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 17:19:57,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-02 17:19:57,309 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 23 treesize of output 18 [2018-12-02 17:19:57,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:57,316 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 17:19:57,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,342 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 17:19:57,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-02 17:19:57,345 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 1 [2018-12-02 17:19:57,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:19:57,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-02 17:19:57,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:57,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:57,404 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 10 [2018-12-02 17:19:57,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-02 17:19:57,413 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 16 treesize of output 12 [2018-12-02 17:19:57,415 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 12 treesize of output 4 [2018-12-02 17:19:57,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-02 17:19:57,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:19:57,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-02 17:19:57,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,428 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 17:19:57,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-02 17:19:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:57,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:19:57,736 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 17:19:57,840 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-02 17:19:57,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,846 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 6 treesize of output 1 [2018-12-02 17:19:57,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,851 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 18 treesize of output 16 [2018-12-02 17:19:57,852 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 16 treesize of output 20 [2018-12-02 17:19:57,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-02 17:19:57,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,867 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:52, output treesize:6 [2018-12-02 17:19:57,950 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 30 treesize of output 24 [2018-12-02 17:19:57,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,976 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 19 treesize of output 14 [2018-12-02 17:19:57,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:19:57,999 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 2 xjuncts. [2018-12-02 17:19:58,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-12-02 17:19:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:19:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-12-02 17:19:58,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 17:19:58,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 17:19:58,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-12-02 17:19:58,069 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 20 states. [2018-12-02 17:20:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:20:01,838 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-02 17:20:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 17:20:01,838 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-12-02 17:20:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:20:01,839 INFO L225 Difference]: With dead ends: 91 [2018-12-02 17:20:01,839 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 17:20:01,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 17:20:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 17:20:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-02 17:20:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 17:20:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-02 17:20:01,842 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2018-12-02 17:20:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:20:01,842 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-02 17:20:01,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 17:20:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-02 17:20:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 17:20:01,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:20:01,843 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:20:01,843 INFO L423 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:20:01,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:20:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 32119130, now seen corresponding path program 1 times [2018-12-02 17:20:01,844 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:20:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:20:01,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:20:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:20:01,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:20:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:20:02,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:20:02,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:20:02,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 17:20:02,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 17:20:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:20:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:20:02,034 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 9 states. [2018-12-02 17:20:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:20:02,258 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-02 17:20:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:20:02,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-02 17:20:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:20:02,259 INFO L225 Difference]: With dead ends: 85 [2018-12-02 17:20:02,259 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 17:20:02,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:20:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 17:20:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-02 17:20:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 17:20:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-02 17:20:02,261 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2018-12-02 17:20:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:20:02,261 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-02 17:20:02,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 17:20:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-02 17:20:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 17:20:02,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:20:02,261 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:20:02,262 INFO L423 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:20:02,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:20:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 995692982, now seen corresponding path program 1 times [2018-12-02 17:20:02,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:20:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:20:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:20:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:20:02,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:20:02,396 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 17:20:02,398 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 17:20:02,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:02,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:02,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:02,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 17:20:02,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 17:20:02,540 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 17:20:02,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:02,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:02,542 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 17:20:02,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 17:20:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 17:20:02,558 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:20:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:20:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 17:20:02,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 17:20:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 17:20:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-02 17:20:02,561 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 16 states. [2018-12-02 17:20:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:20:05,193 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-02 17:20:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:20:05,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-12-02 17:20:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:20:05,194 INFO L225 Difference]: With dead ends: 88 [2018-12-02 17:20:05,194 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 17:20:05,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:20:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 17:20:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-02 17:20:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 17:20:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-12-02 17:20:05,196 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 51 [2018-12-02 17:20:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:20:05,196 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-12-02 17:20:05,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 17:20:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-12-02 17:20:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 17:20:05,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:20:05,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:20:05,197 INFO L423 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:20:05,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:20:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 801711417, now seen corresponding path program 1 times [2018-12-02 17:20:05,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:20:05,198 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:20:05,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:20:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:20:05,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:20:05,366 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 17:20:05,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:05,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:05,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 17:20:05,395 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 17:20:05,397 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 17:20:05,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:05,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:05,417 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 17:20:05,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-02 17:20:07,527 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-02 17:20:07,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,543 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 30 treesize of output 44 [2018-12-02 17:20:07,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:07,574 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 33 treesize of output 26 [2018-12-02 17:20:07,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-02 17:20:07,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:07,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:07,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:07,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:52 [2018-12-02 17:20:07,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,967 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:20:07,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:07,980 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 42 treesize of output 83 [2018-12-02 17:20:07,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 17:20:08,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:20:08,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:75 [2018-12-02 17:20:08,291 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 43 treesize of output 35 [2018-12-02 17:20:08,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:08,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-02 17:20:08,294 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 17:20:08,304 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 17:20:08,324 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 35 treesize of output 27 [2018-12-02 17:20:08,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:08,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-12-02 17:20:08,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:08,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:08,345 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 2 xjuncts. [2018-12-02 17:20:08,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2018-12-02 17:20:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:20:08,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:20:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:20:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-02 17:20:08,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 17:20:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 17:20:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=409, Unknown=1, NotChecked=40, Total=506 [2018-12-02 17:20:08,416 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 23 states. [2018-12-02 17:20:10,196 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-02 17:20:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:20:10,445 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-02 17:20:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 17:20:10,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-12-02 17:20:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:20:10,447 INFO L225 Difference]: With dead ends: 90 [2018-12-02 17:20:10,447 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 17:20:10,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=119, Invalid=814, Unknown=1, NotChecked=58, Total=992 [2018-12-02 17:20:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 17:20:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-02 17:20:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 17:20:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-12-02 17:20:10,448 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-12-02 17:20:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:20:10,448 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-12-02 17:20:10,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 17:20:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-12-02 17:20:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 17:20:10,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:20:10,449 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:20:10,449 INFO L423 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:20:10,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:20:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash 798875024, now seen corresponding path program 1 times [2018-12-02 17:20:10,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:20:10,449 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:20:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:20:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:20:10,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:20:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:20:10,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:20:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:20:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:20:10,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:20:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:20:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:20:10,519 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 6 states. [2018-12-02 17:20:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:20:10,536 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-02 17:20:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:20:10,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-02 17:20:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:20:10,536 INFO L225 Difference]: With dead ends: 79 [2018-12-02 17:20:10,537 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 17:20:10,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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 17:20:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 17:20:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-02 17:20:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 17:20:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-02 17:20:10,538 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 56 [2018-12-02 17:20:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:20:10,539 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-02 17:20:10,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:20:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-02 17:20:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:20:10,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:20:10,539 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:20:10,539 INFO L423 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:20:10,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:20:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1003425580, now seen corresponding path program 1 times [2018-12-02 17:20:10,540 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:20:10,540 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:20:10,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:20:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:20:10,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:20:10,714 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 15 treesize of output 17 [2018-12-02 17:20:10,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:10,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 17:20:10,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 17:20:10,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:20:10,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 17:20:10,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:10,744 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 9 [2018-12-02 17:20:10,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:10,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:10,753 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 2 xjuncts. [2018-12-02 17:20:10,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 17:20:10,837 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 17:20:10,840 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 17:20:10,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:10,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:10,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:10,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-02 17:20:12,982 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-02 17:20:12,997 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-12-02 17:20:13,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:13,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2018-12-02 17:20:13,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:13,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:13,046 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 17:20:13,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:55 [2018-12-02 17:20:13,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:13,126 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-12-02 17:20:13,129 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 41 treesize of output 35 [2018-12-02 17:20:13,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:13,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:20:13,146 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 17:20:13,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:35 [2018-12-02 17:20:13,275 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 21 treesize of output 14 [2018-12-02 17:20:13,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 17:20:13,284 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 17:20:13,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-12-02 17:20:15,457 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 17:20:15,624 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 58 treesize of output 46 [2018-12-02 17:20:15,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:15,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:20:15,630 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 46 treesize of output 33 [2018-12-02 17:20:15,631 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 17:20:15,640 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 17:20:15,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:20:15,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:30 [2018-12-02 17:20:17,718 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 17:20:18,422 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_21| (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_probe_19_#t~mem46.base_21| (_ bv1 1)))) (let ((.cse0 (store .cse1 v_arrayElimCell_95 (_ bv0 1)))) (and (= (_ bv1 1) (select .cse0 |c_probe_19_#in~a.base|)) (= |c_#valid| (store .cse0 |v_probe_19_#t~mem46.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe_19_#t~mem46.base_21|)) (= (_ bv0 1) (select .cse1 v_arrayElimCell_95)))))) is different from true [2018-12-02 17:20:22,504 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 17:20:24,192 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_21| (_ BitVec 32)) (|v_entry_point_~#a19~0.base_27| (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_27| (_ bv1 1)))) (let ((.cse0 (store .cse2 |v_probe_19_#t~mem46.base_21| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_95 (_ bv0 1)))) (and (= (select .cse0 v_arrayElimCell_95) (_ bv0 1)) (= (bvadd (select .cse1 |v_entry_point_~#a19~0.base_27|) (_ bv1 1)) (_ bv0 1)) (= (select .cse2 |v_probe_19_#t~mem46.base_21|) (_ bv0 1)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_27|) (_ bv0 1)) (= |c_#valid| (store (store .cse1 |v_probe_19_#t~mem46.base_21| (_ bv0 1)) |v_entry_point_~#a19~0.base_27| (_ bv0 1)))))))) is different from true [2018-12-02 17:20:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:20:24,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:20:24,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:20:24,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-02 17:20:24,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 17:20:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 17:20:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=439, Unknown=4, NotChecked=132, Total=650 [2018-12-02 17:20:24,331 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 26 states. [2018-12-02 17:21:03,734 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-02 17:21:20,580 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 17:21:28,764 WARN L180 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-02 17:21:32,225 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-02 17:21:38,413 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-02 17:21:58,570 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-12-02 17:22:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:00,200 INFO L93 Difference]: Finished difference Result 80 states and 79 transitions. [2018-12-02 17:22:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 17:22:00,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-02 17:22:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:00,201 INFO L225 Difference]: With dead ends: 80 [2018-12-02 17:22:00,201 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 17:22:00,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=162, Invalid=1091, Unknown=19, NotChecked=210, Total=1482 [2018-12-02 17:22:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 17:22:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 17:22:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 17:22:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-12-02 17:22:00,202 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 57 [2018-12-02 17:22:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:00,202 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-12-02 17:22:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 17:22:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-12-02 17:22:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 17:22:00,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:00,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:22:00,203 INFO L423 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-02 17:22:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 347050180, now seen corresponding path program 1 times [2018-12-02 17:22:00,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 17:22:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 17:22:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:00,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:22:00,432 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 15 treesize of output 17 [2018-12-02 17:22:00,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:00,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 17:22:00,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 17:22:00,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:22:00,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 17:22:00,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:00,450 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 9 [2018-12-02 17:22:00,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:00,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:00,459 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 2 xjuncts. [2018-12-02 17:22:00,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 17:22:00,544 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 17:22:00,547 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 17:22:00,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:00,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:00,570 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 17:22:00,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-12-02 17:22:02,725 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-02 17:22:02,736 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 66 treesize of output 55 [2018-12-02 17:22:02,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 78 [2018-12-02 17:22:02,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,783 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 17:22:02,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:63 [2018-12-02 17:22:02,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-12-02 17:22:02,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,919 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 31 treesize of output 47 [2018-12-02 17:22:02,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:02,940 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 45 treesize of output 74 [2018-12-02 17:22:02,943 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 42 treesize of output 64 [2018-12-02 17:22:02,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:02,990 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 17:22:02,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:48 [2018-12-02 17:22:03,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:03,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 17:22:03,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:03,302 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:22:03,303 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 29 treesize of output 29 [2018-12-02 17:22:03,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:03,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:22:03,319 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 17:22:03,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-12-02 17:22:03,777 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 94 treesize of output 80 [2018-12-02 17:22:03,780 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 50 [2018-12-02 17:22:03,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:22:03,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:22:03,876 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2018-12-02 17:22:03,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:22:03,972 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-02 17:22:03,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:22:04,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 17:22:04,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 17:22:04,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:87 [2018-12-02 17:22:12,277 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-12-02 17:22:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 17:22:48,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 17:22:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-12-02 17:22:48,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 17:22:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 17:22:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=600, Unknown=21, NotChecked=50, Total=756 [2018-12-02 17:22:48,608 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand 28 states. [2018-12-02 17:23:51,756 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-02 17:24:40,306 WARN L180 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 17:24:43,021 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-12-02 17:25:09,171 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-02 17:25:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:25:11,299 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2018-12-02 17:25:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 17:25:11,300 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-12-02 17:25:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:25:11,300 INFO L225 Difference]: With dead ends: 60 [2018-12-02 17:25:11,300 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 17:25:11,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 87.4s TimeCoverageRelationStatistics Valid=201, Invalid=1407, Unknown=36, NotChecked=78, Total=1722 [2018-12-02 17:25:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 17:25:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 17:25:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 17:25:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 17:25:11,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-02 17:25:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:25:11,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:25:11,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 17:25:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 17:25:11,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 17:25:11,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:25:11 BoogieIcfgContainer [2018-12-02 17:25:11,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:25:11,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:25:11,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:25:11,305 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:25:11,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:11:20" (3/4) ... [2018-12-02 17:25:11,307 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_19 [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f19_undo [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g19 [2018-12-02 17:25:11,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f19 [2018-12-02 17:25:11,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe_19 [2018-12-02 17:25:11,316 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-02 17:25:11,316 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 17:25:11,316 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 17:25:11,344 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d0d51630-6ae6-4f5c-9db2-240139d3426b/bin-2019/utaipan/witness.graphml [2018-12-02 17:25:11,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:25:11,344 INFO L168 Benchmark]: Toolchain (without parser) took 831649.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:25:11,344 INFO L168 Benchmark]: CDTParser took 0.18 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 17:25:11,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:25:11,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.38 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 17:25:11,345 INFO L168 Benchmark]: Boogie Preprocessor took 18.02 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 17:25:11,345 INFO L168 Benchmark]: RCFGBuilder took 260.29 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:25:11,345 INFO L168 Benchmark]: TraceAbstraction took 830942.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:25:11,345 INFO L168 Benchmark]: Witness Printer took 39.24 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:25:11,346 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.18 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 364.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.38 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 18.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 260.29 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 830942.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 39.24 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1478]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1478]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1478]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1478]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1447]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1447]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1447]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1447]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1490]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1440]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1440]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1441]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1441]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1458]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1458]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1457]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1472]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 85 locations, 21 error locations. SAFE Result, 830.9s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 639.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2704 SDtfs, 2900 SDslu, 13652 SDs, 0 SdLazy, 12244 SolverSat, 941 SolverUnsat, 257 SolverUnknown, 0 SolverNotchecked, 456.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2352 GetRequests, 1594 SyntacticMatches, 54 SemanticMatches, 704 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 358.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 394 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 187.4s InterpolantComputationTime, 1907 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1861 ConstructedInterpolants, 366 QuantifiedInterpolants, 841335 SizeOfPredicates, 386 NumberOfNonLiveVariables, 7598 ConjunctsInSsa, 971 ConjunctsInUnsatCore, 46 InterpolantComputations, 31 PerfectInterpolantSequences, 130/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...