./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.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_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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 927b64548732fdfa523149393b95aeee194275ea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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 927b64548732fdfa523149393b95aeee194275ea ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:29:39,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:29:39,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:29:39,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:29:39,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:29:39,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:29:39,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:29:39,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:29:39,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:29:39,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:29:39,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:29:39,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:29:39,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:29:39,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:29:39,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:29:39,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:29:39,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:29:39,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:29:39,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:29:39,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:29:39,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:29:39,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:29:39,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:29:39,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:29:39,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:29:39,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:29:39,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:29:39,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:29:39,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:29:39,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:29:39,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:29:39,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:29:39,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:29:39,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:29:39,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:29:39,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:29:39,083 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 09:29:39,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:29:39,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:29:39,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:29:39,091 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:29:39,091 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:29:39,091 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:29:39,092 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:29:39,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:29:39,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:29:39,093 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:29:39,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:29:39,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:29:39,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:29:39,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:29:39,095 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:29:39,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:29:39,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:29:39,095 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_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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 -> 927b64548732fdfa523149393b95aeee194275ea [2018-12-09 09:29:39,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:29:39,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:29:39,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:29:39,125 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:29:39,126 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:29:39,126 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-09 09:29:39,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/6b2695ee4/92bb2dca84a04fa28767491996f8ec30/FLAG62374b7cd [2018-12-09 09:29:39,593 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:29:39,593 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-09 09:29:39,600 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/6b2695ee4/92bb2dca84a04fa28767491996f8ec30/FLAG62374b7cd [2018-12-09 09:29:39,608 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/6b2695ee4/92bb2dca84a04fa28767491996f8ec30 [2018-12-09 09:29:39,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:29:39,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:29:39,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:29:39,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:29:39,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:29:39,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142c46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39, skipping insertion in model container [2018-12-09 09:29:39,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:29:39,643 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:29:39,864 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:29:39,873 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:29:39,908 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:29:39,942 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:29:39,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39 WrapperNode [2018-12-09 09:29:39,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:29:39,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:29:39,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:29:39,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:29:39,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:29:39,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:29:39,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:29:39,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:29:39,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... [2018-12-09 09:29:39,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:29:39,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:29:39,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:29:39,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:29:39,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:29:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-09 09:29:40,017 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-09 09:29:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-09 09:29:40,017 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-09 09:29:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:29:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-09 09:29:40,017 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 09:29:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-12-09 09:29:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:29:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:29:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 09:29:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-09 09:29:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-09 09:29:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 09:29:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 09:29:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:29:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:29:40,211 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:29:40,211 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 09:29:40,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:29:40 BoogieIcfgContainer [2018-12-09 09:29:40,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:29:40,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:29:40,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:29:40,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:29:40,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:29:39" (1/3) ... [2018-12-09 09:29:40,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e22c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:29:40, skipping insertion in model container [2018-12-09 09:29:40,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:39" (2/3) ... [2018-12-09 09:29:40,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e22c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:29:40, skipping insertion in model container [2018-12-09 09:29:40,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:29:40" (3/3) ... [2018-12-09 09:29:40,216 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-12-09 09:29:40,222 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:29:40,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 09:29:40,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 09:29:40,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:29:40,249 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:29:40,249 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:29:40,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:29:40,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:29:40,249 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:29:40,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:29:40,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:29:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-09 09:29:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:29:40,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:40,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:40,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:40,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1662008609, now seen corresponding path program 1 times [2018-12-09 09:29:40,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:40,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:40,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:40,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:40,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:40,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:40,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:40,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:40,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:40,453 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 7 states. [2018-12-09 09:29:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:40,745 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-09 09:29:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:40,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 09:29:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:40,758 INFO L225 Difference]: With dead ends: 149 [2018-12-09 09:29:40,758 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 09:29:40,760 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-09 09:29:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 09:29:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 82. [2018-12-09 09:29:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 09:29:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-12-09 09:29:40,804 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2018-12-09 09:29:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:40,805 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-12-09 09:29:40,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-09 09:29:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:29:40,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:40,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:40,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:40,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1662008608, now seen corresponding path program 1 times [2018-12-09 09:29:40,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:40,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:40,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:40,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:40,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:40,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:40,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:40,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:40,906 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 8 states. [2018-12-09 09:29:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:41,271 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2018-12-09 09:29:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:41,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 09:29:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:41,272 INFO L225 Difference]: With dead ends: 145 [2018-12-09 09:29:41,272 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 09:29:41,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-09 09:29:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 09:29:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-12-09 09:29:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 09:29:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-12-09 09:29:41,278 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 15 [2018-12-09 09:29:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:41,278 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-12-09 09:29:41,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:29:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-12-09 09:29:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:41,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:41,279 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-09 09:29:41,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:41,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2103640479, now seen corresponding path program 1 times [2018-12-09 09:29:41,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:41,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:41,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:41,338 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-09 09:29:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:41,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:41,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:41,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:41,339 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 7 states. [2018-12-09 09:29:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:41,526 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2018-12-09 09:29:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:29:41,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 09:29:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:41,527 INFO L225 Difference]: With dead ends: 126 [2018-12-09 09:29:41,527 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 09:29:41,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 09:29:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2018-12-09 09:29:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 09:29:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 09:29:41,533 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2018-12-09 09:29:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:41,533 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 09:29:41,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 09:29:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:41,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:41,534 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-09 09:29:41,534 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:41,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2103640480, now seen corresponding path program 1 times [2018-12-09 09:29:41,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:41,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:41,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:41,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:41,646 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-09 09:29:41,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:41,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:29:41,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:41,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:29:41,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:29:41,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:29:41,647 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 11 states. [2018-12-09 09:29:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,083 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-12-09 09:29:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 09:29:42,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-09 09:29:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,084 INFO L225 Difference]: With dead ends: 136 [2018-12-09 09:29:42,084 INFO L226 Difference]: Without dead ends: 136 [2018-12-09 09:29:42,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-12-09 09:29:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-09 09:29:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2018-12-09 09:29:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 09:29:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 09:29:42,090 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 26 [2018-12-09 09:29:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,091 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 09:29:42,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:29:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 09:29:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:42,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,092 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-09 09:29:42,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 652817527, now seen corresponding path program 1 times [2018-12-09 09:29:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,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-09 09:29:42,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:42,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:42,130 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-12-09 09:29:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,155 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-12-09 09:29:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:42,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 09:29:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,156 INFO L225 Difference]: With dead ends: 82 [2018-12-09 09:29:42,156 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 09:29:42,156 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-09 09:29:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 09:29:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-09 09:29:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 09:29:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-09 09:29:42,159 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2018-12-09 09:29:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,159 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-09 09:29:42,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-09 09:29:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:42,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:42,160 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2134597960, now seen corresponding path program 1 times [2018-12-09 09:29:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:42,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:42,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:42,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:42,205 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2018-12-09 09:29:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,286 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-12-09 09:29:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:29:42,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-09 09:29:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,287 INFO L225 Difference]: With dead ends: 95 [2018-12-09 09:29:42,287 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 09:29:42,288 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-09 09:29:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 09:29:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-12-09 09:29:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 09:29:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-09 09:29:42,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2018-12-09 09:29:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,292 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-09 09:29:42,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:29:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-09 09:29:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:42,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,293 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-09 09:29:42,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2134597959, now seen corresponding path program 1 times [2018-12-09 09:29:42,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:42,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:42,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:42,327 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 6 states. [2018-12-09 09:29:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,342 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-09 09:29:42,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:42,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 09:29:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,343 INFO L225 Difference]: With dead ends: 89 [2018-12-09 09:29:42,343 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 09:29:42,343 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-09 09:29:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 09:29:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-09 09:29:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 09:29:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-12-09 09:29:42,346 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 26 [2018-12-09 09:29:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,346 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-12-09 09:29:42,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-12-09 09:29:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 09:29:42,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,347 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-09 09:29:42,347 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1745812588, now seen corresponding path program 1 times [2018-12-09 09:29:42,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:29:42,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:42,386 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 4 states. [2018-12-09 09:29:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,446 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-12-09 09:29:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:29:42,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 09:29:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,447 INFO L225 Difference]: With dead ends: 113 [2018-12-09 09:29:42,447 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:29:42,447 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-09 09:29:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:29:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-12-09 09:29:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 09:29:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-12-09 09:29:42,451 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 27 [2018-12-09 09:29:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,452 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-12-09 09:29:42,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-12-09 09:29:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:29:42,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,453 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-09 09:29:42,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1468017423, now seen corresponding path program 1 times [2018-12-09 09:29:42,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,482 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-09 09:29:42,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:42,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:42,483 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2018-12-09 09:29:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,492 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-12-09 09:29:42,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:42,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 09:29:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,493 INFO L225 Difference]: With dead ends: 112 [2018-12-09 09:29:42,493 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 09:29:42,494 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-09 09:29:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 09:29:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-12-09 09:29:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:29:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-12-09 09:29:42,499 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 35 [2018-12-09 09:29:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,499 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-12-09 09:29:42,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-12-09 09:29:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:29:42,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,500 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-09 09:29:42,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1939446192, now seen corresponding path program 1 times [2018-12-09 09:29:42,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,540 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-09 09:29:42,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:42,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:42,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:42,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:42,541 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-12-09 09:29:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:42,577 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-12-09 09:29:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:42,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-09 09:29:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:42,579 INFO L225 Difference]: With dead ends: 103 [2018-12-09 09:29:42,579 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 09:29:42,579 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-09 09:29:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 09:29:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-09 09:29:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:29:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-09 09:29:42,583 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 35 [2018-12-09 09:29:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:42,583 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-09 09:29:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-09 09:29:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:29:42,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:42,585 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-09 09:29:42,585 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2062118097, now seen corresponding path program 1 times [2018-12-09 09:29:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:42,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,748 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-09 09:29:42,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:29:42,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:29:42,749 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 09:29:42,750 INFO L205 CegarAbsIntRunner]: [10], [12], [15], [16], [23], [25], [28], [40], [43], [64], [66], [69], [70], [76], [77], [78], [81], [82], [83], [84], [85], [89], [103], [104], [105], [106], [111], [113], [114], [115], [116], [117], [119] [2018-12-09 09:29:42,769 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:29:42,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:29:42,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:29:42,883 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-09 09:29:42,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:42,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:29:42,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:29:42,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:29:42,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:42,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:29:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:42,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:42,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:29:42,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:29:42,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:42,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:42,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:42,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 09:29:43,430 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-09 09:29:43,438 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-09 09:29:43,440 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-09 09:29:43,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:43,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:43,448 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-09 09:29:43,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-12-09 09:29:43,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-09 09:29:43,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 3 [2018-12-09 09:29:43,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:43,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:43,462 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-09 09:29:43,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 09:29:43,464 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-09 09:29:43,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:29:43,590 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-09 09:29:43,791 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:29:43,792 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-09 09:29:43,796 INFO L168 Benchmark]: Toolchain (without parser) took 4185.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 945.9 MB in the beginning and 867.8 MB in the end (delta: 78.1 MB). Peak memory consumption was 288.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:43,798 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-09 09:29:43,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:43,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:43,800 INFO L168 Benchmark]: Boogie Preprocessor took 18.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:43,800 INFO L168 Benchmark]: RCFGBuilder took 227.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:43,801 INFO L168 Benchmark]: TraceAbstraction took 3583.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 867.8 MB in the end (delta: 210.2 MB). Peak memory consumption was 279.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:43,805 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 330.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.89 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.29 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 227.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3583.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 867.8 MB in the end (delta: 210.2 MB). Peak memory consumption was 279.9 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-09 09:29:45,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:29:45,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:29:45,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:29:45,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:29:45,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:29:45,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:29:45,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:29:45,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:29:45,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:29:45,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:29:45,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:29:45,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:29:45,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:29:45,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:29:45,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:29:45,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:29:45,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:29:45,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:29:45,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:29:45,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:29:45,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:29:45,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:29:45,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:29:45,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:29:45,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:29:45,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:29:45,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:29:45,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:29:45,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:29:45,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:29:45,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:29:45,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:29:45,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:29:45,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:29:45,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:29:45,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 09:29:45,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:29:45,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:29:45,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:29:45,103 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:29:45,103 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:29:45,103 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:29:45,103 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:29:45,103 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:29:45,103 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:29:45,104 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:29:45,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:29:45,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:29:45,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:29:45,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:29:45,104 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:29:45,105 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:29:45,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:29:45,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:29:45,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:29:45,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:29:45,107 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 09:29:45,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:29:45,107 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 09:29:45,107 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_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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 -> 927b64548732fdfa523149393b95aeee194275ea [2018-12-09 09:29:45,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:29:45,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:29:45,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:29:45,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:29:45,135 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:29:45,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-09 09:29:45,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/13e9de4e2/ddf49243d27940d1a23205b03d5d72e0/FLAG02b4ca12f [2018-12-09 09:29:45,624 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:29:45,625 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-09 09:29:45,633 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/13e9de4e2/ddf49243d27940d1a23205b03d5d72e0/FLAG02b4ca12f [2018-12-09 09:29:45,641 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/data/13e9de4e2/ddf49243d27940d1a23205b03d5d72e0 [2018-12-09 09:29:45,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:29:45,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:29:45,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:29:45,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:29:45,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:29:45,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:45,649 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 09.12 09:29:45, skipping insertion in model container [2018-12-09 09:29:45,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:45,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:29:45,677 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:29:45,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:29:45,882 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:29:45,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:29:45,990 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:29:45,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45 WrapperNode [2018-12-09 09:29:45,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:29:45,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:29:45,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:29:45,991 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:29:45,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:29:46,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:29:46,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:29:46,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:29:46,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... [2018-12-09 09:29:46,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:29:46,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:29:46,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:29:46,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:29:46,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:29:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-09 09:29:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-09 09:29:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-09 09:29:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-09 09:29:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:29:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-09 09:29:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-09 09:29:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 09:29:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-12-09 09:29:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:29:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:29:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-09 09:29:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 09:29:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 09:29:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:29:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:29:46,286 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:29:46,286 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 09:29:46,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:29:46 BoogieIcfgContainer [2018-12-09 09:29:46,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:29:46,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:29:46,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:29:46,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:29:46,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:29:45" (1/3) ... [2018-12-09 09:29:46,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6f466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:29:46, skipping insertion in model container [2018-12-09 09:29:46,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:29:45" (2/3) ... [2018-12-09 09:29:46,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6f466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:29:46, skipping insertion in model container [2018-12-09 09:29:46,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:29:46" (3/3) ... [2018-12-09 09:29:46,291 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-12-09 09:29:46,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:29:46,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 09:29:46,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 09:29:46,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:29:46,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:29:46,325 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:29:46,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:29:46,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:29:46,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:29:46,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:29:46,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:29:46,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:29:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-09 09:29:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:29:46,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:46,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:46,345 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:46,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash -471155968, now seen corresponding path program 1 times [2018-12-09 09:29:46,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:46,354 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:46,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:46,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:46,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:29:46,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:46,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:46,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:29:46,891 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2018-12-09 09:29:46,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:29:46,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:46,907 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-09 09:29:46,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 09:29:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:46,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:46,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:46,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-12-09 09:29:46,934 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 7 states. [2018-12-09 09:29:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:47,342 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-09 09:29:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:47,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 09:29:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:47,354 INFO L225 Difference]: With dead ends: 130 [2018-12-09 09:29:47,354 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 09:29:47,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2018-12-09 09:29:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 09:29:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-09 09:29:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 09:29:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2018-12-09 09:29:47,388 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2018-12-09 09:29:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:47,388 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2018-12-09 09:29:47,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2018-12-09 09:29:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:29:47,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:47,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:47,390 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:47,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash -471155967, now seen corresponding path program 1 times [2018-12-09 09:29:47,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:47,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:47,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:47,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:29:47,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:47,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:29:47,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:47,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:47,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:29:48,360 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-09 09:29:48,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:48,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:48,371 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-09 09:29:48,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:48,385 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-09 09:29:48,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:48,394 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-09 09:29:48,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-09 09:29:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:48,406 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:48,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:48,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-09 09:29:48,408 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 8 states. [2018-12-09 09:29:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:48,888 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-09 09:29:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:29:48,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 09:29:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:48,891 INFO L225 Difference]: With dead ends: 130 [2018-12-09 09:29:48,891 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 09:29:48,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-09 09:29:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 09:29:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2018-12-09 09:29:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 09:29:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-12-09 09:29:48,899 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 15 [2018-12-09 09:29:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:48,899 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-12-09 09:29:48,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:29:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-12-09 09:29:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:48,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:48,900 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-09 09:29:48,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:48,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1840810590, now seen corresponding path program 1 times [2018-12-09 09:29:48,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:48,901 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:49,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:49,343 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2018-12-09 09:29:49,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:29:49,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:49,352 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-09 09:29:49,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 09:29:49,360 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-09 09:29:49,360 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:49,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:49,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:49,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:49,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-12-09 09:29:49,362 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 7 states. [2018-12-09 09:29:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:49,620 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-12-09 09:29:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:29:49,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 09:29:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:49,622 INFO L225 Difference]: With dead ends: 114 [2018-12-09 09:29:49,622 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 09:29:49,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-09 09:29:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 09:29:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2018-12-09 09:29:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 09:29:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-12-09 09:29:49,629 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 26 [2018-12-09 09:29:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:49,630 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-12-09 09:29:49,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-12-09 09:29:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:49,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:49,631 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-09 09:29:49,631 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:49,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1840810591, now seen corresponding path program 1 times [2018-12-09 09:29:49,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:49,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:49,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:49,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:29:49,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:49,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:29:49,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:49,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:49,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:29:50,808 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-09 09:29:50,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 09:29:50,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:50,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,835 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-09 09:29:50,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:50,843 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-09 09:29:50,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-09 09:29:50,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,907 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-09 09:29:50,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:50,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:50,926 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-09 09:29:50,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:50,944 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-09 09:29:50,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-09 09:29:50,959 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-09 09:29:50,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:29:50,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:29:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:29:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-12-09 09:29:50,962 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 11 states. [2018-12-09 09:29:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:51,570 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-12-09 09:29:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:29:51,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-09 09:29:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:51,572 INFO L225 Difference]: With dead ends: 122 [2018-12-09 09:29:51,572 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 09:29:51,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2018-12-09 09:29:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 09:29:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-12-09 09:29:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 09:29:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-12-09 09:29:51,576 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 26 [2018-12-09 09:29:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:51,577 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2018-12-09 09:29:51,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:29:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2018-12-09 09:29:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:29:51,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:51,577 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-09 09:29:51,578 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:51,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash 389987670, now seen corresponding path program 1 times [2018-12-09 09:29:51,578 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:51,578 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:51,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:51,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:51,637 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:51,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:51,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:51,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:51,639 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 6 states. [2018-12-09 09:29:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:51,659 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-12-09 09:29:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:51,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 09:29:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:51,660 INFO L225 Difference]: With dead ends: 97 [2018-12-09 09:29:51,660 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 09:29:51,660 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-09 09:29:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 09:29:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-09 09:29:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 09:29:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-12-09 09:29:51,663 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 26 [2018-12-09 09:29:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:51,664 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-12-09 09:29:51,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-12-09 09:29:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 09:29:51,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:51,664 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-09 09:29:51,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:51,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -793070379, now seen corresponding path program 1 times [2018-12-09 09:29:51,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:51,665 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:51,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:51,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:51,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:29:51,731 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-09 09:29:51,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-09 09:29:51,750 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-09 09:29:51,752 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-09 09:29:51,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,755 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-09 09:29:51,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-12-09 09:29:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:51,761 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:51,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:51,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:51,763 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 6 states. [2018-12-09 09:29:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:51,842 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-09 09:29:51,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:51,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-09 09:29:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:51,843 INFO L225 Difference]: With dead ends: 99 [2018-12-09 09:29:51,843 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 09:29:51,843 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-09 09:29:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 09:29:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-09 09:29:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 09:29:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-09 09:29:51,847 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 27 [2018-12-09 09:29:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:51,847 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-09 09:29:51,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-09 09:29:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 09:29:51,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:51,848 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-09 09:29:51,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:29:51,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1303604556, now seen corresponding path program 1 times [2018-12-09 09:29:51,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:29:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:29:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:51,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:29:51,929 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-09 09:29:51,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:51,932 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-09 09:29:51,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:29:51,937 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-09 09:29:51,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:29:51,950 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-09 09:29:51,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 09:29:51,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:29:51,964 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-09 09:29:51,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 09:29:52,677 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-09 09:29:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:52,696 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:29:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:52,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:52,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2018-12-09 09:29:52,699 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2018-12-09 09:29:59,903 WARN L180 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-09 09:30:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:14,117 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2018-12-09 09:30:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:30:14,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 09:30:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:14,119 INFO L225 Difference]: With dead ends: 135 [2018-12-09 09:30:14,119 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 09:30:14,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-12-09 09:30:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 09:30:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-12-09 09:30:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:30:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2018-12-09 09:30:14,125 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 27 [2018-12-09 09:30:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:14,125 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2018-12-09 09:30:14,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:30:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2018-12-09 09:30:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:30:14,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:14,126 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-09 09:30:14,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:30:14,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1391359420, now seen corresponding path program 1 times [2018-12-09 09:30:14,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:30:14,127 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:30:14,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:14,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:14,180 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-09 09:30:14,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:30:14,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:30:14,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:30:14,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:30:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:30:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:30:14,182 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2018-12-09 09:30:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:14,192 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-12-09 09:30:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:30:14,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-09 09:30:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:14,193 INFO L225 Difference]: With dead ends: 122 [2018-12-09 09:30:14,193 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 09:30:14,194 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-09 09:30:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 09:30:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2018-12-09 09:30:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 09:30:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2018-12-09 09:30:14,197 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 34 [2018-12-09 09:30:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:14,197 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2018-12-09 09:30:14,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:30:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-12-09 09:30:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:30:14,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:14,198 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-09 09:30:14,198 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:30:14,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1419988571, now seen corresponding path program 1 times [2018-12-09 09:30:14,199 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:30:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:30:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:14,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:14,271 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-09 09:30:14,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 09:30:14,292 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-09 09:30:14,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:30:14,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:30:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:30:14,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:30:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:30:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:30:14,294 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 5 states. [2018-12-09 09:30:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:14,392 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-09 09:30:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:30:14,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-09 09:30:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:14,393 INFO L225 Difference]: With dead ends: 116 [2018-12-09 09:30:14,393 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 09:30:14,393 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-09 09:30:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 09:30:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-12-09 09:30:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 09:30:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-12-09 09:30:14,397 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 34 [2018-12-09 09:30:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-12-09 09:30:14,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:30:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-12-09 09:30:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:30:14,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:14,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] [2018-12-09 09:30:14,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:30:14,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1419988572, now seen corresponding path program 1 times [2018-12-09 09:30:14,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:30:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:30:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:14,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:14,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:30:14,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, 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-09 09:30:14,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-09 09:30:14,494 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-09 09:30:14,495 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-09 09:30:14,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,497 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-09 09:30:14,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-09 09:30:14,502 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-09 09:30:14,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:30:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:30:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:30:14,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:30:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:30:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:30:14,505 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 6 states. [2018-12-09 09:30:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:14,577 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-09 09:30:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:30:14,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-09 09:30:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:14,578 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:30:14,578 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:30:14,579 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-09 09:30:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:30:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 09:30:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:30:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2018-12-09 09:30:14,581 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 34 [2018-12-09 09:30:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:14,581 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-12-09 09:30:14,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:30:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2018-12-09 09:30:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:30:14,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:14,583 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-09 09:30:14,583 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:30:14,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash 776569745, now seen corresponding path program 1 times [2018-12-09 09:30:14,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:30:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:30:14,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:14,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:14,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:30:14,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:30:14,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:14,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 09:30:16,093 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-09 09:30:16,100 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-09 09:30:16,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:30:16,106 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-09 09:30:16,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 09:30:16,120 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-09 09:30:16,121 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-09 09:30:16,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:30:16,132 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-09 09:30:16,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:16,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:16,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:30:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:16,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:16,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:30:16,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:30:16,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 09:30:16,354 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-09 09:30:16,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:30:16,360 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-09 09:30:16,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 09:30:16,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 09:30:16,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 09:30:16,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:16,381 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-09 09:30:16,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 09:30:16,383 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-09 09:30:16,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:16,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:30:16,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2018-12-09 09:30:16,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:30:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:30:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2018-12-09 09:30:16,486 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 14 states. [2018-12-09 09:30:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:17,072 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2018-12-09 09:30:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:30:17,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-09 09:30:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:17,073 INFO L225 Difference]: With dead ends: 123 [2018-12-09 09:30:17,073 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 09:30:17,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2018-12-09 09:30:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 09:30:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-09 09:30:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 09:30:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2018-12-09 09:30:17,077 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 35 [2018-12-09 09:30:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:17,077 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2018-12-09 09:30:17,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:30:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2018-12-09 09:30:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:30:17,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:17,079 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-09 09:30:17,079 INFO L423 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:30:17,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1696141606, now seen corresponding path program 1 times [2018-12-09 09:30:17,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:30:17,079 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:30:17,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:17,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:17,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:30:17,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:17,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:17,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:30:17,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:30:17,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:30:17,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:17,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:17,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:17,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 09:30:22,296 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 09:30:22,303 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 25 treesize of output 20 [2018-12-09 09:30:22,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:30:22,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 09:30:22,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:22,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:22,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:22,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-12-09 09:30:22,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 09:30:22,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 09:30:22,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:22,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:22,341 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-09 09:30:22,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 09:30:22,363 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-09 09:30:22,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:24,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:24,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:30:24,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:24,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:24,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:30:24,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:30:24,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:30:24,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:30:24,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-09 09:30:24,646 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-09 09:30:24,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:30:24,652 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-09 09:30:24,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-09 09:30:24,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:30:24,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-09 09:30:24,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:30:24,674 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-09 09:30:24,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-09 09:30:24,686 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-09 09:30:24,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:30:24,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2018-12-09 09:30:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:30:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:30:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=254, Unknown=4, NotChecked=0, Total=306 [2018-12-09 09:30:24,818 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 16 states. [2018-12-09 09:31:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:29,103 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2018-12-09 09:31:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:31:29,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-12-09 09:31:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:29,104 INFO L225 Difference]: With dead ends: 125 [2018-12-09 09:31:29,104 INFO L226 Difference]: Without dead ends: 125 [2018-12-09 09:31:29,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=111, Invalid=533, Unknown=6, NotChecked=0, Total=650 [2018-12-09 09:31:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-09 09:31:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-12-09 09:31:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 09:31:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2018-12-09 09:31:29,107 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 36 [2018-12-09 09:31:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2018-12-09 09:31:29,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:31:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-12-09 09:31:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:31:29,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:29,108 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-09 09:31:29,108 INFO L423 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:29,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 521616347, now seen corresponding path program 1 times [2018-12-09 09:31:29,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:29,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:29,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:29,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:29,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:31:29,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:31:29,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:31:29,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:31:29,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-09 09:31:29,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 09:31:29,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 09:31:29,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 09:31:29,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 09:31:29,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-09 09:31:29,265 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-09 09:31:29,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:29,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:29,267 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand 6 states. [2018-12-09 09:31:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:29,356 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-12-09 09:31:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:31:29,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-09 09:31:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:29,357 INFO L225 Difference]: With dead ends: 104 [2018-12-09 09:31:29,357 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 09:31:29,358 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-09 09:31:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 09:31:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 09:31:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:31:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-12-09 09:31:29,360 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-12-09 09:31:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-12-09 09:31:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-12-09 09:31:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:31:29,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:29,361 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-09 09:31:29,361 INFO L423 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:29,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1399113306, now seen corresponding path program 1 times [2018-12-09 09:31:29,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:29,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:29,436 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-09 09:31:29,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:29,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 09:31:29,473 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-09 09:31:29,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:31:29,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:31:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:31:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:31:29,475 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 8 states. [2018-12-09 09:31:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:29,700 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-12-09 09:31:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:31:29,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-09 09:31:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:29,701 INFO L225 Difference]: With dead ends: 117 [2018-12-09 09:31:29,702 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 09:31:29,702 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-09 09:31:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 09:31:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-09 09:31:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:31:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-12-09 09:31:29,704 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 41 [2018-12-09 09:31:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:29,704 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-12-09 09:31:29,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:31:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-12-09 09:31:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:31:29,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:29,704 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-09 09:31:29,705 INFO L423 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:29,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1399113307, now seen corresponding path program 1 times [2018-12-09 09:31:29,705 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:29,705 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:29,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:29,907 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-09 09:31:29,908 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:29,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:31:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:29,910 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 11 states. [2018-12-09 09:31:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:30,566 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-09 09:31:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:31:30,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-12-09 09:31:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:30,568 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:31:30,568 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:31:30,569 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-09 09:31:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:31:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-09 09:31:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 09:31:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-12-09 09:31:30,572 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 41 [2018-12-09 09:31:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:30,572 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-12-09 09:31:30,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:31:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-12-09 09:31:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:31:30,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:30,573 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-09 09:31:30,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:30,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash 422839548, now seen corresponding path program 1 times [2018-12-09 09:31:30,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:30,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:30,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:30,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:30,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:31:30,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:31:30,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 09:31:30,794 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-09 09:31:30,796 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-09 09:31:30,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:30,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:31:30,809 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-09 09:31:30,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:31:30,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:31:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:31:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:31:30,811 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 14 states. [2018-12-09 09:31:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:31,308 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-12-09 09:31:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:31:31,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-12-09 09:31:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:31,308 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:31:31,308 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:31:31,309 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-09 09:31:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:31:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-09 09:31:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 09:31:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-09 09:31:31,311 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 42 [2018-12-09 09:31:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:31,311 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-09 09:31:31,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:31:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-09 09:31:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:31:31,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:31,313 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-09 09:31:31,313 INFO L423 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:31,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash 223124186, now seen corresponding path program 1 times [2018-12-09 09:31:31,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:31,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:31,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:31,409 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-09 09:31:31,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 09:31:31,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:31:31,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:31:31,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:31:31,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:31:31,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 09:31:31,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 09:31:31,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 15 treesize of output 7 [2018-12-09 09:31:31,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:31,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 09:31:31,563 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-09 09:31:31,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:31,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:31:31,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:31:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:31:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:31:31,566 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 14 states. [2018-12-09 09:31:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:32,295 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-12-09 09:31:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:31:32,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-09 09:31:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:32,296 INFO L225 Difference]: With dead ends: 127 [2018-12-09 09:31:32,296 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 09:31:32,297 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-09 09:31:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 09:31:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-12-09 09:31:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 09:31:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-12-09 09:31:32,300 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2018-12-09 09:31:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:32,300 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-12-09 09:31:32,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:31:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-12-09 09:31:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:31:32,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:32,301 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-09 09:31:32,301 INFO L423 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:32,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 434475099, now seen corresponding path program 1 times [2018-12-09 09:31:32,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:32,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:32,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:31:32,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:31:32,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 09:31:32,511 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-09 09:31:32,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 09:31:32,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:32,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:31:32,525 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-09 09:31:32,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:32,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:32,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:31:32,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:31:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:31:32,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:31:32,528 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 14 states. [2018-12-09 09:31:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:32,975 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-12-09 09:31:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:31:32,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-09 09:31:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:32,976 INFO L225 Difference]: With dead ends: 152 [2018-12-09 09:31:32,976 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 09:31:32,976 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-09 09:31:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 09:31:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-12-09 09:31:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 09:31:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-12-09 09:31:32,979 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 43 [2018-12-09 09:31:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:32,979 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-09 09:31:32,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:31:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-12-09 09:31:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:31:32,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:32,979 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-09 09:31:32,980 INFO L423 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:32,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash -803776262, now seen corresponding path program 1 times [2018-12-09 09:31:32,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:32,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:32,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:33,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:33,061 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-09 09:31:33,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:33,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:33,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 09:31:33,114 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-09 09:31:33,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 09:31:33,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:31:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:31:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:31:33,116 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 10 states. [2018-12-09 09:31:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:33,461 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-12-09 09:31:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:31:33,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-09 09:31:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:33,462 INFO L225 Difference]: With dead ends: 128 [2018-12-09 09:31:33,462 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 09:31:33,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:31:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 09:31:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-12-09 09:31:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 09:31:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-09 09:31:33,466 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 45 [2018-12-09 09:31:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:33,466 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-09 09:31:33,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:31:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-09 09:31:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:31:33,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:33,466 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-09 09:31:33,467 INFO L423 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:31:33,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash -803776261, now seen corresponding path program 1 times [2018-12-09 09:31:33,467 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:31:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:31:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:33,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:33,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:31:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:33,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:31:33,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:33,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:31:33,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:31:34,517 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-09 09:31:37,558 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 09:31:39,679 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 09:31:40,950 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 09:31:40,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:31:40,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:31:40,961 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-09 09:31:40,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:40,981 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-09 09:31:40,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:26 [2018-12-09 09:31:43,035 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 09:31:43,041 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-09 09:31:43,058 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-09 09:31:43,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:31:43,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:31:43,111 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-09 09:31:43,111 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:43,147 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-09 09:31:43,147 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:26, output treesize:7 [2018-12-09 09:31:43,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:31:43,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:31:43,166 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-09 09:31:43,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:31:43,196 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-09 09:31:43,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 09:31:43,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:31:43,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:31:43,344 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-09 09:31:43,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:43, output treesize:11 [2018-12-09 09:31:43,471 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-09 09:31:43,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:31:43,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:43,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 09:31:43,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 09:31:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 09:31:43,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=152, Unknown=3, NotChecked=24, Total=210 [2018-12-09 09:31:43,474 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 15 states. [2018-12-09 09:31:51,291 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:32:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:32:04,103 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-12-09 09:32:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:32:04,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-09 09:32:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:32:04,104 INFO L225 Difference]: With dead ends: 135 [2018-12-09 09:32:04,105 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 09:32:04,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=50, Invalid=257, Unknown=3, NotChecked=32, Total=342 [2018-12-09 09:32:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 09:32:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2018-12-09 09:32:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 09:32:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-12-09 09:32:04,108 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-12-09 09:32:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:04,108 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-12-09 09:32:04,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 09:32:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-12-09 09:32:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 09:32:04,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:32:04,109 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-09 09:32:04,109 INFO L423 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:32:04,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:32:04,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1739113668, now seen corresponding path program 1 times [2018-12-09 09:32:04,110 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:32:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:32:04,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:04,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:32:04,178 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-09 09:32:04,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:32:04,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:32:04,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:32:04,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:32:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:32:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:32:04,180 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 8 states. [2018-12-09 09:32:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:32:04,211 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-12-09 09:32:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:32:04,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-09 09:32:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:32:04,212 INFO L225 Difference]: With dead ends: 124 [2018-12-09 09:32:04,212 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 09:32:04,212 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-09 09:32:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 09:32:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-09 09:32:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 09:32:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-12-09 09:32:04,214 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 44 [2018-12-09 09:32:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:04,214 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-12-09 09:32:04,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:32:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-12-09 09:32:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:32:04,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:32:04,215 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-09 09:32:04,215 INFO L423 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:32:04,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:32:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1516661095, now seen corresponding path program 1 times [2018-12-09 09:32:04,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:32:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:32:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:04,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:32:04,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:32:04,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:32:04,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-09 09:32:04,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:32:04,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:32:04,428 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-09 09:32:04,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-09 09:32:04,498 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-09 09:32:04,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:32:04,503 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-09 09:32:04,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2018-12-09 09:32:10,530 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 09:32:12,571 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 09:32:14,613 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 09:32:16,660 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 09:32:16,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:32:16,666 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-09 09:32:16,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:32:16,683 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-09 09:32:16,685 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 18 treesize of output 16 [2018-12-09 09:32:16,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:32:16,698 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-09 09:32:16,698 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-09 09:32:16,711 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 16 treesize of output 14 [2018-12-09 09:32:16,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:32:16,721 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-09 09:32:16,734 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-09 09:32:16,734 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2018-12-09 09:32:16,778 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-09 09:32:16,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:32:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:32:16,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 09:32:16,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 09:32:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 09:32:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=2, NotChecked=0, Total=342 [2018-12-09 09:32:16,781 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 19 states. [2018-12-09 09:33:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:33:42,968 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-09 09:33:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 09:33:42,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-09 09:33:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:33:42,969 INFO L225 Difference]: With dead ends: 137 [2018-12-09 09:33:42,969 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 09:33:42,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=130, Invalid=858, Unknown=4, NotChecked=0, Total=992 [2018-12-09 09:33:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 09:33:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2018-12-09 09:33:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 09:33:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-12-09 09:33:42,972 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 46 [2018-12-09 09:33:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:33:42,972 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-09 09:33:42,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 09:33:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-12-09 09:33:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:33:42,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:33:42,973 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-09 09:33:42,974 INFO L423 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:33:42,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:33:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1516661094, now seen corresponding path program 1 times [2018-12-09 09:33:42,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:33:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:33:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:33:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:33:43,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:33:43,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:33:43,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:43,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:33:43,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:43,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:33:43,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:33:44,055 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-09 09:33:44,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:44,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:44,061 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-09 09:33:44,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:44,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 09:33:44,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:44,082 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-09 09:33:44,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-09 09:33:45,134 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 09:33:46,266 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 09:33:46,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:33:46,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:33:46,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:46,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:33:46,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:33:46,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-12-09 09:33:47,474 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 09:33:49,529 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 09:33:49,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:49,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:49,538 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-09 09:33:49,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:49,556 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-09 09:33:49,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:49,566 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-09 09:33:49,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2018-12-09 09:33:49,761 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-09 09:33:49,763 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-09 09:33:49,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:49,776 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-09 09:33:49,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:33:49,783 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-09 09:33:49,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2018-12-09 09:33:49,796 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-09 09:33:49,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:33:50,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:33:50,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:33:50,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:33:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:33:50,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:33:54,700 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 09:33:55,922 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 09:33:55,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:55,936 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-09 09:33:55,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:55,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:55,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:33:55,973 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-09 09:33:55,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:33:55,999 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-09 09:33:55,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2018-12-09 09:33:56,384 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-09 09:33:56,384 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:33:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:33:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-12-09 09:33:56,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 09:33:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 09:33:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=563, Unknown=3, NotChecked=48, Total=702 [2018-12-09 09:33:56,400 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 25 states. [2018-12-09 09:34:11,550 WARN L180 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-09 09:34:14,747 WARN L180 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-09 09:34:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:34:36,150 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-09 09:34:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 09:34:36,150 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-09 09:34:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:34:36,151 INFO L225 Difference]: With dead ends: 162 [2018-12-09 09:34:36,151 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 09:34:36,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=209, Invalid=1351, Unknown=4, NotChecked=76, Total=1640 [2018-12-09 09:34:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 09:34:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 120. [2018-12-09 09:34:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 09:34:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-09 09:34:36,153 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 46 [2018-12-09 09:34:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:34:36,153 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-09 09:34:36,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 09:34:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-09 09:34:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:34:36,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:34:36,154 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-09 09:34:36,154 INFO L423 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:34:36,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:34:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 852739627, now seen corresponding path program 1 times [2018-12-09 09:34:36,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:34:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:36,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:36,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:36,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:34:36,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:34:36,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:36,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:36,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:36,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 09:34:38,347 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-09 09:34:38,353 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-09 09:34:38,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:38,358 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-09 09:34:38,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 09:34:38,504 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-09 09:34:38,506 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-09 09:34:38,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:34:38,522 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-09 09:34:38,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:34:38,825 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:34:38,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,826 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-09 09:34:38,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-09 09:34:38,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:34:38,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:38,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:38,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:34:38,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:34:38,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:38,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 09:34:39,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 21 treesize of output 16 [2018-12-09 09:34:39,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:39,009 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-09 09:34:39,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 09:34:39,066 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-09 09:34:39,067 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-09 09:34:39,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:34:39,075 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-09 09:34:39,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:34:39,323 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:34:39,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:39,324 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-09 09:34:39,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-09 09:34:39,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:34:39,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-09 09:34:39,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:34:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:34:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2018-12-09 09:34:39,461 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 16 states. [2018-12-09 09:34:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:34:42,478 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-09 09:34:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:34:42,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-09 09:34:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:34:42,479 INFO L225 Difference]: With dead ends: 124 [2018-12-09 09:34:42,479 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 09:34:42,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=129, Invalid=686, Unknown=1, NotChecked=54, Total=870 [2018-12-09 09:34:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 09:34:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-12-09 09:34:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 09:34:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-09 09:34:42,482 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 46 [2018-12-09 09:34:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:34:42,482 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-09 09:34:42,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:34:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-09 09:34:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:34:42,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:34:42,482 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-09 09:34:42,482 INFO L423 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:34:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:34:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1583667848, now seen corresponding path program 1 times [2018-12-09 09:34:42,483 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:34:42,483 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:42,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:42,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:42,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:34:42,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:34:42,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 09:34:42,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, 1 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-09 09:34:42,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,785 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-09 09:34:42,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-12-09 09:34:42,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:42,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-12-09 09:34:42,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,956 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-09 09:34:42,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 09:34:42,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:42,967 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-09 09:34:42,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:12 [2018-12-09 09:34:42,990 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-09 09:34:42,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:34:42,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:34:42,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 09:34:42,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 09:34:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 09:34:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-09 09:34:42,992 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 18 states. [2018-12-09 09:34:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:34:44,045 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-09 09:34:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:34:44,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-09 09:34:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:34:44,046 INFO L225 Difference]: With dead ends: 133 [2018-12-09 09:34:44,046 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 09:34:44,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:34:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 09:34:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-09 09:34:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 09:34:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-09 09:34:44,048 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 46 [2018-12-09 09:34:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:34:44,048 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-09 09:34:44,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 09:34:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-09 09:34:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:34:44,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:34:44,049 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-09 09:34:44,049 INFO L423 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:34:44,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:34:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 228146322, now seen corresponding path program 1 times [2018-12-09 09:34:44,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:34:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:44,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:44,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:44,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:34:44,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:34:44,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:44,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:44,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:44,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 09:34:45,685 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-09 09:34:45,691 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-09 09:34:45,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:45,697 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-09 09:34:45,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 09:34:45,763 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-09 09:34:45,764 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-09 09:34:45,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:45,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:34:45,776 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-09 09:34:45,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:34:45,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:34:45,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:45,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:45,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:34:46,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:34:46,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 09:34:46,013 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-09 09:34:46,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:46,018 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-09 09:34:46,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 09:34:46,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 09:34:46,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 09:34:46,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:46,174 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-09 09:34:46,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 09:34:46,176 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-09 09:34:46,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:34:46,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:34:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-12-09 09:34:46,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:34:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:34:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2018-12-09 09:34:46,279 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 16 states. [2018-12-09 09:34:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:34:49,005 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:34:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:34:49,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-12-09 09:34:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:34:49,006 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:34:49,006 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:34:49,007 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-09 09:34:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:34:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-09 09:34:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:34:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-09 09:34:49,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 47 [2018-12-09 09:34:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:34:49,008 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-09 09:34:49,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:34:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-09 09:34:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:34:49,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:34:49,008 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-09 09:34:49,009 INFO L423 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:34:49,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:34:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 854953393, now seen corresponding path program 1 times [2018-12-09 09:34:49,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:34:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:34:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:49,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:49,070 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-09 09:34:49,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:34:49,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:34:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:34:49,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:34:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:34:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:34:49,072 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 5 states. [2018-12-09 09:34:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:34:49,078 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-12-09 09:34:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:34:49,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 09:34:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:34:49,079 INFO L225 Difference]: With dead ends: 103 [2018-12-09 09:34:49,079 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 09:34:49,079 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-09 09:34:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 09:34:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-09 09:34:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:34:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-09 09:34:49,080 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 46 [2018-12-09 09:34:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:34:49,080 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-09 09:34:49,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:34:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-09 09:34:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:34:49,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:34:49,081 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-09 09:34:49,081 INFO L423 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:34:49,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:34:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash 665124698, now seen corresponding path program 1 times [2018-12-09 09:34:49,081 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:34:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:34:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:34:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:34:49,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:34:49,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:34:49,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:49,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:49,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:34:49,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:34:49,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:34:49,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:49,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:49,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:49,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-09 09:34:51,336 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-09 09:34:54,105 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 09:34:55,637 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-09 09:34:55,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:55,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:55,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:55,653 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-09 09:34:55,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:55,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 09:34:55,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:34:55,692 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-09 09:34:55,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:55,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:55,722 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-09 09:34:55,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-12-09 09:34:56,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, 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-09 09:34:56,108 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-09 09:34:56,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:56,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:34:56,121 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-09 09:34:56,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 [2018-12-09 09:34:56,176 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-09 09:34:56,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:34:56,674 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 09:34:56,788 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 09:34:56,788 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:48, output treesize:1 [2018-12-09 09:35:01,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:35:01,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:35:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:35:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:35:01,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:35:01,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:35:01,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:35:01,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:35:01,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:35:01,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-09 09:35:01,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:01,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:01,319 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 23 treesize of output 39 [2018-12-09 09:35:01,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,343 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 33 treesize of output 26 [2018-12-09 09:35:01,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:01,350 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-09 09:35:01,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:01,373 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-09 09:35:01,373 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-12-09 09:35:02,032 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-09 09:35:02,034 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-09 09:35:02,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:02,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:02,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:35:02,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-12-09 09:35:02,081 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-09 09:35:02,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:35:02,414 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:02,414 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:37, output treesize:1 [2018-12-09 09:35:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:35:10,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 24 [2018-12-09 09:35:10,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 09:35:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 09:35:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=717, Unknown=5, NotChecked=110, Total=930 [2018-12-09 09:35:10,246 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 25 states. [2018-12-09 09:35:18,263 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-09 09:35:19,763 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 09:35:23,278 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-09 09:35:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:35:26,688 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-09 09:35:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:35:26,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-09 09:35:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:35:26,689 INFO L225 Difference]: With dead ends: 130 [2018-12-09 09:35:26,689 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 09:35:26,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=161, Invalid=1101, Unknown=6, NotChecked=138, Total=1406 [2018-12-09 09:35:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 09:35:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-12-09 09:35:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 09:35:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-09 09:35:26,691 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 47 [2018-12-09 09:35:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:35:26,691 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-09 09:35:26,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 09:35:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-09 09:35:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:35:26,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:35:26,691 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-09 09:35:26,692 INFO L423 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:35:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:35:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1412084645, now seen corresponding path program 1 times [2018-12-09 09:35:26,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:35:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:35:26,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:35:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:35:26,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:35:26,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:35:26,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:35:26,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:35:26,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:35:26,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-09 09:35:26,834 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-09 09:35:26,835 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-09 09:35:26,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,843 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-09 09:35:26,844 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-09 09:35:26,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:26,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 09:35:26,856 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-09 09:35:26,856 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:35:26,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:35:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:35:26,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:35:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:35:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:35:26,858 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-09 09:35:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:35:26,946 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-09 09:35:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:35:26,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 09:35:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:35:26,947 INFO L225 Difference]: With dead ends: 102 [2018-12-09 09:35:26,947 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 09:35:26,947 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-09 09:35:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 09:35:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 09:35:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:35:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-12-09 09:35:26,948 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 47 [2018-12-09 09:35:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:35:26,949 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-12-09 09:35:26,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:35:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-12-09 09:35:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:35:26,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:35:26,949 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-09 09:35:26,949 INFO L423 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:35:26,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:35:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1924264879, now seen corresponding path program 1 times [2018-12-09 09:35:26,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:35:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:35:26,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:35:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:35:27,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:35:27,075 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-09 09:35:27,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:27,077 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-09 09:35:27,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:27,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:27,081 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-09 09:35:27,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:27,093 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-09 09:35:27,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 09:35:27,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:35:27,107 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-09 09:35:27,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 09:35:27,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:35:27,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:35:27,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:27,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:27,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:27,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-09 09:35:36,373 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 09:35:36,383 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-09 09:35:36,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:36,390 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-09 09:35:36,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-12-09 09:35:36,424 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-09 09:35:36,426 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-09 09:35:36,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:36,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:12 [2018-12-09 09:35:38,341 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_19_#t~mem46.base_11| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_11| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_11|)))) is different from true [2018-12-09 09:35:41,136 WARN L180 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 09:35:43,139 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_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_unsafe_19_#t~mem46.base_11|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_probe_unsafe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_13| (_ bv0 1)))))) is different from true [2018-12-09 09:35:45,204 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-09 09:35:45,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:35:45,449 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:35:45,669 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-09 09:35:45,671 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-09 09:35:45,680 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-09 09:35:45,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:45,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:45,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:45,691 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-09 09:35:45,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2018-12-09 09:35:47,695 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_probe_unsafe_19_#in~a.base_19| (_ BitVec 32)) (|v_ldv_malloc_#res.base_94| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_probe_unsafe_19_#in~a.base_19| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_probe_unsafe_19_#in~a.base_19|) (_ bv0 1))) (= (store (store .cse0 |v_ldv_malloc_#res.base_94| (_ bv0 1)) |v_probe_unsafe_19_#in~a.base_19| (_ bv0 1)) |c_old(#valid)|) (not (= (select .cse0 |v_ldv_malloc_#res.base_94|) (_ bv0 1)))))) is different from false [2018-12-09 09:35:47,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:35:47,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:35:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:35:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:35:47,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:35:47,735 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-09 09:35:47,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:47,745 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-09 09:35:47,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:35:47,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:35:47,758 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-09 09:35:47,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:19 [2018-12-09 09:35:51,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:35:51,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:35:51,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-12-09 09:35:51,560 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-09 09:35:51,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:35:51,568 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-09 09:35:51,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-12-09 09:35:51,599 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-09 09:35:51,600 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-09 09:35:51,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:51,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:12 [2018-12-09 09:35:52,196 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_19_#t~mem46.base_16| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_16|) (_ bv0 1)) (= (store |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_16| (_ bv0 1)) |c_#valid|))) is different from true [2018-12-09 09:35:56,240 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_19| (_ BitVec 32)) (|v_probe_unsafe_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_unsafe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_19| (_ bv0 1))) (= (select .cse0 |v_probe_unsafe_19_#t~mem46.base_11|) (_ bv0 1)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_19|) (_ bv0 1))))) is different from true [2018-12-09 09:35:58,305 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-09 09:35:58,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:35:58,533 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 09:35:58,756 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-09 09:35:58,758 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-09 09:35:58,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-12-09 09:35:58,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:35:58,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:58,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:35:58,786 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-09 09:35:58,786 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:28 [2018-12-09 09:36:00,787 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_probe_unsafe_19_#in~a.base_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_probe_unsafe_19_#in~a.base_25| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 |v_ldv_malloc_#res.base_106|))) (not (= (select |c_#valid| |v_probe_unsafe_19_#in~a.base_25|) (_ bv0 1))) (= (store (store .cse0 |v_ldv_malloc_#res.base_106| (_ bv0 1)) |v_probe_unsafe_19_#in~a.base_25| (_ bv0 1)) |c_old(#valid)|)))) is different from false [2018-12-09 09:36:00,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:36:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-12-09 09:36:00,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:36:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:36:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=315, Unknown=15, NotChecked=246, Total=650 [2018-12-09 09:36:00,805 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 24 states. [2018-12-09 09:36:21,867 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-09 09:37:18,854 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 09:37:27,013 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-09 09:37:37,414 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-09 09:38:00,948 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-09 09:38:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:04,982 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-09 09:38:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:38:04,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-09 09:38:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:04,984 INFO L225 Difference]: With dead ends: 106 [2018-12-09 09:38:04,984 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 09:38:04,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 76.5s TimeCoverageRelationStatistics Valid=125, Invalid=627, Unknown=28, NotChecked=342, Total=1122 [2018-12-09 09:38:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 09:38:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-09 09:38:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 09:38:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-12-09 09:38:04,985 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 45 [2018-12-09 09:38:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:04,985 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-12-09 09:38:04,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:38:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-12-09 09:38:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 09:38:04,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:04,986 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-09 09:38:04,986 INFO L423 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1517398535, now seen corresponding path program 1 times [2018-12-09 09:38:04,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:05,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:05,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:05,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:05,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:38:05,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:05,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 10 treesize of output 9 [2018-12-09 09:38:05,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:05,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:05,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:05,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 09:38:07,292 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-09 09:38:07,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,310 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 52 [2018-12-09 09:38:07,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:07,341 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-09 09:38:07,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,345 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-09 09:38:07,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:07,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:07,375 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-09 09:38:07,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:55 [2018-12-09 09:38:07,491 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 24 treesize of output 21 [2018-12-09 09:38:07,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:07,498 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-09 09:38:07,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:24 [2018-12-09 09:38:07,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,680 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 52 [2018-12-09 09:38:07,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:07,702 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-09 09:38:07,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:53 [2018-12-09 09:38:07,782 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-09 09:38:07,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:07,785 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-09 09:38:07,785 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-09 09:38:07,790 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-09 09:38:07,795 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-09 09:38:07,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-12-09 09:38:07,839 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-09 09:38:07,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:38:07,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:38:07,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-09 09:38:07,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 09:38:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 09:38:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2018-12-09 09:38:07,841 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 23 states. [2018-12-09 09:38:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:08,916 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-12-09 09:38:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 09:38:08,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-12-09 09:38:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:08,917 INFO L225 Difference]: With dead ends: 83 [2018-12-09 09:38:08,917 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 09:38:08,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=130, Invalid=865, Unknown=1, NotChecked=60, Total=1056 [2018-12-09 09:38:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 09:38:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-09 09:38:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 09:38:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-09 09:38:08,920 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 48 [2018-12-09 09:38:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:08,920 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-09 09:38:08,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 09:38:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-09 09:38:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 09:38:08,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:08,921 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-09 09:38:08,921 INFO L423 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:08,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2045869131, now seen corresponding path program 1 times [2018-12-09 09:38:08,922 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:08,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:09,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:09,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:09,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:38:09,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:09,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:38:09,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 09:38:09,159 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-09 09:38:09,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:09,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-12-09 09:38:12,229 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 09:38:13,762 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 09:38:13,769 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-09 09:38:13,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:13,776 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-09 09:38:13,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-12-09 09:38:13,836 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-09 09:38:13,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,838 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-09 09:38:13,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 09:38:13,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:13,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:13,894 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-09 09:38:13,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:13,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-09 09:38:14,017 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-09 09:38:14,019 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-09 09:38:14,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-09 09:38:14,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:14,058 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-09 09:38:14,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,064 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-09 09:38:14,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 09:38:14,180 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-09 09:38:14,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:38:14,671 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 09:38:14,787 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-09 09:38:14,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,794 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 8 treesize of output 1 [2018-12-09 09:38:14,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,799 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-09 09:38:14,801 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-09 09:38:14,810 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-09 09:38:14,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:14,817 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:39, output treesize:6 [2018-12-09 09:38:14,986 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 12 [2018-12-09 09:38:14,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,015 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-09 09:38:15,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,039 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-09 09:38:15,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2018-12-09 09:38:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:38:15,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:15,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:15,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:15,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:15,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:38:15,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:15,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:38:15,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 09:38:15,186 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-09 09:38:15,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:15,193 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-09 09:38:15,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-12-09 09:38:15,218 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-09 09:38:15,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,219 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-09 09:38:15,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 09:38:15,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:15,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:15,279 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-09 09:38:15,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-09 09:38:15,288 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-09 09:38:15,290 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-09 09:38:15,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-09 09:38:15,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:15,298 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-09 09:38:15,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,304 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-09 09:38:15,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 09:38:15,352 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-09 09:38:15,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:38:15,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-12-09 09:38:15,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,659 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-09 09:38:15,660 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-09 09:38:15,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-09 09:38:15,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:6 [2018-12-09 09:38:15,755 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 12 [2018-12-09 09:38:15,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,784 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-09 09:38:15,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:15,805 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-09 09:38:15,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2018-12-09 09:38:15,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:38:15,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 20 [2018-12-09 09:38:15,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 09:38:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 09:38:15,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=778, Unknown=1, NotChecked=0, Total=870 [2018-12-09 09:38:15,874 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 21 states. [2018-12-09 09:38:28,378 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-12-09 09:38:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:31,540 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-09 09:38:31,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:38:31,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-12-09 09:38:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:31,541 INFO L225 Difference]: With dead ends: 91 [2018-12-09 09:38:31,541 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 09:38:31,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=250, Invalid=2099, Unknown=3, NotChecked=0, Total=2352 [2018-12-09 09:38:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 09:38:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-09 09:38:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 09:38:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-09 09:38:31,543 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2018-12-09 09:38:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:31,543 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-09 09:38:31,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 09:38:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-09 09:38:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 09:38:31,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:31,544 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-09 09:38:31,544 INFO L423 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:31,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2045869132, now seen corresponding path program 1 times [2018-12-09 09:38:31,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:31,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:31,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:31,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:31,711 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-09 09:38:31,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:38:31,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:38:31,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:38:31,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:38:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:38:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:38:31,713 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 9 states. [2018-12-09 09:38:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:31,911 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-09 09:38:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:38:31,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-09 09:38:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:31,912 INFO L225 Difference]: With dead ends: 85 [2018-12-09 09:38:31,912 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 09:38:31,912 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-09 09:38:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 09:38:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-09 09:38:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 09:38:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-09 09:38:31,913 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2018-12-09 09:38:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:31,913 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-09 09:38:31,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:38:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-09 09:38:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 09:38:31,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:31,914 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-09 09:38:31,914 INFO L423 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:31,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1002566357, now seen corresponding path program 1 times [2018-12-09 09:38:31,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:31,915 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:31,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:32,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:32,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:38:32,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:38:32,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 09:38:32,212 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-09 09:38:32,213 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-09 09:38:32,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:32,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:38:32,230 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-09 09:38:32,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:38:32,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:38:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 09:38:32,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:38:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:38:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:38:32,233 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 16 states. [2018-12-09 09:38:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:34,854 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-09 09:38:34,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:38:34,854 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-12-09 09:38:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:34,855 INFO L225 Difference]: With dead ends: 88 [2018-12-09 09:38:34,855 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 09:38:34,855 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-09 09:38:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 09:38:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-09 09:38:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 09:38:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-12-09 09:38:34,857 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 51 [2018-12-09 09:38:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:34,857 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-12-09 09:38:34,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:38:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-12-09 09:38:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 09:38:34,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:34,858 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-09 09:38:34,858 INFO L423 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:34,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1014785909, now seen corresponding path program 1 times [2018-12-09 09:38:34,859 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:34,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:35,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:35,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:35,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:35,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:35,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:38:35,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:35,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:38:35,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:35,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:35,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:35,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-09 09:38:37,257 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-09 09:38:37,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:37,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:37,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:37,276 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-09 09:38:37,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:37,305 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-09 09:38:37,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 09:38:37,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:37,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:37,344 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-09 09:38:37,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:51 [2018-12-09 09:38:37,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:37,767 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:38:37,767 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:38:37,780 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 2 case distinctions, treesize of input 41 treesize of output 82 [2018-12-09 09:38:37,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:38:37,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:38:37,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:83 [2018-12-09 09:38:38,122 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-09 09:38:38,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:38,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, 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-09 09:38:38,126 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-09 09:38:38,134 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-09 09:38:38,157 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-09 09:38:38,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:38,161 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-09 09:38:38,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:38,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:38,179 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-09 09:38:38,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2018-12-09 09:38:38,255 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-09 09:38:38,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:38:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:38:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-09 09:38:38,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:38:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:38:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2018-12-09 09:38:38,258 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 24 states. [2018-12-09 09:38:40,056 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-09 09:38:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:40,275 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-09 09:38:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 09:38:40,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-12-09 09:38:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:40,276 INFO L225 Difference]: With dead ends: 90 [2018-12-09 09:38:40,276 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 09:38:40,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=124, Invalid=871, Unknown=1, NotChecked=60, Total=1056 [2018-12-09 09:38:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 09:38:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 09:38:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 09:38:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-12-09 09:38:40,277 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-12-09 09:38:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:40,277 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-12-09 09:38:40,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:38:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-12-09 09:38:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:38:40,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:40,278 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-09 09:38:40,278 INFO L423 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:40,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1997466789, now seen corresponding path program 1 times [2018-12-09 09:38:40,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:40,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:40,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:40,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:38:40,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:40,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:38:40,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 09:38:40,511 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-09 09:38:40,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:40,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-12-09 09:38:41,974 WARN L854 $PredicateComparison]: unable to prove that (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-09 09:38:41,982 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-09 09:38:41,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:41,990 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-09 09:38:41,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-12-09 09:38:42,016 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-09 09:38:42,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-09 09:38:42,020 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-09 09:38:42,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-09 09:38:42,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 09:38:42,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-09 09:38:42,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2018-12-09 09:38:42,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:42,057 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-09 09:38:42,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:38:42,069 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-09 09:38:42,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-09 09:38:42,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:42,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:42,102 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 23 treesize of output 15 [2018-12-09 09:38:42,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:38:42,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-09 09:38:42,192 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-09 09:38:42,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:38:42,449 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:38:42,597 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-09 09:38:42,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,603 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-09 09:38:42,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,608 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-09 09:38:42,610 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-09 09:38:42,619 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-09 09:38:42,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:43, output treesize:6 [2018-12-09 09:38:42,716 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 10 [2018-12-09 09:38:42,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,718 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 14 treesize of output 7 [2018-12-09 09:38:42,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:38:42,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:28 [2018-12-09 09:38:42,921 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:38:42,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,945 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 14 treesize of output 1 [2018-12-09 09:38:42,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:42,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:26 [2018-12-09 09:38:43,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:38:43,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:38:43,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:43,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:43,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:38:43,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:38:43,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:38:43,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:38:43,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-09 09:38:43,279 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-09 09:38:43,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:43,286 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-09 09:38:43,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-09 09:38:43,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 09:38:43,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-09 09:38:43,317 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-09 09:38:43,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-09 09:38:43,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 09:38:43,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-09 09:38:43,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-09 09:38:43,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:43,338 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-09 09:38:43,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:38:43,350 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-09 09:38:43,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-09 09:38:43,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:43,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:38:43,376 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 23 treesize of output 15 [2018-12-09 09:38:43,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:38:43,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-09 09:38:43,390 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-09 09:38:43,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:38:43,587 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 09:38:43,695 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 8 treesize of output 1 [2018-12-09 09:38:43,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,700 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-09 09:38:43,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 09:38:43,710 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-09 09:38:43,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:6 [2018-12-09 09:38:43,751 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 10 [2018-12-09 09:38:43,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,753 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 14 treesize of output 7 [2018-12-09 09:38:43,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:38:43,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:28 [2018-12-09 09:38:43,872 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-09 09:38:43,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:38:43,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-12-09 09:38:43,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:38:43,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-12-09 09:38:43,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:38:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:38:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=577, Unknown=3, NotChecked=48, Total=702 [2018-12-09 09:38:43,945 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 20 states. [2018-12-09 09:38:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:53,966 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-09 09:38:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 09:38:53,966 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-12-09 09:38:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:53,966 INFO L225 Difference]: With dead ends: 90 [2018-12-09 09:38:53,967 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 09:38:53,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=175, Invalid=1308, Unknown=3, NotChecked=74, Total=1560 [2018-12-09 09:38:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 09:38:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-09 09:38:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 09:38:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-12-09 09:38:53,968 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 56 [2018-12-09 09:38:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:53,968 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-12-09 09:38:53,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:38:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-12-09 09:38:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 09:38:53,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:53,969 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-09 09:38:53,969 INFO L423 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:53,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1789714576, now seen corresponding path program 1 times [2018-12-09 09:38:53,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/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-09 09:38:53,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:38:54,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:38:54,036 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-09 09:38:54,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:38:54,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:38:54,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:38:54,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:38:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:38:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:38:54,038 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 8 states. [2018-12-09 09:38:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:38:54,060 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-09 09:38:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:38:54,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-09 09:38:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:38:54,060 INFO L225 Difference]: With dead ends: 89 [2018-12-09 09:38:54,060 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 09:38:54,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:38:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 09:38:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-09 09:38:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 09:38:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-09 09:38:54,062 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 57 [2018-12-09 09:38:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:38:54,062 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-09 09:38:54,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:38:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-09 09:38:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 09:38:54,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:38:54,062 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] [2018-12-09 09:38:54,063 INFO L423 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION]=== [2018-12-09 09:38:54,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:38:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 284796283, now seen corresponding path program 1 times [2018-12-09 09:38:54,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:38:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:38:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:38:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:38:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:38:54,469 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:38:54,487 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 09:38:54,488 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 09:38:54,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:38:54 BoogieIcfgContainer [2018-12-09 09:38:54,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:38:54,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:38:54,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:38:54,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:38:54,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:29:46" (3/4) ... [2018-12-09 09:38:54,499 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:38:54,506 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 09:38:54,507 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 09:38:54,537 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b15d9753-3f51-4d06-b783-49dbc2fe49bd/bin-2019/utaipan/witness.graphml [2018-12-09 09:38:54,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:38:54,538 INFO L168 Benchmark]: Toolchain (without parser) took 548893.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: Boogie Preprocessor took 18.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: RCFGBuilder took 254.97 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:38:54,538 INFO L168 Benchmark]: TraceAbstraction took 548208.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:38:54,539 INFO L168 Benchmark]: Witness Printer took 40.95 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:38:54,539 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.17 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 254.97 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 548208.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Witness Printer took 40.95 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1478]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-1216356918:0}] [L1492] CALL entry_point() VAL [ldv_global_msg_list={-1216356918:0}] [L1483] struct A19 a19; VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1455] int ret = - -3; VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1216356918:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, malloc(size)={-1557892848:0}, size=4] [L1457] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-1557892848:0}, ret=3] [L1457] a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-1557892848:0}, ret=3] [L1458] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=3] [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1216356918:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-134218281:0}, ldv_global_msg_list={-1216356918:0}, malloc(size)={-134218281:0}, size=4] [L1440] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-134218281:0}] [L1440] a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-134218281:0}] [L1441] a->p VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1441] COND TRUE a->p [L1442] return 0; VAL [\result=0, a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1460] RET, EXPR f19(a) VAL [a={134218272:0}, a={134218272:0}, f19(a)=0, ldv_global_msg_list={-1216356918:0}, ret=3] [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1464] CALL, EXPR g19() VAL [ldv_global_msg_list={-1216356918:0}] [L1451] return __VERIFIER_nondet_int(); [L1464] RET, EXPR g19() VAL [a={134218272:0}, a={134218272:0}, g19()=0, ldv_global_msg_list={-1216356918:0}, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1447] EXPR a->p VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1447] free(a->p) VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1447] free(a->p) [L1470] RET f19_undo(a) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] free(a->q) [L1474] return ret; VAL [\result=0, a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1484] RET, EXPR probe_unsafe_19(&a19) VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1478] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] [L1478] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] [L1478] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 85 locations, 21 error locations. UNSAFE Result, 548.1s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 417.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2689 SDtfs, 2710 SDslu, 13011 SDs, 0 SdLazy, 11362 SolverSat, 903 SolverUnsat, 195 SolverUnknown, 0 SolverNotchecked, 325.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2404 GetRequests, 1671 SyntacticMatches, 61 SemanticMatches, 672 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 207.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=19, 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, 37 MinimizatonAttempts, 398 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 126.7s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1857 ConstructedInterpolants, 336 QuantifiedInterpolants, 685367 SizeOfPredicates, 380 NumberOfNonLiveVariables, 7584 ConjunctsInSsa, 923 ConjunctsInUnsatCore, 46 InterpolantComputations, 29 PerfectInterpolantSequences, 122/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...