./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd0b9292151174331f3cf63e5ad3d651d29dfbcc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd0b9292151174331f3cf63e5ad3d651d29dfbcc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:08:01,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:08:01,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:08:01,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:08:01,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:08:01,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:08:01,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:08:01,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:08:01,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:08:01,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:08:01,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:08:01,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:08:01,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:08:01,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:08:01,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:08:01,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:08:01,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:08:01,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:08:01,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:08:01,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:08:01,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:08:01,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:08:01,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:08:01,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:08:01,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:08:01,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:08:01,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:08:01,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:08:01,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:08:01,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:08:01,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:08:01,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:08:01,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:08:01,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:08:01,221 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:08:01,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:08:01,222 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 02:08:01,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:08:01,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:08:01,232 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:08:01,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:08:01,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:08:01,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:08:01,233 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:08:01,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:08:01,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:08:01,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:08:01,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:08:01,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:08:01,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:08:01,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:08:01,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:08:01,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer 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 -> Automizer 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-12-02 02:08:01,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:08:01,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:08:01,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:08:01,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:08:01,267 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:08:01,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:01,303 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/608b610a9/25f007b6f9ef4fce8857d1e7883e0101/FLAG15959a8ad [2018-12-02 02:08:01,676 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:08:01,677 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:01,682 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/608b610a9/25f007b6f9ef4fce8857d1e7883e0101/FLAG15959a8ad [2018-12-02 02:08:02,035 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/608b610a9/25f007b6f9ef4fce8857d1e7883e0101 [2018-12-02 02:08:02,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:08:02,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 02:08:02,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:08:02,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:08:02,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:08:02,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02, skipping insertion in model container [2018-12-02 02:08:02,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:08:02,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:08:02,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:08:02,225 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:08:02,278 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:08:02,298 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:08:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02 WrapperNode [2018-12-02 02:08:02,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:08:02,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:08:02,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:08:02,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:08:02,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... [2018-12-02 02:08:02,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:08:02,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:08:02,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:08:02,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:08:02,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:08:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:08:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:08:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 02:08:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:08:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 02:08:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 02:08:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 02:08:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 02:08:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 02:08:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 02:08:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 02:08:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 02:08:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 02:08:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 02:08:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:08:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:08:02,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:08:02,634 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 02:08:02,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:02 BoogieIcfgContainer [2018-12-02 02:08:02,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:08:02,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:08:02,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:08:02,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:08:02,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:08:02" (1/3) ... [2018-12-02 02:08:02,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a76716c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:02, skipping insertion in model container [2018-12-02 02:08:02,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:02" (2/3) ... [2018-12-02 02:08:02,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a76716c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:02, skipping insertion in model container [2018-12-02 02:08:02,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:02" (3/3) ... [2018-12-02 02:08:02,639 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:02,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:08:02,650 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 02:08:02,659 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 02:08:02,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:08:02,675 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:08:02,675 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:08:02,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:08:02,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:08:02,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:08:02,675 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:08:02,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:08:02,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:08:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-12-02 02:08:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 02:08:02,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:02,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:02,692 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:02,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579010, now seen corresponding path program 1 times [2018-12-02 02:08:02,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:02,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:02,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:02,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:02,843 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2018-12-02 02:08:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,000 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-02 02:08:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:03,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 02:08:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,008 INFO L225 Difference]: With dead ends: 120 [2018-12-02 02:08:03,008 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 02:08:03,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 02:08:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-12-02 02:08:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 02:08:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-12-02 02:08:03,035 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 9 [2018-12-02 02:08:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,035 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-12-02 02:08:03,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-12-02 02:08:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 02:08:03,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:03,036 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579011, now seen corresponding path program 1 times [2018-12-02 02:08:03,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:03,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:03,068 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2018-12-02 02:08:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,159 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-12-02 02:08:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:03,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 02:08:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,160 INFO L225 Difference]: With dead ends: 94 [2018-12-02 02:08:03,160 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 02:08:03,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 02:08:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-02 02:08:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 02:08:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-12-02 02:08:03,167 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 9 [2018-12-02 02:08:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,168 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-12-02 02:08:03,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-12-02 02:08:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:08:03,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:03,169 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625574, now seen corresponding path program 1 times [2018-12-02 02:08:03,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:03,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:03,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:03,192 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-12-02 02:08:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,228 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-12-02 02:08:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:03,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:08:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,229 INFO L225 Difference]: With dead ends: 90 [2018-12-02 02:08:03,229 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 02:08:03,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 02:08:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-02 02:08:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 02:08:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-12-02 02:08:03,235 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2018-12-02 02:08:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,235 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-12-02 02:08:03,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-12-02 02:08:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:08:03,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:03,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625575, now seen corresponding path program 1 times [2018-12-02 02:08:03,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:03,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:03,268 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-12-02 02:08:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,299 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-02 02:08:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:03,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:08:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,299 INFO L225 Difference]: With dead ends: 86 [2018-12-02 02:08:03,300 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 02:08:03,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 02:08:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 02:08:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 02:08:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-12-02 02:08:03,305 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2018-12-02 02:08:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,305 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-12-02 02:08:03,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-12-02 02:08:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 02:08:03,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:03,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1720338793, now seen corresponding path program 1 times [2018-12-02 02:08:03,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:08:03,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:03,398 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2018-12-02 02:08:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,551 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-02 02:08:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:08:03,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 02:08:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,552 INFO L225 Difference]: With dead ends: 97 [2018-12-02 02:08:03,552 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 02:08:03,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:08:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 02:08:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-02 02:08:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 02:08:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-02 02:08:03,558 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2018-12-02 02:08:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,559 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-02 02:08:03,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-02 02:08:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 02:08:03,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:03,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1791173131, now seen corresponding path program 1 times [2018-12-02 02:08:03,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:08:03,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:08:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:08:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:03,630 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-12-02 02:08:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,716 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-02 02:08:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:03,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 02:08:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,717 INFO L225 Difference]: With dead ends: 105 [2018-12-02 02:08:03,717 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 02:08:03,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 02:08:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-12-02 02:08:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 02:08:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-02 02:08:03,722 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 16 [2018-12-02 02:08:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,722 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-02 02:08:03,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:08:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-02 02:08:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:03,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,723 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] [2018-12-02 02:08:03,724 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash -863246286, now seen corresponding path program 1 times [2018-12-02 02:08:03,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:08:03,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:08:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:08:03,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:03,777 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-12-02 02:08:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:03,889 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-12-02 02:08:03,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:08:03,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 02:08:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:03,890 INFO L225 Difference]: With dead ends: 101 [2018-12-02 02:08:03,890 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 02:08:03,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:08:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 02:08:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-12-02 02:08:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 02:08:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-12-02 02:08:03,893 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2018-12-02 02:08:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:03,894 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-12-02 02:08:03,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:08:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-12-02 02:08:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:03,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:03,895 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] [2018-12-02 02:08:03,895 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:03,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash -863246285, now seen corresponding path program 1 times [2018-12-02 02:08:03,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:03,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:03,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:03,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:08:03,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:08:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:08:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:03,990 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-12-02 02:08:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,119 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-02 02:08:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:08:04,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 02:08:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,120 INFO L225 Difference]: With dead ends: 98 [2018-12-02 02:08:04,120 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 02:08:04,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:08:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 02:08:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-12-02 02:08:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 02:08:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-12-02 02:08:04,123 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 25 [2018-12-02 02:08:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,124 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-02 02:08:04,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:08:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-12-02 02:08:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:04,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,125 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] [2018-12-02 02:08:04,125 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash -863258234, now seen corresponding path program 1 times [2018-12-02 02:08:04,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:04,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:04,140 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-12-02 02:08:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,148 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-12-02 02:08:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:04,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:08:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,149 INFO L225 Difference]: With dead ends: 72 [2018-12-02 02:08:04,149 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 02:08:04,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 02:08:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 02:08:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 02:08:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-02 02:08:04,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2018-12-02 02:08:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,153 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-02 02:08:04,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-02 02:08:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:04,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,153 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] [2018-12-02 02:08:04,154 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -862144052, now seen corresponding path program 1 times [2018-12-02 02:08:04,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:04,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:04,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:04,168 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 3 states. [2018-12-02 02:08:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,175 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-02 02:08:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:04,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:08:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,176 INFO L225 Difference]: With dead ends: 69 [2018-12-02 02:08:04,176 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 02:08:04,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 02:08:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-02 02:08:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 02:08:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-02 02:08:04,179 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 25 [2018-12-02 02:08:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,179 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-02 02:08:04,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-02 02:08:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:04,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,180 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] [2018-12-02 02:08:04,180 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash -862145304, now seen corresponding path program 1 times [2018-12-02 02:08:04,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:04,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:08:04,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:08:04,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:04,205 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-12-02 02:08:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,219 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-02 02:08:04,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:08:04,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 02:08:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,220 INFO L225 Difference]: With dead ends: 68 [2018-12-02 02:08:04,220 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 02:08:04,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 02:08:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-12-02 02:08:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 02:08:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-12-02 02:08:04,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2018-12-02 02:08:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,223 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-12-02 02:08:04,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:08:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-12-02 02:08:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 02:08:04,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:04,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1294075165, now seen corresponding path program 1 times [2018-12-02 02:08:04,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:08:04,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:08:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:08:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:04,267 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-12-02 02:08:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,332 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-02 02:08:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:08:04,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 02:08:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,333 INFO L225 Difference]: With dead ends: 66 [2018-12-02 02:08:04,333 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 02:08:04,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 02:08:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 02:08:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 02:08:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-02 02:08:04,335 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2018-12-02 02:08:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,335 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-02 02:08:04,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:08:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-02 02:08:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:08:04,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:04,336 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1461624531, now seen corresponding path program 1 times [2018-12-02 02:08:04,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:04,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:04,354 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-12-02 02:08:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:04,410 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-02 02:08:04,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:08:04,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 02:08:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:04,411 INFO L225 Difference]: With dead ends: 65 [2018-12-02 02:08:04,411 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 02:08:04,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 02:08:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 02:08:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 02:08:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-02 02:08:04,412 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 29 [2018-12-02 02:08:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:04,413 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-02 02:08:04,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-02 02:08:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:08:04,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:04,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:04,413 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:04,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -98352470, now seen corresponding path program 1 times [2018-12-02 02:08:04,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:04,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:04,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:08:04,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:08:04,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:04,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:04,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:04,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:04,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:04,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:04,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 02:08:04,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:04,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 02:08:04,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:04,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:04,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 02:08:04,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-02 02:08:04,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 02:08:04,760 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 24 treesize of output 23 [2018-12-02 02:08:04,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 02:08:04,793 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 34 treesize of output 33 [2018-12-02 02:08:04,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:04,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-02 02:08:04,853 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 36 treesize of output 34 [2018-12-02 02:08:04,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-02 02:08:04,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,876 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 26 treesize of output 26 [2018-12-02 02:08:04,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 02:08:04,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,886 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 8 [2018-12-02 02:08:04,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 02:08:04,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:04,904 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-02 02:08:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:04,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:08:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-02 02:08:04,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:08:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:08:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-12-02 02:08:04,938 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 17 states. [2018-12-02 02:08:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:05,419 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-02 02:08:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:08:05,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 02:08:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:05,420 INFO L225 Difference]: With dead ends: 71 [2018-12-02 02:08:05,420 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 02:08:05,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-12-02 02:08:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 02:08:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 02:08:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 02:08:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-02 02:08:05,422 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-12-02 02:08:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:05,422 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-02 02:08:05,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:08:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-02 02:08:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:08:05,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:05,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:05,423 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:05,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash -98352471, now seen corresponding path program 1 times [2018-12-02 02:08:05,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:05,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:05,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:08:05,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:08:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:05,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:05,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:05,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 02:08:05,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 02:08:05,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 02:08:05,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 02:08:05,640 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 26 treesize of output 25 [2018-12-02 02:08:05,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:05,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 02:08:05,680 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 28 treesize of output 28 [2018-12-02 02:08:05,683 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 17 [2018-12-02 02:08:05,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,699 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 10 [2018-12-02 02:08:05,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-02 02:08:05,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:05,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:05,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 02:08:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:05,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:08:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-12-02 02:08:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:08:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:08:05,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:08:05,738 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-12-02 02:08:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:06,087 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-02 02:08:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:08:06,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 02:08:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:06,087 INFO L225 Difference]: With dead ends: 70 [2018-12-02 02:08:06,087 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 02:08:06,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:08:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 02:08:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-02 02:08:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 02:08:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-02 02:08:06,089 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2018-12-02 02:08:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-02 02:08:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:08:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-02 02:08:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:08:06,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:06,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:06,090 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:06,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279712, now seen corresponding path program 1 times [2018-12-02 02:08:06,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:06,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:08:06,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:06,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:06,139 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2018-12-02 02:08:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:06,230 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-02 02:08:06,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:08:06,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-02 02:08:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:06,231 INFO L225 Difference]: With dead ends: 67 [2018-12-02 02:08:06,231 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 02:08:06,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:08:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 02:08:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 02:08:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 02:08:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-02 02:08:06,233 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 30 [2018-12-02 02:08:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:06,233 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-02 02:08:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-02 02:08:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:08:06,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:06,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:06,234 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:06,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279711, now seen corresponding path program 1 times [2018-12-02 02:08:06,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:06,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:06,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:06,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:06,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:06,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:06,252 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 3 states. [2018-12-02 02:08:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:06,274 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-02 02:08:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:06,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 02:08:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:06,275 INFO L225 Difference]: With dead ends: 63 [2018-12-02 02:08:06,275 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 02:08:06,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 02:08:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 02:08:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 02:08:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-02 02:08:06,277 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 30 [2018-12-02 02:08:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-02 02:08:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-02 02:08:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 02:08:06,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:06,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:06,278 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:06,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1979694254, now seen corresponding path program 1 times [2018-12-02 02:08:06,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:06,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:06,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:08:06,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:06,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:06,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:06,301 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2018-12-02 02:08:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:06,321 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-02 02:08:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:06,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-02 02:08:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:06,322 INFO L225 Difference]: With dead ends: 79 [2018-12-02 02:08:06,323 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 02:08:06,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 02:08:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-02 02:08:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 02:08:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-12-02 02:08:06,326 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 34 [2018-12-02 02:08:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:06,326 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-12-02 02:08:06,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-12-02 02:08:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 02:08:06,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:06,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:06,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:06,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1979693002, now seen corresponding path program 1 times [2018-12-02 02:08:06,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:08:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:08:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:06,364 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:08:06,376 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 02:08:06,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:08:06 BoogieIcfgContainer [2018-12-02 02:08:06,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:08:06,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:08:06,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:08:06,391 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:08:06,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:02" (3/4) ... [2018-12-02 02:08:06,395 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:08:06,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:08:06,395 INFO L168 Benchmark]: Toolchain (without parser) took 4357.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:06,396 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:08:06,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:06,397 INFO L168 Benchmark]: Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:06,397 INFO L168 Benchmark]: RCFGBuilder took 305.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:06,397 INFO L168 Benchmark]: TraceAbstraction took 3755.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 993.5 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:06,398 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:08:06,399 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 305.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3755.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 993.5 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=12, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={11:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={11:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={11:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={11:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={11:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={11:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={11:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 41 error locations. UNSAFE Result, 3.7s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 944 SDtfs, 732 SDslu, 2145 SDs, 0 SdLazy, 2135 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 445 ConstructedInterpolants, 11 QuantifiedInterpolants, 80133 SizeOfPredicates, 35 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:08:07,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:08:07,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:08:07,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:08:07,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:08:07,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:08:07,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:08:07,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:08:07,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:08:07,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:08:07,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:08:07,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:08:07,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:08:07,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:08:07,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:08:07,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:08:07,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:08:07,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:08:07,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:08:07,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:08:07,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:08:07,690 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:08:07,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:08:07,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:08:07,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:08:07,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:08:07,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:08:07,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:08:07,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:08:07,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:08:07,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:08:07,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:08:07,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:08:07,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:08:07,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:08:07,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:08:07,697 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-02 02:08:07,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:08:07,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:08:07,708 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:08:07,708 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:08:07,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:08:07,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:08:07,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:08:07,710 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:08:07,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:08:07,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:08:07,711 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 02:08:07,711 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_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer 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 -> Automizer 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-12-02 02:08:07,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:08:07,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:08:07,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:08:07,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:08:07,744 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:08:07,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:07,780 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/3f29358dc/6754a6a85d0b4579b0530c59c2371478/FLAGac616cae2 [2018-12-02 02:08:08,212 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:08:08,212 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:08,220 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/3f29358dc/6754a6a85d0b4579b0530c59c2371478/FLAGac616cae2 [2018-12-02 02:08:08,229 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/data/3f29358dc/6754a6a85d0b4579b0530c59c2371478 [2018-12-02 02:08:08,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:08:08,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 02:08:08,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:08:08,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:08:08,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:08:08,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a048df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08, skipping insertion in model container [2018-12-02 02:08:08,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:08:08,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:08:08,409 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:08:08,415 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:08:08,441 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:08:08,502 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:08:08,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08 WrapperNode [2018-12-02 02:08:08,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:08:08,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:08:08,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:08:08,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:08:08,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... [2018-12-02 02:08:08,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:08:08,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:08:08,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:08:08,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:08:08,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:08:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:08:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:08:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 02:08:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 02:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 02:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 02:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 02:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 02:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 02:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 02:08:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 02:08:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 02:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 02:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 02:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 02:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:08:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 02:08:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:08:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:08:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:08:08,947 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:08:08,947 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 02:08:08,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:08 BoogieIcfgContainer [2018-12-02 02:08:08,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:08:08,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:08:08,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:08:08,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:08:08,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:08:08" (1/3) ... [2018-12-02 02:08:08,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369ba690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:08, skipping insertion in model container [2018-12-02 02:08:08,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:08" (2/3) ... [2018-12-02 02:08:08,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369ba690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:08, skipping insertion in model container [2018-12-02 02:08:08,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:08" (3/3) ... [2018-12-02 02:08:08,952 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 02:08:08,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:08:08,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 02:08:08,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 02:08:08,986 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:08:08,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:08:08,986 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:08:08,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:08:08,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:08:08,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:08:08,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:08:08,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:08:08,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:08:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-12-02 02:08:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 02:08:09,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:09,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:09,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:09,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 44321787, now seen corresponding path program 1 times [2018-12-02 02:08:09,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:09,010 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:09,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:09,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:09,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:08:09,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 02:08:09,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:09,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 02:08:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:09,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:09,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:09,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:09,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:09,162 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-12-02 02:08:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:09,417 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-12-02 02:08:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:09,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 02:08:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:09,426 INFO L225 Difference]: With dead ends: 88 [2018-12-02 02:08:09,426 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 02:08:09,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 02:08:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-02 02:08:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 02:08:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-02 02:08:09,454 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2018-12-02 02:08:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:09,454 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-02 02:08:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-02 02:08:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 02:08:09,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:09,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:09,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 44321788, now seen corresponding path program 1 times [2018-12-02 02:08:09,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:09,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:09,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:09,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:09,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:09,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 02:08:09,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,551 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 12 treesize of output 21 [2018-12-02 02:08:09,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:09,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 02:08:09,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:09,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-02 02:08:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:09,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:09,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:09,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:09,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:08:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:08:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:08:09,594 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-12-02 02:08:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:09,931 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-12-02 02:08:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:08:09,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 02:08:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:09,933 INFO L225 Difference]: With dead ends: 110 [2018-12-02 02:08:09,934 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 02:08:09,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:08:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 02:08:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2018-12-02 02:08:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 02:08:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-12-02 02:08:09,941 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 9 [2018-12-02 02:08:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:09,942 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-12-02 02:08:09,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:08:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-12-02 02:08:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:08:09,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:09,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:09,943 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:09,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975463, now seen corresponding path program 1 times [2018-12-02 02:08:09,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:09,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:09,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:09,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:09,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:08:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:10,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:10,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:10,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:10,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:10,005 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2018-12-02 02:08:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:10,097 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-12-02 02:08:10,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:10,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:08:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:10,098 INFO L225 Difference]: With dead ends: 89 [2018-12-02 02:08:10,099 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 02:08:10,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 02:08:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-02 02:08:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 02:08:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-02 02:08:10,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2018-12-02 02:08:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:10,103 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-02 02:08:10,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-02 02:08:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:08:10,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:10,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:10,104 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:10,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975464, now seen corresponding path program 1 times [2018-12-02 02:08:10,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:10,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:10,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:10,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 02:08:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:10,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:10,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:10,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:10,173 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-12-02 02:08:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:10,262 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-12-02 02:08:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:10,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:08:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:10,263 INFO L225 Difference]: With dead ends: 85 [2018-12-02 02:08:10,263 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 02:08:10,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 02:08:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-02 02:08:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 02:08:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-02 02:08:10,266 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2018-12-02 02:08:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-02 02:08:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-02 02:08:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 02:08:10,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:10,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:10,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:10,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1028212614, now seen corresponding path program 1 times [2018-12-02 02:08:10,268 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:10,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:10,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:10,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 02:08:10,409 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 24 treesize of output 23 [2018-12-02 02:08:10,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 02:08:10,486 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 19 treesize of output 18 [2018-12-02 02:08:10,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,511 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 20 treesize of output 19 [2018-12-02 02:08:10,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:10,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 02:08:10,569 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 26 treesize of output 26 [2018-12-02 02:08:10,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 02:08:10,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,596 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 8 [2018-12-02 02:08:10,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 02:08:10,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,644 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 26 treesize of output 26 [2018-12-02 02:08:10,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 02:08:10,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,664 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 8 [2018-12-02 02:08:10,664 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 02:08:10,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:10,684 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-02 02:08:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:10,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:10,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:10,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:08:10,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-12-02 02:08:10,700 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2018-12-02 02:08:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:11,171 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-02 02:08:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:08:11,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 02:08:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:11,173 INFO L225 Difference]: With dead ends: 93 [2018-12-02 02:08:11,173 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 02:08:11,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2018-12-02 02:08:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 02:08:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-02 02:08:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 02:08:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-12-02 02:08:11,179 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 15 [2018-12-02 02:08:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:11,179 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-12-02 02:08:11,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-12-02 02:08:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 02:08:11,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:11,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:11,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:11,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1810098092, now seen corresponding path program 1 times [2018-12-02 02:08:11,182 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:11,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:11,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:11,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 02:08:11,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:11,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:11,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:08:11,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:11,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 02:08:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:11,355 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:11,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:11,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:08:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:08:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:08:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:11,358 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2018-12-02 02:08:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:11,614 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-02 02:08:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:08:11,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 02:08:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:11,615 INFO L225 Difference]: With dead ends: 93 [2018-12-02 02:08:11,616 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 02:08:11,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:08:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 02:08:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-02 02:08:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 02:08:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-02 02:08:11,620 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 16 [2018-12-02 02:08:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:11,620 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-02 02:08:11,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:08:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-02 02:08:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:08:11,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:11,621 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] [2018-12-02 02:08:11,621 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:11,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -659541597, now seen corresponding path program 1 times [2018-12-02 02:08:11,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:11,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:11,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:11,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:08:11,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 02:08:11,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:11,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:11,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 02:08:11,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:08:11,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 02:08:11,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:11,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 02:08:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:11,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:11,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:11,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:08:11,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:11,758 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 8 states. [2018-12-02 02:08:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:12,178 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-02 02:08:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:08:12,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-02 02:08:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:12,179 INFO L225 Difference]: With dead ends: 105 [2018-12-02 02:08:12,180 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 02:08:12,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:08:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 02:08:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-02 02:08:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 02:08:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-02 02:08:12,187 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2018-12-02 02:08:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:12,187 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-02 02:08:12,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-02 02:08:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:08:12,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:12,188 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] [2018-12-02 02:08:12,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:12,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash -659541596, now seen corresponding path program 1 times [2018-12-02 02:08:12,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:12,190 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:12,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:12,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:12,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:12,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:12,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:12,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 02:08:12,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 02:08:12,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 02:08:12,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,386 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-02 02:08:12,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 02:08:12,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:12,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 02:08:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:12,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:12,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:12,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:08:12,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:12,418 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-12-02 02:08:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:12,927 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-02 02:08:12,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:08:12,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-02 02:08:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:12,928 INFO L225 Difference]: With dead ends: 102 [2018-12-02 02:08:12,928 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 02:08:12,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:08:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 02:08:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-12-02 02:08:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 02:08:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-12-02 02:08:12,930 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 24 [2018-12-02 02:08:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:12,931 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-12-02 02:08:12,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-12-02 02:08:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:08:12,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:12,931 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] [2018-12-02 02:08:12,931 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:12,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash -659553545, now seen corresponding path program 1 times [2018-12-02 02:08:12,932 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:12,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:12,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:12,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:13,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:13,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:13,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:08:13,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:08:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:13,001 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2018-12-02 02:08:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:13,025 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-02 02:08:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:08:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-02 02:08:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:13,026 INFO L225 Difference]: With dead ends: 114 [2018-12-02 02:08:13,026 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 02:08:13,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 02:08:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-12-02 02:08:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 02:08:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-02 02:08:13,030 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 24 [2018-12-02 02:08:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:13,031 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-02 02:08:13,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:08:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-02 02:08:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:08:13,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:13,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:13,032 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:13,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1071674923, now seen corresponding path program 1 times [2018-12-02 02:08:13,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:13,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:13,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:13,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:13,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:13,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:13,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 02:08:13,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 02:08:13,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 02:08:13,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 02:08:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:13,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:13,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:13,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:08:13,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:08:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:08:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:08:13,155 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 7 states. [2018-12-02 02:08:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:13,350 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-02 02:08:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:08:13,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 02:08:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:13,351 INFO L225 Difference]: With dead ends: 114 [2018-12-02 02:08:13,351 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 02:08:13,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:08:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 02:08:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-12-02 02:08:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 02:08:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 02:08:13,354 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-12-02 02:08:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:13,354 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 02:08:13,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:08:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 02:08:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 02:08:13,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:13,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:13,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:13,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1137815676, now seen corresponding path program 1 times [2018-12-02 02:08:13,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:13,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:13,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:13,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:08:13,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 02:08:13,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:13,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:13,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 02:08:13,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:08:13,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 02:08:13,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 02:08:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:13,501 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:13,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:13,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:08:13,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:08:13,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:08:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:08:13,504 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-12-02 02:08:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:13,817 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-02 02:08:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:08:13,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 02:08:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:13,818 INFO L225 Difference]: With dead ends: 113 [2018-12-02 02:08:13,818 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 02:08:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:08:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 02:08:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-12-02 02:08:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 02:08:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-12-02 02:08:13,820 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2018-12-02 02:08:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:13,820 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-12-02 02:08:13,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:08:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-12-02 02:08:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:08:13,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:13,821 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:13,821 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:13,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash 923379735, now seen corresponding path program 1 times [2018-12-02 02:08:13,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:13,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:13,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:13,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:08:13,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 02:08:13,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:13,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:13,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 02:08:13,992 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 18 treesize of output 15 [2018-12-02 02:08:13,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:13,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-02 02:08:14,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 02:08:14,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 02:08:14,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:14,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-02 02:08:14,131 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 30 treesize of output 30 [2018-12-02 02:08:14,134 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 26 treesize of output 19 [2018-12-02 02:08:14,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-02 02:08:14,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:14,160 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-02 02:08:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:14,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:08:14,402 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 11 treesize of output 9 [2018-12-02 02:08:14,406 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 9 treesize of output 7 [2018-12-02 02:08:14,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:14,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:14,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 02:08:14,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-02 02:08:14,626 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 15 treesize of output 10 [2018-12-02 02:08:14,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,667 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 15 treesize of output 10 [2018-12-02 02:08:14,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:08:14,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2018-12-02 02:08:14,702 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 10 treesize of output 3 [2018-12-02 02:08:14,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,706 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 10 treesize of output 3 [2018-12-02 02:08:14,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:14,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:08:14,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-02 02:08:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:14,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:08:14,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-12-02 02:08:14,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:08:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:08:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:08:14,728 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 17 states. [2018-12-02 02:08:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:15,874 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-02 02:08:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:08:15,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-02 02:08:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:15,875 INFO L225 Difference]: With dead ends: 117 [2018-12-02 02:08:15,875 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 02:08:15,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:08:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 02:08:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-12-02 02:08:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 02:08:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-02 02:08:15,877 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-12-02 02:08:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:15,877 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-02 02:08:15,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:08:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-02 02:08:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:08:15,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:15,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:15,878 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:15,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash 923379736, now seen corresponding path program 1 times [2018-12-02 02:08:15,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:15,879 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:16,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:16,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:16,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:16,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 02:08:16,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 02:08:16,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:08:16,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:16,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-02 02:08:16,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:16,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:16,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,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 11 treesize of output 8 [2018-12-02 02:08:16,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:16,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:16,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-12-02 02:08:16,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-12-02 02:08:16,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:16,330 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 15 treesize of output 8 [2018-12-02 02:08:16,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:16,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2018-12-02 02:08:16,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 02:08:16,473 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 19 treesize of output 18 [2018-12-02 02:08:16,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,529 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 20 treesize of output 19 [2018-12-02 02:08:16,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 02:08:16,588 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 34 treesize of output 33 [2018-12-02 02:08:16,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:16,648 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-02 02:08:16,696 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 26 treesize of output 26 [2018-12-02 02:08: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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 02:08:16,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 02:08:16,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,756 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 36 treesize of output 34 [2018-12-02 02:08:16,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-02 02:08:16,759 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,782 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 23 treesize of output 14 [2018-12-02 02:08:16,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-02 02:08:16,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:16,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:16,817 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-12-02 02:08:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:16,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:08:18,033 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-02 02:08:18,036 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 21 [2018-12-02 02:08:18,038 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 11 treesize of output 7 [2018-12-02 02:08:18,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,045 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 25 treesize of output 21 [2018-12-02 02:08:18,047 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 11 treesize of output 7 [2018-12-02 02:08:18,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,058 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 25 [2018-12-02 02:08:18,060 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 11 treesize of output 7 [2018-12-02 02:08:18,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,228 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 19 treesize of output 17 [2018-12-02 02:08:18,231 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 7 treesize of output 5 [2018-12-02 02:08:18,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,237 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 17 [2018-12-02 02:08:18,239 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 7 treesize of output 5 [2018-12-02 02:08:18,240 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:18,359 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 28 treesize of output 26 [2018-12-02 02:08:18,362 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-02 02:08:18,362 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,374 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-02 02:08:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-02 02:08:18,380 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,391 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 02:08:18,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 02:08:18,522 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,536 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,538 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 24 treesize of output 22 [2018-12-02 02:08:18,541 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 12 treesize of output 10 [2018-12-02 02:08:18,541 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,552 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:18,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-02 02:08:18,676 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-02 02:08:19,062 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-02 02:08:19,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,070 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,071 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 26 treesize of output 17 [2018-12-02 02:08:19,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:19,154 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,154 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,155 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 14 [2018-12-02 02:08:19,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:19,242 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,242 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,243 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 20 treesize of output 11 [2018-12-02 02:08:19,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:19,309 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,309 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,309 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 18 treesize of output 9 [2018-12-02 02:08:19,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:19,387 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,387 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:08:19,387 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 16 treesize of output 7 [2018-12-02 02:08:19,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:19,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-02 02:08:19,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-12-02 02:08:19,697 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-12-02 02:08:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:19,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:08:19,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-12-02 02:08:19,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 02:08:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 02:08:19,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:08:19,895 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 21 states. [2018-12-02 02:08:20,899 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-12-02 02:08:21,515 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-12-02 02:08:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:28,984 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-12-02 02:08:28,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:08:28,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-12-02 02:08:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:28,986 INFO L225 Difference]: With dead ends: 119 [2018-12-02 02:08:28,986 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 02:08:28,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-12-02 02:08:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 02:08:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2018-12-02 02:08:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 02:08:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-02 02:08:28,988 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 29 [2018-12-02 02:08:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:28,988 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-02 02:08:28,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 02:08:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-02 02:08:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:08:28,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:28,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:28,989 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:28,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -912547506, now seen corresponding path program 1 times [2018-12-02 02:08:28,989 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:28,989 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:29,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:29,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:29,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:08:29,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 02:08:29,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:08:29,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-02 02:08:29,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:08:29,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:08:29,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-02 02:08:29,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:29,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:29,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 02:08:29,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-02 02:08:29,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 02:08:29,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 02:08:29,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 02:08:29,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:08:29,173 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 12 treesize of output 21 [2018-12-02 02:08:29,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:08:29,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:08:29,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 02:08:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:29,189 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:08:29,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:08:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:08:29,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:08:29,192 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-12-02 02:08:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:33,695 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-12-02 02:08:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:08:33,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-02 02:08:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:33,696 INFO L225 Difference]: With dead ends: 128 [2018-12-02 02:08:33,696 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 02:08:33,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:08:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 02:08:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-12-02 02:08:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 02:08:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-02 02:08:33,698 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-12-02 02:08:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:33,698 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-02 02:08:33,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:08:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-02 02:08:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:08:33,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:33,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:33,699 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:33,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -912547505, now seen corresponding path program 1 times [2018-12-02 02:08:33,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:33,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:08:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:33,749 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:33,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:33,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:33,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,751 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 3 states. [2018-12-02 02:08:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:33,852 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-12-02 02:08:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:33,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 02:08:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:33,853 INFO L225 Difference]: With dead ends: 100 [2018-12-02 02:08:33,853 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 02:08:33,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 02:08:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-12-02 02:08:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 02:08:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-12-02 02:08:33,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 29 [2018-12-02 02:08:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:33,856 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-12-02 02:08:33,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-12-02 02:08:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 02:08:33,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:33,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:33,857 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-12-02 02:08:33,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1698250232, now seen corresponding path program 1 times [2018-12-02 02:08:33,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 02:08:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db85eaea-9697-4559-8d70-4bf208bb7791/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 02:08:33,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:34,141 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:08:34,151 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 02:08:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:08:34 BoogieIcfgContainer [2018-12-02 02:08:34,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:08:34,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:08:34,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:08:34,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:08:34,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:08" (3/4) ... [2018-12-02 02:08:34,165 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:08:34,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:08:34,166 INFO L168 Benchmark]: Toolchain (without parser) took 25934.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -106.4 MB). Peak memory consumption was 202.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,166 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:08:34,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,166 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,166 INFO L168 Benchmark]: RCFGBuilder took 404.56 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: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,166 INFO L168 Benchmark]: TraceAbstraction took 25213.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,167 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:08:34,167 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 404.56 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: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25213.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2139090935:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2139090935:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 41 error locations. UNSAFE Result, 25.1s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 1101 SDslu, 2333 SDs, 0 SdLazy, 2877 SolverSat, 148 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 123 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 46 QuantifiedInterpolants, 110905 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1581 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...